See this document in CiteSeerX!

Proving That Programs Eventually Do Something Good  (Make Corrections)  
Byron Cook Microsoft Research Alexey Gotsman University...



  Home/Search   Context   Related

 
View or download:
rice.edu/~vardi/papers/popl07.pdf.gz


From:  rice.edu/~vardi/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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 to properties that guarantee the absence of bad events (safety properties). Until now no formal software analysis tool has provided fully automatic support for proving properties that ensure that good events eventually happen (liveness properties). In this paper we present such a tool, which handles liveness properties of... (Update)

Active bibliography (related documents):   More   All
2.1:   Termination Proofs for Systems Code - Ron Cook Microsoft (2006)   (Correct)
1.7:   Terminator: Beyond Safety - Ron Cook Andreas (2006)   (Correct)
1.4:   Automatic Termination Proofs for Programs With Shape-Shifting .. - Josh Berdine Byron (2006)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ microsoft-proving,
  author = "Ron Cook Microsoft",
  title = "Proving That Programs Eventually Do Something Good",
  url = "citeseer.ist.psu.edu/765623.html" }
Citations (may not include all citations):
1180   The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - MANNA, PNUELI - 1992
539   The temporal logic of programs (context) - PNUELI - 1977
375   IEEE Transactions on Software Engineering (context) - HOLZMANN - 1997
270   Bandera: Extracting finite-state models from Java source cod.. - CORBETT, DWYER et al. - 2000
267   Computer Aided Verification of Coordinating Processes (context) - KURSHAN - 1994
231   Information processing letters (context) - ALPERN, SCHNEIDER - 1985
223   Assigning meanings to programs (context) - FLOYD - 1967
200   Construction of abstract state graphs with PVS - GRAF, SA - 1997
139   Reasoning about infinite computations - VARDI, WOLPER - 1994
104   Model checking programs - VISSER, HAVELUND et al. - 2003
88   Lazy abstraction - HENZINGER, JHALA et al. - 2002
85   Patterns in property specifications for finite-state verific.. - DWYER, AVRUNIN et al. - 1999
85   Recognizing safety and liveness - ALPERN, SCHNEIDER - 1987
22   Algorithmic verification of linear temporal logic specificat.. - KESTEN, PNUELI et al. - 1998
18   Verification of concurrent programs---the automatatheoretic .. - VARDI - 1991
12   Liveness checking as safety checking - BIERE, ARTHO et al. - 2002
10   The ForSpec temporal logic: A new temporal property-specific.. - ARMONI, FIX et al. - 2002
9   Generating finite-state abstractions of reactive systems usi.. (context) - ON, URIBE - 1998
9   SLIC: A specification language for interface checking (context) - BALL, RAJAMANI - 2001
7   Transition invariants (context) - PODELSKI, RYBALCHENKO - 2004
7   A complete method for the synthesis of linear ranking functi.. (context) - PODELSKI, RYBALCHENKO - 2004
5   Termination of polynomial programs (context) - BRADLEY, MANNA et al. - 2005
5   Thorough static analysis of device drivers - BALL, BOUNIMOVA et al. - 2006
4   Proving program invariance and termination by parametric abs.. (context) - COUSOT - 2005
4   Termination proofs for systems code - COOK, PODELSKI et al. - 2006
4   Abstraction refinement for termination - COOK, PODELSKI et al. - 2005
3   Windows Static Driver Verifier (context) - CORPORATION - 2006
2   Linear ranking with reachability (context) - BRADLEY, MANNA et al. - 2005
2   Automatic termination proofs for programs with shape-shiftin.. - BERDINE, COOK et al. - 2006
2   Terminator: Beyond safety - COOK, PODELSKI et al. - 2006
1   Separating fairness and well-foundedness for the analysis of.. (context) - PNUELI, PODELSKI et al. - 2005
1   Variance analyses from invariance analyses (context) - BERDINE, CHAWDHARY et al. - 2007

Documents on the same site (http://www.cs.rice.edu/~vardi/papers/):   More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994)   (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994)   (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC