51 search results - page 3 / 11 » Verifying Statecharts with State Invariants |
TLDI
2010
ACM
13 years 7 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
CAV
2010
Springer
13 years 10 months ago
2010
Springer
We describe a practical method for reasoning about realistic concurrent programs. Our method allows global two-state invariants that restrict update of shared state. We provide sim...
LICS
2012
IEEE
11 years 9 months ago
2012
IEEE
—We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the s...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...