330 search results - page 28 / 66 » On Modular Termination Proofs of General Logic Programs |
LICS
2002
IEEE
14 years 26 days ago
2002
IEEE
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
AGP
1998
IEEE
14 years 6 days ago
1998
IEEE
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
PPDP
2007
Springer
14 years 2 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
KBSE
2000
IEEE
13 years 11 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...