M. Donat. Verification Using Abstract Domains. Unpublished paper, Department of Computer Science, University of British Columbia, April 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Model Checking Partially Ordered State Spaces - Hazelhurst, Seger (1995) (Correct)
....The system MA is an abstraction of the system M . Typically, the behaviour of an abstraction is not equivalent to the underlying model. The abstractions are conservative in that MA satisfies f A implies that M satisfies f (but not necessarily the converse) Some examples of abstraction methods are [15, 19, 23, 24, 28]. In hardware verification, abstraction is particularly needed in dealing with the data path of circuits. A drawback of abstraction is that it takes effort to both come up with the suitable abstraction (which is difficult to do automatically, but see [14, 33] and prove that the abstraction is ....
M. Donat. Verification Using Abstract Domains. Unpublished paper, Department of Computer Science, University of British Columbia, April 1993.
A Simple Theorem Prover Based on Symbolic Trajectory.. - Hazelhurst, Seger (1993) (8 citations) (Correct)
....between domains. Specification is done in one domain, and verification in another. Abstraction occurs when details present in the one domain are not present in the other. Abstraction is an important tool in making verification more efficient, and there have been a number of proposals for doing so (Donat, 1993; Long, 1993; McIsaac, 1993) There is an important distinction: we are proposing abstraction as a way to make verification pleasanter for the verifier, rather than more efficient. In terms of the work we present in this paper there is no clear advantage in performing domain mapping over ....
Donat, Michael. 1993 (Apr.). Verification Using Abstract Domains. Unpublished paper, Department of Computer Science, University of British Columbia.
Compositional Model Checking Of Partially Ordered State Spaces - Hazelhurst (1996) (10 citations) (Correct)
....is used in model comparison (e.g. as in [74] Typically, the behaviour of an abstraction is not equivalent to the underlying model. The abstractions are conservative in that MA satisfies fA implies that M satisfies f (but not necessarily the converse) Some examples of abstraction methods are [50, 70, 83, 95]. In hardware verification, abstraction is particularly needed in dealing with the data path of circuits. A drawback of abstraction is that it takes effort to both come up with the suitable abstraction (see [37, 123] and prove that the abstraction is conservative. For an example of this type of ....
M. Donat. Verification Using Abstract Domains. Unpublished paper, Department of Computer Science, University of British Columbia, April 1993.
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