interpretation-based static analysis infers properties from the source code of a program. When the goal is to check a temporal specification on the program, we need the analysis to be as precise as possible to avoid false negatives. In previous work [9], we suggested a method called "property checking driven analysis" to automatically use the specification to check during the analysis hi order to refine it. However, this approach requires to abstract domains of lower closure operators, something which was not developed. In this paper, we describe some abstractions on lower closure operators developed for a small analyzer of temporal properties. We examine the need for weak relational abstractions, and show that using our new approach can give more precise results than using a traditional abstract interpretation-based analysis with expensive abstract domains. © Springer-Verlag 2004.
CITATION STYLE
Massé, D. (2004). Abstract domains for property checking driven analysis of temporal properties. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3116, 349–363. https://doi.org/10.1007/978-3-540-27815-3_28
Mendeley helps you to discover research relevant for your work.