Semantics for abstract interpretation-Based static analyzes of temporal properties

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

Volumn 2477, Issue , 2002, Pages 428-443

  Masse, Damien ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MODEL CHECKING; SEMANTICS;

ABSTRACT INTERPRETATIONS; FORWARD-AND-BACKWARD; REACHABILITY; TEMPORAL PROPERTY; TRANSITION SYSTEM;

STATIC ANALYSIS;

EID: 84958765102     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45789-5_30     Document Type: Conference Paper

References (13)

1. E.M. Clarke, O. Cramberg, and D.A. Peled. Model Checking. MIT press, 1999.
2. P. Cousot. Méthodes iteratives de construction et d’approximation de point fixes d’operateurs monotones sur un treillis, analyse sémantique des programmes.Thèse es sciences mathematiques, University of Grenoble, March 1978.
3. P. Cousot. Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Theoretical Computer Science, 277(1-2):47-103, 2002.
4. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proceedings of the Second International Symposium on Programming, pages 106130. Dunod, Paris, France, 1976.
5. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, California, 1977. ACM Press, New York, NY.
6. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511-547, August 1992.
7. P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Conference Record ofthe Ninthteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 83-94, Albuquerque, New Mexico, January 1992. ACM Press, New York, NY.
8. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 84-97, Tucson, Arizona, 1978. ACM Press, New York, NY.
9. Panagiotis Manolios and Richard J. Trefler. Safety and liveness in branching time. In Logic in Computer Science, pages 366, 2001.
10. D. Masse. Combining backward and forward analyses of temporal properties. In O. Danvy and A. Filinski, editors, Proceedings of the Second Symposium PADO’2001, Programs as Data Objects, volume 2053 of Lecture Notes in Computer Sciences, pages 155-172, Arhus, Denmark, 21-23 May 2001. Springer-Verlag, Berlin, Germany.
11. Laurent Mauborgne. Representation of Sets of Trees for Abstract Interpretation. PhD thesis, Ecole Polytechnique, 1999.
12. Laurent Mauborgne. An incremental unique representation for regular trees. Nordic Journal of Computing, 7(4):290-311, 2000.
13. A. Mine. The octagon abstract domain. In AST 2001 in WCRE 2001, IEEE, pages 310-319. IEEE CS Press, October 2001. http://www.di.ens.fr/~iJmine/publi/article-mine-padoII.pdf.