Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Verifying Termination and Error-Freedom of Logic Programs with block
  Declarations   We present verification methods for logic programs with delay declarations.
The verified properties are termination and freedom from errors related to
built-ins. Concerning termination, we present two approaches. The first
approach tries to eliminate the well-known problem of speculative output
bindings. The second approach is based on identifying the predicates for which
the textual position of an atom using this predicate is irrelevant with respect
to termination. Three features are distinctive of this work: it allows for
predicates to be used in several modes; it shows that block declarations, which
are a very simple delay construct, are sufficient to ensure the desired
properties; it takes the selection rule into account, assuming it to be as in
most Prolog implementations. The methods can be used to verify existing
programs and assist in writing new programs.

18
The categories of this paper are: econ
14
The categories of this paper are: math-ph
21
The categories of this paper are: adap-org
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
15
The categories of this paper are: nucl-ex
34
The categories of this paper are: chem-ph
28
The categories of this paper are: alg-geom
29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol
27
The categories of this paper are: comp-gas
13
The categories of this paper are: quant-ph
5
The categories of this paper are: gr-qc