Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties

Authors:
Damien Massé
Affiliations:
-
Venue:
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Year:
2002

Citing 9
Cited 2

Inductive definitions, semantics and abstract interpretations

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking

Model checking
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation

Theoretical Computer Science
Combining Forward and Backward Analyses of Temporal Properties

PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
An incremental unique representation for regular trees

Nordic Journal of Computing
The Octagon Abstract Domain

WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
Safety and Liveness in Branching Time

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science

Property Checking Driven Abstract Interpretation-Based Static Analysis

VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Strong preservation of temporal fixpoint-based operators by abstract interpretation

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Analyzing programs with abstract interpretation often requires to use a combination of forward and backward analyzes. However, the forward analyzes are mostly reachability analyzes, which are often not precise enough when we want to check other temporal properties. In this paper we propose to combine transition systems with temporal properties (with backward modalities) to get "extended" transition systems. We define forward and backward semantics for these systems, and give indications for their combination. These semantics, which use set of trees, can be abstracted to make more precise forward and backward analyzes of programs. The combinations of these analyzes are expected to give better results than the current abstract analyzes.