Sciweavers

223 search results - page 4 / 45
» Dafny: An Automatic Program Verifier for Functional Correctn...
Sort
View
CAV
2010
Springer
157views Hardware» more  CAV 2010»
13 years 9 months ago
Local Verification of Global Invariants in Concurrent Programs
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...
Ernie Cohen, Michal Moskal, Wolfram Schulte, Steph...
PLDI
2010
ACM
13 years 10 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
JLP
2007
114views more  JLP 2007»
13 years 5 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
PLDI
2003
ACM
13 years 11 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
FM
2006
Springer
161views Formal Methods» more  FM 2006»
13 years 9 months ago
Changing Programs Correctly: Refactoring with Specifications
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
Fabian Bannwart, Peter Müller