Proving that programs eventually do something good

ACM SIGPLAN Notices

Volumn 42, Issue 1, 2007, Pages 265-276

  Cook, Byron ^a   Gotsman, Alexey ^b   Podelski, Andreas ^c   Rybalchenko, Andrey ^d   Vardi, Moshe Y ^e  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c UNIVERSITY OF FREIBURG   (Germany)

^d EPFL   (Switzerland)

^e RICE UNIVERSITY   (United States)

Author keywords

Formal verification; Liveness; Software model checking; Termination

Indexed keywords

AUTOMATA THEORY; COMPUTER OPERATING SYSTEMS; COMPUTER VIRUSES; SECURITY OF DATA;

FORMAL VERIFICATION; LIVENESS; SOFTWARE MODEL CHECKING; TERMINATION;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 33846546151     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1190215.1190257     Document Type: Conference Paper

References (33)

1. ALBIN ET AL. Property specification language reference manual. Tech. Rep. Version 1.1, Accellera, 2004.
2. ALPERN, B., AND SCHNEIDER, F. Defining liveness. Information processing letters 21 (1985), 181-185.
3. ALPERN, B., AND SCHNEIDER, F. Recognizing safety and liveness. Distributed computing 2 (1987), 117-126.
4. ARMONI, R., FIX, L., FLAISHER, A., GERTH, R., GINSBURG, B., KANZA, T., LANDVER, A., MADOR-HAIM, S., SINQERMAN, E., TIEMEYER, A., VARDI, M., AND ZBAR, Y. The ForSpec temporal logic: A new temporal property-specification logic. In TACAS'02: Tools and Algorithms for the Construction and Analysis of Systems (2002), vol. 2280 of LNCS, Springer-Verlag, pp. 296-311.
5. BALL, T., BOUNIMOVA, E., COOK, B., LEVIN, V., LICHTENBERG, J., MCGARVEY, C., ONDRUSEK, B., RAJAMANI, S. K., AND USTUNER, A. Thorough static analysis of device drivers. In EumSys'06: European Systems Conference (2006).
6. BALL, T., AND RAJAMANI, S. K. SLIC: A specification language for interface checking (of C). Tech. Rep. MSR-TR-2001-21, Microsoft Research, 2001.
7. BERDINE, J., CHAWDHARY, A., COOK, B., DTSTEFANO, D., AND O'HEARN, P. Variance analyses from invariance analyses. In POPL'07: Principles of Programming Languages (2007), ACM Press.
8. BERDINE, J., COOK, B., DISTEFANO, D., AND O'HEARN, P. Automatic termination proofs for programs with shape-shifting heaps. In CAV'06: Computer-Aided Verification (2006), vol. 4144 of LNCS, Springer-Verlag, pp. 386-400.
9. BIERE, A., ARTHO, C., AND SCHUPPAN, V. Liveness checking as safety checking. In FMICS'02: Formal Methods for Industrial Critical Systems (2002), vol. 66(2) of ENTCS.
10. BRADLEY, A., MANNA, Z., AND SIPMA, H. Linear ranking with reachability. In CAV'05: Computer-Aided Verification (2005), vol. 3576 of LNCS, Springer-Verlag, pp. 491-504.
11. BRADLEY, A., MANNA, Z., AND SIPMA, H. Termination of polynomial programs. In VMCAI'05: Verification, Model Checking, and Abstract Interpretation (2005), vol. 3385 of LNCS, Springer-Verlag, pp. 113-129.
12. COLON, M. A., AND URIBE, T. E. Generating finite-state abstractions of reactive systems using decision procedures. In CAV98: Computer-Aided Verification (1998), vol. 1427 of LNCS, Springer-Verlag, pp. 293-304.
13. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. Abstraction refinement for termination. In SAS'05: Static Analysis Symposium (2005), vol. 3672 of LNCS, Springer-Verlag, pp. 87-101.
14. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. Termination proofs for systems code. In PLDI'06: Programming Language Design and Implementation (2006), ACM Press, pp. 415-426.
15. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. Terminator: Beyond safety. In CAV'06: Computer-Aided Verification (2006), vol. 4144 of LNCS, Springer-Verlag, pp. 415-418.
16. CORBETT, J., DWYER, M., HATCLIEF, J., PASAREANU, C., ROBBY, LAUBACH, S., AND ZHENG, H. Bandera: Extracting finite-state models from Java source code. In ICSE'00: Int. Conf. on Software Engineering (2000), IEEE Press, pp. 439-448.
17. COUSOT, P. Proving program invariance and termination by parametric abstraction, Lagrangian relaxation and semidefinite programming. In VMCAI'05: Verification, Model Checking, and Abstract Interpretation (2005), vol. 3385 of LNCS, Springer-Verlag, pp. 1-24.
18. DWYER, M. B., AVRUNIN, G. S., AND CORBETT, J. C. Patterns in property specifications for finite-state verification. In ICSE'99: Int. Conf. on Software Engineering (1999), IEEE Press, pp. 411-420.
19. FLOYD, R. W. Assigning meanings to programs. In Mathematical Aspects of Computer Science (1967), J. T. Schwartz, Ed., vol. 19 of Proceedings of Symposia in Applied Mathematics, American Mathematical Society, pp. 19-32.
20. GRAF, S., AND SAÏDI, H. Construction of abstract state graphs with PVS. In CAV97: Computer-Aided Verification (1997), vol. 1254 of LNCS, Springer-Verlag, pp. 72-83.
21. HENZINGER, T., JHALA, R., MAJUMDAR, R., AND SUTRE, G. Lazy abstraction. In POPL'02: Principles of Programming Languages (2002), ACM Press, pp. 58-70.
22. HOLZMANN, G. J. The model checker SPIN. IEEE Transactions on Software Engineering 23, 5 (1997), 279-295.
23. KESTEN, Y., PNUELI, A., AND RAVIV, L. Algorithmic verification of linear temporal logic specifications. In ICALP'98: Int. Colloq. on Automata, Languages and Programming (1998), vol. 1443 of LNCS, Springer-Verlag, pp. 1-16.
24. KURSHAN, R. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
25. MANNA, Z., AND PNUELI, A. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin, 1992.
26. MICROSOFT CORPORATION. Windows Static Driver Verifier. Available at www.microsoft.com/whdc/devtools/tools/SDV.mspx, July 2006.
27. PNUELI, A. The temporal logic of programs. In Proc. 18th IEEE Symp. on Foundation of Computer Science (1977), pp. 46-57.
28. PNUELI, A., PODELSKI, A., AND RYBALCHENKO, A. Separating fairness and well-foundedness for the analysis of fair discrete systems. In TACAS'05: Tools and. Algorithms for the Construction and Analysis of Systems (2005), vol. 3440 of LNCS, Springer-Verlag, pp. 124-139.
29. PODELSKI, A., AND RYBALCHENKO, A. A complete method for the synthesis of linear ranking functions. In VMCAI'04: Verification, Model Checking, and Abstract Interpretation (2004), vol. 2937 of LNCS, Springer-Verlag, pp. 239-251.
30. PODELSKI, A., AND RYBALCHENKO, A. Transition invariants. In LICS'04: Logic in Computer Science. (2004), LNCS, IEEE Press, pp. 32-41.
31. VARDI, M. Verification of concurrent programs - the automatatheoretic framework. Annals of Pure and Applied Logic 51 (1991), 79-98.
32. VARDI, M., AND WOLPER, P. Reasoning about infinite computations. Information and. Computation 115, 1 (1994), 1-37.
33. VISSER, W., HAVELUND, K., BRAT, G., PARK, S., AND LERDA, F. Model checking programs. Automated Software Engineering Journal 10, 1 (2003).