101 search results - page 12 / 21 » Cyclic proofs of program termination in separation logic |
101
Voted
PLPV
2009
ACM
15 years 6 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
166
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We define a logic, free of side conditions, which permits more precise statements of a pr...
PPDP
2007
Springer
15 years 3 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...
162
Voted
CC
2009
Springer
15 years 10 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...