Infinite state model checking by abstract interpretation and program specialisation

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

Volumn 1817, Issue , 2000, Pages 62-81

  Leuschel, Michael ^a   Massart, Thierry ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING; TEMPORAL LOGIC;

ABSTRACT INTERPRETATIONS; ANALYSIS TECHNIQUES; FINITE MODEL-CHECKING; INFINITE STATE MODEL CHECKING; INFINITE STATE SYSTEMS; LOGIC PROGRAMS; SAFETY PROPERTY; SPECIALISATION;

MODEL CHECKING;

EID: 84949667113     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10720327_5     Document Type: Conference Paper

References (39)

1. K. Apt and E. Olderog. Verification of Sequential and Concurrent Programs. Springer-Verlag, 1991.
2. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems compositionally and automatically. In Proceedings of CAV’98, LNCS, pages 319-331. Springer-Verlag, 1998.
3. B. Bérard and L. Fribourg. Reachability analysis of (timed) Petri nets using real arithmetic. In Proceedings of Concur’99, LNCS 1664, pages 178-193. Springer-Verlag, 1999. Extended version as Research Report LSV-99-3, Lab. Specification and Verification, ENS de Cachan, Cachan, France, Mar. 1999.
4. A. Bossi, M. Gabrielli, G. Levi, and M. Martelli. The s-semantics approach: Theory and applications. The Journal of Logic Programming, 19 & 20:149-198, May 1994.
5. R. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
6. O. Burkart and J. Ezparza. More infinite results. In Proceedings of Infinity’96, 1996. Research Report MIP-9614, University of Passau.
7. W. Charatonik and A. Podelski. Set-based analysis of reactive infinite-state systems. In B. Steén, editor, Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1384, pages 358-375. Springer-Verlag, March 1998.
8. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
9. E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4):626-643, Dec. 1996.
10. D. De Schreye, R. Glück, J. Jørgensen, M. Leuschel, B. Martens, and M. H. Sørensen. Conjunctive partial deduction: Foundations, control, algorithms and experiments. The Journal of Logic Programming, 41(2 & 3):231-277, 1999.
11. E.M. Clarke and E.A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In D. Kozen, editor, Proceedings of the Workshop on Logics of Programs, LNCS 131, pages 52-71, Yorktown Heights, New York, May 1981. Springer-Verlag.
12. J. Ezparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85-107, 1997.
13. J. Gallagher and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9(3 & 4):305-333, 1991.
14. R. Glück and M. Leuschel. Abstraction-based partial deduction for solving inverse problems - a transformational approach to software verification. In Proceedings of PSI’99, LNCS 1755, pages 93-100, Novosibirsk, Russia, 1999. Springer-Verlag.
15. P. Hartel, M. Butler, A. Currie, P. Henderson, M. Leuschel, A. Martin, A. Smith, U. Ultes-Nitsche, and B. Walters. Questions and Answers About Ten Formal Methods. Proceedings of FMICS’99, Trento, Italy, 1999.
16. J. Hatcliff, M. Dwyer, and S. Laubach. Staging analysis using abstraction-based program specialization. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Proceedings of ALP/PLILP’98, LNCS 1490, pages 134-151. Springer-Verlag, 1998.
17. T. A. Henzinger and P.-H. Ho. HYTECH: The Cornell HYbrid TECHnology tool. LNCS, 999:265-293, 1995.
18. G. Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 2:326-336, 1952.
19. J. Jørgensen and M. Leuschel. Efficiently generating efficient generating extensions in Prolog. In O. Danvy, R. Glück, and P. Thiemann, editors, Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110, pages 238-262, Schloß Dagstuhl, 1996. Springer-Verlag.
20. J. B. Kruskal. Well-quasi ordering, the tree theorem, and Vazsonyi’s conjecture. Transactions of the American Mathematical Society, 95:210-225, 1960.
21. J.-L. Lassez, M. Maher, and K. Marriott. Unification revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587-625. Morgan-Kaufmann, 1988.
22. M. Leuschel. Improving homeomorphic embedding for online termination. In P. Flener, editor, Proceedings of LOPSTR’98, LNCS 1559, pages 199-218, Manchester, UK, June 1998. Springer-Verlag.
23. M. Leuschel. On the power of homeomorphic embedding for online termination. In G. Levi, editor, Static Analysis. Proceedings of SAS’98, LNCS 1503, pages 230-245, Pisa, Italy, September 1998. Springer-Verlag.
24. M. Leuschel. Program specialisation and abstract interpretation reconciled. In J. Jaffar, editor, Proceedings of JICSLP’98, pages 220-234, Manchester, UK, June 1998. MIT Press.
25. M. Leuschel and D. De Schreye. Logic program specialisation: How to be more specific. In H. Kuchen and S. Swierstra, editors, Proceedings of PLILP’96, LNCS 1140, pages 137-151, Aachen, Germany, September 1996. Springer-Verlag.
26. M. Leuschel and J. Jørgensen. Efficient specialisation in Prolog using a handwritten compiler generator. Technical Report DSSE-TR-99-6, Department of Electronics and Computer Science, University of Southampton, September 1999.
27. M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems, 20(1):208-258, January 1998.
28. X. Liu, C. R. Ramakrishnan, and S. A. Smolka. Fully local and efficient evaluation of alternating fixed points. In B. Steén, editor, Proceedings of TACAS’98, LNCS 1384, pages 5-19. Springer-Verlag, 1998.
29. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. The Journal of Logic Programming, 11(3& 4):217-242, 1991.
30. K. Marriott, L. Naish, and J.-L. Lassez. Most specific logic programs. Annals of Mathematics and Artificial Intelligence, 1:303-338, 1990.
31. K. L. McMillan. Symbolic Model Checking. PhD thesis, Boston, 1993.
32. F. Moller. Infinite results. In Proceedings of CONCUR’96, LNCS 1119, pages 195-216. Springer-Verlag, 1996.
33. U. Nitsche and P. Wolper. Relative liveness and behavior abstraction. In Proceedings of PODC’97, pages 45-52, Santa Barbara, California, 1997. ACM.
34. T. C. Przymusinksi. On the declarative and procedural semantics of logic programs. Journal of Automated Reasoning, 5(2):167-205, 1989.
35. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warrend. Efficient model checking using tabled resolution. In Proceedings of CAV’97, LNCS. Springer-Verlag, 1997.
36. J. Rushby. Mechanized formal methods: Where next? In Proceedings of FM’99, LNCS 1708, pages 48-51, Toulouse, France, Sept. 1999. Springer-Verlag.
37. K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 442-453, Minneapolis, Minnesota, May 1994. ACM.
38. M. H. Sørensen and R. Glück. An algorithm of generalization in positive supercompilation. In J. W. Lloyd, editor, Proceedings of ILPS’95, pages 465-479, Portland, USA, December 1995. MIT Press.
39. P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. Proceedings of CAV’98, LNCS 1427, pages 88-97. Springer-Verlag, 1998.