A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
About synchronous programming and abstract interpretation
1998
Science of Computer Programming
This paper intends to highlight the connection between synchronous programming and abstract interpretation. First, the specific technique for compiling synchronous programs into interpreted automata can be seen as a partial evaluation. The second point concerns program verification. Most critical properties of reactive systems are safety properties, which can be translated into invariants, through the use of synchronous observers. Invariants can be proved by means of approximate reachability
doi:10.1016/s0167-6423(96)00041-x
fatcat:mnayaylyy5cqjihphchoih3bgy