Temporal abstract interpretation
- 5 January 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
We study the abstract interpretation of temporal calculi and logics in a general syntax, semantics and abstraction independent setting. This is applied to the @@@@-calculus, a generalization of the μ-calculus with new reversal and abstraction modalities as well as a new time-symmetric trace-based semantics. The more classical set-based semantics is shown to be an abstract interpretation of the trace-based semantics which leads to the understanding of model-checking and its application to data-flow analysis as incomplete temporal abstract interpretations. Soundness and incompleteness of the abstractions are discussed. The sources of incompleteness, even for finite systems, are pointed out, which leads to the identification of relatively complete sublogics, à la CTL.Keywords
This publication has 15 references indexed in Scilit:
- Binary Decision GraphsPublished by Springer Nature ,1999
- An improved algorithm for the evaluation of fixpoint expressionsTheoretical Computer Science, 1997
- Generating data flow analysis algorithms from modal specificationsScience of Computer Programming, 1993
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- The temporal logic of branching timeActa Informatica, 1983
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Systematic design of program analysis frameworksPublished by Association for Computing Machinery (ACM) ,1979
- Automatic discovery of linear restraints among variables of a programPublished by Association for Computing Machinery (ACM) ,1978
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977