Abstract
Purchase PDF (124 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (227 K)
Gries, Morris
doi:10.1016/S0020-0190(00)00213-1 
Copyright © 2001 Elsevier Science B.V. All rights reserved.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
William Leal
, 1 and Anish Arora
,
Available online 5 March 2001.
Abstract
Simulations are a popular way to show data refinement. Simulations that have been proposed are either state-level, relating concrete to abstract states in a given state space, or value-level, relating individual concrete to abstract values and hence holding for all state spaces. Value-level simulations are less complex and easier to use, but the extent of their completeness has not been well studied. We show that in fact known value-level simulations are in general incomplete but are complete when operations are limited to a single argument.
Author Keywords: Data refinement; Program correctness; Formal verification; Components
This work was partially sponsored by NSA Grant MDA904-96-1-0111, NSF Grant NSF-CCR-9972368, an Ameritech Faculty Fellowship, and a grant from Microsoft Research.
1 Sponsored in part by a fellowship from the General Electric Fund's Faculty for the Future Program and by a Multiple-Year Dean's Fellowship provided by The Ohio State University's Graduate School.
Corresponding author. Arora is currently on sabbatical leave at Microsoft Research; email: anish@cis.ohio-state.edu
