101 search results - page 16 / 21 » Cyclic proofs of program termination in separation logic |
152
click to vote
TLCA
2005
Springer
15 years 11 months ago
2005
Springer
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
218
click to vote
POPL
2011
ACM
14 years 8 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
138
click to vote
APLAS
2009
ACM
16 years 13 days ago
2009
ACM
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
164
click to vote
APLAS
2006
ACM
15 years 12 months ago
2006
ACM
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
174
click to vote
PEPM
2009
ACM
16 years 2 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...