Lifting temporal proofs through abstractions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2575, Issue , 2003, Pages 174-188

  Namjoshi, Kedar S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

DATA INDEPENDENCE; DECISION PROCEDURE; FINITE-STATE ABSTRACTION; PREDICATE ABSTRACTIONS; PROOF OF CORRECTNESS; PROOF-CARRYING CODE; STRUCTURAL RELATIONSHIP; SYMMETRY REDUCTION;

MODEL CHECKING;

EID: 35248849245     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36384-x_16     Document Type: Article

References (32)

1. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. D. Zuck. Parameterized verification with automatically computed inductive assertions. In CAV, volume 2102 of LNCS, 2001.
2. M. Browne, E.M. Clarke, and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59, 1988.
3. E.M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop on Logics of Programs, volume 131 of LNCS. Springer-Verlag, 1981.
4. E. M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. In CAV, volume 697 of LNCS, 1993.
5. E.W. Dijkstra and C.S. Scholten. Predicate Calculus and Program Semantics. Springer Verlag, 1990.
6. E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In FOCS, 1991.
7. E.A. and C-L. Lei. Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In LICS, 1986.
8. E. A. Emerson and A. P. Sistla. Symmetry and model checking. In CAV, volume 697 of LNCS, 1993.
9. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV, volume 1254 of LNCS, 1997.
10. R.H. Hardin, Z. Har'el, and R.P. Kurshan. COSPAN. In CA V, volume 1102 of LNCS, 1996.
11. T. A. Henzinger, R. Jhala, R. Majumdar, G. C. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. In CAV, volume 2404 of LNCS, 2002.
12. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: a foundation for three-valued program analysis. In ESOP, number 2028 in LNCS, 2001.
13. M. Hennessy and R. Milner. Algebriac laws for nondeterminism and concurrency. J.ACM, 1985.
14. D. Janin and I. Walukiewicz. Automata for the modal mu-calulus and related results. In MFCS, volume 969 of LNCS, 1995.
15. R.M. Keller. Formal verification of parallel programs. CACM, 1976.
16. D. Kozen. Results on the propositional mu-calculus. In ICALP, volume 140 of LNCS, 1982.
17. Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. Information and Computation, 163(1), 2000.
18. K.G. Larsen and B. Thomsen. A modal process logic. In LICS, 1988.
19. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
20. E. Mendelson. Introduction to Mathematical Logic. Chapman and Hall (4th Edition), 1997.
21. R. Milner. An algebraic definition of simulation between programs. In 2nd IJCAI, 1971.
22. K. S. Namjoshi. Certifying model checkers. In CAV, volume 2102 of LNCS, 2001.
23. G.C. Necula and P. Lee. Safe kernel extensions without run-time checking. In OSDI, 1996.
24. D. Park. Concurrency and automata on infinite sequences, volume 154 of LNCS. Springer Verlag, 1981.
25. D. Peled, A. Pnueli, and L. D. Zuck. From falsification to verification. In FSTTCS, volume 2245 of LNCS, 2001.
26. W. Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. CACM, 35(8), 1992. web page: http://www.cs.umd.edu/projects/omega/omega. html.
27. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. of the 5th International Symposium on Programming, volume 137 of LNCS, 1982.
28. A. Roychoudhury, C.R. Ramakrishnan, and I.V. Ramakrishnan. Justifying proofs using memo tables. In PPDP, 2000.
29. R. Sekar, C. R. Ramakrishnan, I. V. Ramakrishnan, and S. A. Smolka. Model-carrying code (MCC): A new paradigm for mobile-code security. In New Security Paradigms Workshop, 2002.
30. C. Stirling. Modal and temporal logics for processes. In Banff Higher Order Workshop, volume 1043 of LNCS. Springer Verlag, 1995.
31. L. Tan and R. Cleaveland. Evidence-based model checking. In CAV, volume 2404 of LNCS, 2002.
32. P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In POPL, 1986.