| McIsaac, Anthony. 1993 (Aug). A Formalization of Abstraction in LAMBDA. Pages 229--240 of: Proceedings of the 1993 HOL Users' Group Workshop. |
....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 performing the simpler mapping. There ....
....paper there is no clear advantage in performing domain mapping over performing the simpler mapping. There are a number of open issues in how this form of abstraction can be specified, used, and automated. In general, we believe that besides performance benefits discussed elsewhere (Long, 1993; McIsaac, 1993), this may lead to more secure systems since the proofs will be done in domains closer to users intuitive understanding of systems. 6 Practical Tool The theory described in the preceding two sections has been implemented, and integrated with Voss into a new system. This tool is a theorem prover ....
McIsaac, Anthony. 1993 (Aug). A Formalization of Abstraction in LAMBDA. Pages 229--240 of: Proceedings of the 1993 HOL Users' Group Workshop.
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