330 search results - page 19 / 66 » On Modular Termination Proofs of General Logic Programs |
CC
2009
Springer
14 years 8 months ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
ENTCS
2008
13 years 8 months ago
2008
We show how to reason, in the proof assistant Coq, about realistic programming languages using a combination of separation logic and heterogeneous multimodal logic. A heterogeneou...
SAS
2010
Springer
13 years 6 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
CSFW
2010
IEEE
13 years 12 months ago
2010
IEEE
—Authorization logics allow concise specification of flexible access-control policies, and are the basis for logic-based access-control systems. In such systems, resource owner...