Abstraction as the key for invariant verification

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free