101 search results - page 8 / 21 » Cyclic proofs of program termination in separation logic |
171
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
APLAS
2009
ACM
15 years 4 months ago
2009
ACM
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
102
click to vote
ECOOP
2010
Springer
15 years 28 days ago
2010
Springer
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
71
Voted
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
SAS
2004
Springer
15 years 3 months ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...