Sciweavers

222 search results - page 11 / 45
» Subject Reduction of Logic Programs as Proof-Theoretic Prope...
Sort
View
POPL
2009
ACM
15 years 10 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
CSL
2008
Springer
14 years 11 months ago
On the Almighty Wand
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Rémi Brochenin, Stéphane Demri, &Eac...
POPL
2007
ACM
15 years 9 months ago
Proving that programs eventually do something good
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
Byron Cook, Alexey Gotsman, Andreas Podelski, Andr...
TLCA
1995
Springer
15 years 29 days ago
A Simple Calculus of Exception Handling
We introduce a simply-typed λ-calculus (λ→ exn ) featuring an ML-like exception handling mechanism. This calculus, whose type system corresponds to classical logic through the ...
Philippe de Groote
POPL
2009
ACM
15 years 10 months ago
A calculus of atomic actions
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran