Action language verifier

Proceedings - 16th Annual International Conference on Automated Software Engineering, ASE 2001

Volumn , Issue , 2001, Pages 382-386

  Bultan, Tevfik ^a   Yavuz Kahveci, Tuba ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MANIPULATORS; MODEL CHECKING; SPECIFICATIONS;

ACTION LANGUAGE; ACTION LANGUAGE VERIFIERS; INFINITE-STATE; LANGUAGE SPECIFICATION; PRESBURGER ARITHMETIC; PROPERTY; REACTIVE SOFTWARE; SOFTWARE-SYSTEMS; SYMBOLIC MODEL CHECKERS; SYMBOLIC REPRESENTATION;

SPECIFICATION LANGUAGES;

EID: 0013091299     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2001.989834     Document Type: Conference Paper

References (12)

1. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proc. of the 6th International Conference on Computer Aided Verification, volume 818 of LNCS, pages 55-67. Springer-Verlag, June 1994.
2. T. Bultan. Action language: A specification language for model checking reactive systems. In Proc. of the 22nd International Conference on Software Engineering, pages 335-344, June 2000.
3. T. Bultan, R. Gerber, and C. League. Composite model checking: Verification with type-specific symbolic representations. ACM Transactions on Software Engineering and Methodology, 9(1):3-50, January 2000.
4. T. Bultan, R. Gerber, and W. Pugh. Model-checking concurrent systems with unbounded integer variables: Symbolic representations, approximations, and experimental results. ACM Transactions on Programming Languages and Systems, 21(4):747-789, July 1999.
5. E. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
6. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. of the 4th Annual ACM Symposium on Principles of Programming Languages, pages 238-252, 1977.
7. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proc. of the 5th Annual ACM Symposium on Principles of Programming, pages 84-97, 1978.
8. N. Halbwachs, P. Raymond, and Y. Proy. Verification of linear hybrid systems by means of convex approximations. In B. LeCharlier, editor, Proc. ofInternational Symposium on Static Analysis, volume 864 of LNCS. Springer-Verlag, September 1994.
9. D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8(3):231-274, June 1987.
10. C. L. Heitmeyer, R. D. Jeffords, and B. G. Labaw. Automated consistency checking of requirements specifications. ACM Transactions on Software Engineering and Methodology, 5(3):231-261, July 1996.
11. T. A. Henzinger and P. Ho. A note on abstract-interpretation strategies for hybrid automata. In P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, editors, Hybrid Systems II, volume 999 of LNCS, pages 252-264. Springer-Verlag, 1995.
12. T. Yavuz-Kahveci, M. Tuncer, and T. Bultan. Composite symbolic library. In Proc. of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 335-344. Springer-Verlag, April 2001.