| P. Cousot and R. Cousot. Refining model checking by abstract interpretation. Automated Software Engineering, 6(1):69--95, 1999. |
....Uribe [30] present an algorithm that uses de cision procedures to generate finite state abstractions of possibly infinite state systems. Our work is different from theirs; the denoration of the covering transformer monoid Y = i.e. q) may be infinite; moreover may itself be infinite. In [31], Cousot and Cousot describe im provements to abstract model checking by combining forwards and backwards abstract fixpoint computations. It would be interesting to see how their techniques can be adapted to a constraint based setting as ours. Cleaveland, Iyer and Yankelevich [32] develop a ....
P. Cousot and R. Cousot, "Refining model checking by abstract interpretation," Automated Software Engineering, vol. 6, pp. 69-95, 1998.
....a finite abstraction of a program safely approximates its infinitely many computational courses. Furthermore, abstract interpretation has been adapted to to cope with concurrent systems [10, 13] which do not necessarily terminate and has become increasingly popular as an approach to model checking [12, 35], both for large finite and for infinite state systems. Some other approaches are, e.g. behaviour abstraction [31] partial order methods [36] data independence [34] symbolic model checking [4, 20] and symbolic transition graphs [29] 1 One could argue that the actual implementation on a ....
P. Cousot and R. Cousot. Refining model checking by abstract interpretation. Automated Software Engineering, 6:69--95, 1999.
....developed in the context of process algebra and automata theory, like bisimulation and its quantitative extensions, can be useful for formally dealing with such abstractions. Additionally, proper techniques, like abstract interpretation may be of great help [Bruns 1993; Clarke et al. 1994; Cousot and Cousot 1999; Dams et al. 1997] The problem of relating different views of the same system has been addressed also in the work done about the formalization of consistency between different viewpoints of the Open Distributed Processing computational model [Bowman et al. 1996] ....
P. Cousot and R. Cousot, "Refining Model Checking by Abstract Interpretation," Automated Software Engineering, vol. 6, pp.1-28, 1999. Kluwer Academic Publishers
....in rule (3) this erasure can take place only on one side of the parallel composition operator or, in the case of multimodule systems, for all modules but one. While automatic approaches to the construction of abstractions for model checking have been proposed, for example, in [Kur94, Dam96, GS97, CC99] these approaches do not exploit reachability and controllability information in a modular fashion. In particular, instead of the standard principle first abstract, then model check the abstraction, our approach follows the more refined principle first model check the components, then use ....
P. Cousot and R. Cousot. Refining model checking by abstract interpretation Automated Software Engineering Journal, 6(1):69--95, 1999.
No context found.
Cousot, P., Cousot, R.: Refining model checking by abstract interpretation. Aut . Soft . Eng. 6 (1999) 69--95
No context found.
P. Cousot and R. Cousot. Refining model checking by abstract interpretation. Automated Software Engineering, 6(1):69--95, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC