In this paper we present a technique to compute abstract models for formal system verification. The method reduces the state space by eliminating those parts of a system model which are not required to check a property. The abstract model depends on the property, which is a formula of the next-less fragment of CTL∗. The algorithm reads a system description, annotates it with abstract sub-models for the statements, which are finally composed as abstract model for the system. In the paper we introduce the core algorithm and illustrate it by an example.
CITATION STYLE
Firley, T., & Goltz, U. (2002). Property dependent abstraction of control structure for software verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2391, pp. 511–530). Springer Verlag. https://doi.org/10.1007/3-540-45614-7_29
Mendeley helps you to discover research relevant for your work.