151 search results - page 13 / 31 » Predicate Abstraction in a Program Logic Calculus |
TYPES
2004
Springer
14 years 22 days ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
ASP
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, feat...
SEFM
2005
IEEE
14 years 29 days ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...