We present a methodology for constructing abstractions and refining them by analyzing counter-examples. We also present a uniform verification method that combines abstraction, model-checking and deductive verification. In particular, it shows how to use the abstract system in a deductive proof even when the abstract model does not satisfy the specification and when it simulates the concrete system with respect to a weaker notion of simulation than Milner's. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Bensalem, S., Graf, S., & Lakhnech, Y. (2004). Abstraction as the key for invariant verification. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2772, 67–99. https://doi.org/10.1007/978-3-540-39910-0_4
Mendeley helps you to discover research relevant for your work.