On closure under stuttering

Formal Aspects of Computing

Volumn 14, Issue 4, 2003, Pages 342-368

  Pǎun, Dimitrie O ^a   Chechik, Marsha ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Closure under stuttering; Event based systems; LTL; Model checking

Indexed keywords

FORMAL LANGUAGES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SYNTACTICS;

CLOSURE UNDER STUTTERING; EVENT-BASED SYSTEMS; LTL; MODEL-CHECKING;

FORMAL LOGIC;

EID: 23944476112     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00165-002-225-1     Document Type: Article

References (34)

1. [AbL91] Abadi, M. and Lamport, L.: The existence of refinement mappings. Theoretical Computer Science, 82(2): 253-284, 1991.
2. [BeH81] Bernstein, A. and Harter, P. K.: Proving real time properties of programs with temporal logic. In Proceedings of The Eighth Symposium on Operating Systems Principles, pages 1-11. ACM, 1981.
3. [BiP98] Biechele, B. and Pǎun, D. O.: A case study production cell with PROMELA/SPIN. In M. Chechik, editor, Automated Verification: A Collection of Reports. University of Toronto, Technical Report CSRG-374, April 1998.
4. [BKP86] Barringer, H., Kuiper, R. and Pnueli, A.: A really abstract concurrent model and its temporal logic. In Proceedings of the 13th ACM Symposium on Principles of Programming Languages, pages 173-183, 1986.
5. [CES86] Clarke, E. M., Emerson, E. A. and Sistla, A. P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2): 244-263, 1986.
6. [CGM99] Clarke, E. M., Grumberg, O., Minea, M., and Peled, D.: State space reduction using partial order techniques. International Journal on Software Tools for Technology Transfer, 2(3): 279-287, 1999.
7. [CPS93] Cleaveland, R., Parrow, J. and Steffen, B.: The concurrency workbench: a semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1): 36-72, 1993.
8. [DAC98] Dwyer, M. B., Avrunin, G. S. and Corbett, J. C.: Property specification patterns for finite-state verification. In Proceedings of Second Workshop on Formal Methods in Software Practice, Clearwater Beach, Florida, ACM Press, March 1998.
9. [DAC99] Dwyer, M. B., Avrunin, G. S. and Corbett, J. C.: Patterns in property specifications for finite-state verification. In Proceedings of 21st International Conference on Software Engineering, Los Angeles, CA, IEEE Computer Society Press, May 1999.
10. [Ete99] Etessami, K.: Stutter-invariant languages, ω-automata, and temporal logic. In Proceedings of the 11th International Conference on Computer-Aided Verification (CAV'99), Vol. 1633 of LNCS, pages 236-249, Springer-Verlag Taranto, Italy, 1999.
11. [Ete00] Etessami, K.: A note of a question of Peled and Wilke regarding stutter-invariant LTL. Information Processing Letters, 75(6): 261-263, 2000.
12. [HaO83] Hailpern, B. T. and Owicki, S. S.; Modular verification of computer communication protocols. IEEE Transactions on Communication 1(COM-31): 56-68, 1983.
13. [Heh93] Hehner, E. C. R.: A Practical Theory of Programming. Texts and Monographs in Computer Science. Springer, New York, 1993.
14. [Hen80] Heninger, K.: Specifying software requirements for complex systems: new techniques and their applications. IEEE Transactions on Software Engineering, SE-6(1): 2-12, 1980.
15. [HHR96] Hardih, R. H., Har'El, Z. and Kurshan, R. P.: COSPAN. In Proceedings of the 8th International Conference on Computer-Aided Verification (CAV'96), Vol. 1102 of LNCS, Springer-Verlag, Rutgers, New Jersey, July 1996.
16. [HJL96] Heitmeyer, C. L., Jeffords, R. D. and Labaw, B. G.: Automated consistency checking of requirements specifications. ACM Transactions on Software Engineering and Methodology, 5(3): 231-261, 1996.
17. [HKL98] Heitmeyer, C. L., Kirby, J., Labaw, B., Archer, M. and Bharadwaj, R.: Using abstraction and model checking to detect safety violations in requirements specifications. IEEE Transactions on Software Engineering, 24(11), 1998.
18. [HOK96] Holzmann, G. J. and Kupferman, O.: Not checking for closure under stuttering. In Proceedings of the Second International SPIN Workshop (SPIN'2), pages 17-22, Rutgers University, USA, 1996.
19. [Hol97] Holzmann, G. J.: The model checker SPIN. IEEE Transactions on Software Engineering, 23(5): 279-295, 1997.
20. [Hol99] Holzmann, G.: A practical method for verifying event-driven software. In Proceedings of the 21st International Conference on Software Engineering (ICSE'99), pages 597-607, Los Angeles, CA, IEEE Computer Society Press, May 1999.
21. [Lam83] Lamport, L.: Specifying concurrent program modules. ACM Transactions of Programming Languages and Systems, 5: 190-222, 1983.
22. [Lam94] Lamport, L.: The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16: 872-923, 1994.
23. [Leu95] Leue, S.: Specifying real-time requirements for SDL specifications: a temporal logic-based approach. In Proceedings of the 15th International Symposium on Protocol Specification, Testing, and Verification (PSTV'95), San Diego, CA, 1995.
24. [MaP89] Manna, Z. and Pnueli, A.: The anchored version of the temporal framework. In W. P. de Roever, J. W. de Bakker and G. Rozenburg, editors, Models of Concurrency: Linear, Branching and Partial Orders. Springer, Berlin, pages 201-284, 1989.
25. [MaP92] Manna, Z. and Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems. Springer, Berlin, 1992.
26. [McM93] McMillan, K. L.: Symbolic Model Checking. Kluwer Academic, Dordrecht, 1993.
27. [MoM94] Mokkedem, A. and Méry, D.: A stuttering closed temporal logic for modular reasoning about concurrent programs. In Temporal Logic: First International Conference (ICTL '94), No. 827 in Lecture Notes in Artificial Intelligence. Springer, Berlin, July 1994.
28. [O1O90] Olender, K. M. and Osterweil, L. J.: Cecil: a sequencing constraint language for automatic static analysis generation. IEEE Transactions on Software Engineering, 16(3): 268-280, 1990.
29. [Ost90] Ostroff, J. S.: Temporal Logic of Real-Time Systems. Advanced Software Development Series. Research Studies Press (Wiley), New York, 1990.
30. [Pau99] Pǎun, D. O.; Closure under stuttering in temporal formulas. Master's thesis, Department of Computer Science, University of Toronto, Ontario, April 1999.
31. [PeW97] Peled, D. and Wilke, T.: Stutter-invariant temporal properties are expressible without the next-time operator. Information Processing Letters, 63: 243-246, 1997.
32. [Pnu86] Pnueli, A.: Specification and development of reactive systems. In H. J. Kugler, editor, Information Processing 86, pages 845-858. IFIP, North-Holland, Amsterdam, 1986.
33. [Pnu92] Pnueli, A.: System specification and refinement in temporal logic. In R. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science: 12th Conference. No. 652 in Lecture Notes in Computer Science. Springer, Berlin, December 1992.
34. [PWW98] Peled, D., Wilke, T. and Wolper, P.: An algorithmic approach for checking closure properties of temporal logic specifications and ω-regular languages. Theoretical Computer Science, 195(2): 183-203, 1998.