Static analysis of time bounded reactive properties of Boolean symbols

Authors:
Guillaume Capron
Affiliations:
École Polytechnique, Palaiseau cedex, France
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 6
Cited 0

Introduction to algorithms

Introduction to algorithms
The C programming language

The C programming language
The ESTEREL synchronous programming language: design, semantics, implementation

Science of Computer Programming
Abstract interpretation of reactive systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for checking if macro-definitions written in C respect their specification. We are interested in simple time-bounded reactive properties. We use the abstract interpretation framework and a compact representation of sets of traces to provide a formalization of the specification, the semantics and the algorithms allowing us to build a representation of the set of traces.