The symmetry of the past and of the future: Bi-infinite time in the verification of temporal properties

6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC/FSE 2007

Volumn , Issue , 2007, Pages 312-320

  Pradella, Matteo ^a   Morzenti, Angelo ^b   San Pietro, Pierluigi ^b  

^a CNR   (Italy)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

Bi infinite time; Bounded model checking; Satisfiability checking; Temporal logic

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING; SPECIFICATIONS; TEMPORAL LOGIC; FINITE AUTOMATA; MATHEMATICAL OPERATORS; OPTIMAL CONTROL SYSTEMS; SOFTWARE ENGINEERING;

BI-INFINITE TIME; BOUNDED MODEL CHECKING; SATISFIABILITY CHECKING; AS SYSTEMS; AT SYSTEMS; CASE STUDIES; INFINITE TIMES; LINEAR TEMPORAL LOGICS; LOGIC LANGUAGES; MODEL CHECKING TECHNIQUES; PERFORMANCE LOSSES; SATISFIABILITY; SYSTEM INITIALIZATIONS; TEMPORAL LOGIC SPECIFICATIONS; TEMPORAL PROPERTIES;

MODEL CHECKING;

EID: 37849007694     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1287624.1287669     Document Type: Conference Paper

References (40)

1. M. Benedetti and A. Clmattl. Bounded model checking for past LTL. In Proceedings of the Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2003, Warsaw, Poland, April 7-11, 2003., volume 2619 of Lecture Notes in Computer Science, pages 18-33. Springer, 2003.
2. D. Bianculli, A. Morzenti, M. Pradella, P. San Pietro, and P. Spoletini. Trio2Promela: a model checker for temporal metric specifications. In 29th International Conference on Software Engineering (ICSE'07), pages 61-62, Los Alamitos, CA, USA, May 2007. IEEE Computer Society. Research Demo.
3. D. Bianculli, P. Spoletini, A. Morzenti, M. Pradella, and P. San Pietro. Model checking temporal metric specification with Trio2Promela. In Proc. of IPM International Symposium on Fundamentals of Software Engineering (FSEN'07), Lecture Notes in Computer Science. Springer, 2007. To appear.
4. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. Lecture Notes in Computer Science, 1579:193-207, 1999.
5. A. Biere, K. Heljanko, T. Junttila, T. Latvala, and V. Schuppan. Linear encodings of bounded LTL model checking. Logical Methods in Computer Science, 2(5):1-64, 2006.
6. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput., 35(8):677-691, 1986.
7. R. Capohianchi, A. Coen-Porisini, D. Mandrioli, and A. Morzenti. A framework architecture for supervision and control systems. ACM Comput. Serv., 32(les):26, 2000.
8. E. Ciapessoni, P. Mirandola, A. Coen-Porisini, D. Mandrioli, and A. Morzenti. From formal models to formally based methods: An industrial experience. ACM Trans. Softw. Eng. Methodol., 8(1):79-113, 1999.
9. A. Cimatti, E. M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. Nusmv 2: An opensource tool for symbolic model checking. In CAV '02: Proceedings of the 14th Intern. Conf. on Computer Aided Verification, pages 359-364, London, UK, 2002. Springer-Verlag.
10. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst., 8(2):244-263, 1986.
11. E. M. Clarke, O. Grumberg, and D. A. Peled. Model checking. MIT Press, Cambridge, MA, USA, 1999.
12. E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4):626-643, 1996.
13. A. Coen-Porisini, M. Pradella, and P. San Pietro. A finite-domain semantics for testing temporal logic specifications. In Formal Techniques in Real-Time and Fault-Tolerant Systems, 5th Intern. Symposium, FTRTFT'98, Lyngby, Denmark, September 14-18, 1998, Proceedings, pages 41-54, 1998.
14. N. Eén and N. Sörensson. An extensible sat-solver. In E. Giunchiglia and A. Tacchella, editors, SAT, volume 2919 of Lecture Notes in Computer Science, pages 502-518. Springer, 2003.
15. M. Felder and A. Morzenti. Validating real-time systems by history-checking trio specifications. ACM Trans. Softw. Eng. Methodol., 3(4):308-339, 1994.
16. A. Gargantini and A. Morzenti. Automated deductive requirements analysis of critical systems. ACM Trans. Softw. Eng. Methodol., 10(3):255-307, 2001.
17. P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. In G. Berry, H. Comon, and A. Firikel, editors, Proceedings of the 13th Conf. on Computer Aided Verification (CAV'01), number 2102 in Lecture Notes in Computer Science, pages 53-65. Springer Verlag, 2001.
18. P. Gastin and D. Oddoux. LTL with past and two-way very-weak alternating automata. In Proceedings of the 28th Intern. Symposium on Mathematical Foundations of Computer Science (MFCS'03), number 2747 in Lecture Notes in Computer Science, pages 439-448. Springer Verlag, 2003.
19. C. Ghezzi, D. Mandrioli, and A. Morzenti. Trio: A logic language for executable specifications of real-time systems. Journal of Systems and Software, 12(2): 107-123, 1990.
20. F. Gire and M. Nivat. Langages algébriques de mots biinfinis. Theoret. Comput. Sci., 86(2):277-323, 1991.
21. G. J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, 23(5):279-295, May 1997. Special Issue: Formal Methods in Software Practice.
22. G. J. Holzmann. The SPIN model checker: Primer and reference manual. Addison Wesley, 2004. HOL g 03:1 l.Ex.
23. T. Latvala, A. Biere, K. Heljanko, and T. Junttila. Simple is better: Efficient bounded model checking for past LTL. In R. Cousot, editor, Proceedings of the 6th Intern. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI'2005), volume 3385 of Lecture Notes in Computer Science, pages 380-395, Paris, France, January 2005. Springer-Verlag.
24. O. Lichtenstein, A. Pnueli, and L. D. Zuck. The glory of the past. In Proceedings of the Conf. on Logic of Programs, pages 196-218, London, UK, 1985. Springer-Verlag.
25. D. Mandrioli, S. Morasca, and A. Morzenti. Generating test cases for real-time systems from logic specifications. ACM Trans. Comput. Syst., 13(4):365-398, 1995.
26. Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent systems. Springer-Verlag New York, Inc., New York, NY, USA, 1992.
27. K. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993.
28. S. Morasca, A. Morzenti, and P. San Pietro. A case study on applying a tool for automated system analysis based on modular specifications written in TRIO. Autom. Softw. Eng., 7(2):125-155, 2000.
29. A. Morzenti, D. Mandrioli, and C. Ghezzi. A model parametric real-time logic. ACM Trans. Program. Lang. Syst., 14(4):521-573, 1992.
30. A. Morzenti, M. Pradella, P. San Pietro, and P. Spoletini. Model-checking TRIO specifications in SPIN. In K. Araki, S. Gnesi, and D. Mandrioli, editors, FME, volume 2805 of Lecture Notes in Computer Science, pages 542-561. Springer, 2003.
31. A. Morzenti and P. San Pietro. Object-oriented logical specification of time-critical systems. ACM Trans. Softw. Eng. Methodol, 3(1):56-98, 1994.
32. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: engineering an efficient sat solver. In DAC '01: Proceedings of the 38th Conf. on Design automation, pages 530-535, New York, NY, USA, 2001. ACM Press.
33. D. Perrin and J. Éric Pin. Infinite Words, volume 141 of Pure and Applied Mathematics. Elsevier, 2004. ISBN 0-12-532111-2.
34. A. Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS-77), pages 46-57, Providence, Rhode Island, 31-2 1977. IEEE Computer Society Press.
35. M. Pradella, P. San Pietro, P. Spoletini, and A. Morzenti. Practical model checking of LTL with Past. In ATVA03, Taipei, Taiwan, 2003, 2003.
36. P. San Pietro, A. Morzenti, and S. Morasca. Generation of execution sequences for modular time critical systems. IEEE Trans. Software Eng., 26(2):128-149, 2000.
37. M. Sheeran, S. Singh, and G. Stålmarck. Checking safety properties using induction and a SAT-solver. In FMCAD00, volume 1954 of LNCS, pages 108-125. Springer-Verlag, 2000.
38. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 248-263. Springer, 2000.
39. M. Y Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proceedings 1st Annual IEEE Symp. on Logic in Computer Science, LICS'86, Cambridge, MA, USA, 16-18 June 1986, pages 332-344, Washington, DC, 1986. IEEE Computer Society Press.
40. P. Wolper. Temporal logic can be more expressive. In FOCS, pages 340-348. IEEE, 1981.