Sciweavers

837 search results - page 48 / 168
» Proof Development with OMEGA
Sort
View
PLDI
2010
ACM
14 years 2 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
VMCAI
2004
Springer
14 years 3 months ago
Liveness with Invisible Ranking
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...
Yi Fang, Nir Piterman, Amir Pnueli, Lenore D. Zuck
ICFEM
2000
Springer
14 years 1 months ago
Fragmented Retrenchment, Concurrency and Fairness
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
Richard Banach, Michael Poppleton
LPAR
2012
Springer
12 years 5 months ago
The TPTP Typed First-Order Form with Arithmetic
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...
TPHOL
2009
IEEE
14 years 4 months ago
Practical Tactics for Separation Logic
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
Andrew McCreight