Static analysis of linear congruence equalities among variables of a program
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
ACM Transactions on Programming Languages and Systems (TOPLAS)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
Crocos: An Integrated Environment for Interactive Verification of SDL Specifications
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Feature interactions: a mixed semantic model approach
IW-FM'97 Proceedings of the 1st Irish conference on Formal Methods
Predicate Diagrams for the Verification of Reactive Systems
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
| Hi-index | 0.00 |
In this paper, we explain how we use abstract interpretation for analysing temporal specifications in TLA+. An analysis is obtained by building a predicate behavior which satisfies the specification. Abstract interpretation allows us to transit from a concrete world to an abstract world (generally finite). Using abstract interpretation, we build abstract predicate behaviors and, in general, if the abstract interpretation is sufficiently powerful and expressive, we can build a finite graph of abstract predicates to analyse a temporal specification. TLA/TLA+ is based on an untyped framework, namely the ZF set theory and we show how abstract interpretation fits the requirements of untyping and makes the analysis of temporal specifications easier.