101 search results - page 4 / 21 » Cyclic proofs of program termination in separation logic |
CSL
2007
Springer
13 years 12 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ļ...
POPL
2012
ACM
12 years 1 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the veriļ¬cation of full functional properties of inductive tree data-structures using recursion that are soun...
ENTCS
2008
13 years 5 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...
PPDP
2009
Springer
13 years 10 months ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Taitās method with context-based reducibility pred...
CSL
2004
Springer
13 years 9 months ago
2004
Springer
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...