101 search results - page 6 / 21 » Cyclic proofs of program termination in separation logic |
LATA
2009
Springer
15 years 4 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
104
click to vote
TPHOL
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
154
click to vote
ESOP
2011
Springer
14 years 1 months ago
2011
Springer
We develop and prove sound a concurrent separation logic for a language with Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is...
TPHOL
2007
IEEE
15 years 3 months ago
2007
IEEE
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
113
click to vote
ICLP
2010
Springer
14 years 8 months ago
2010
Springer
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...