Referential opacity in nondeterministic data refinement

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Referential opacity in nondeterministic data refinement

Full text

Pdf (546 KB)

Source

ACM Letters on Programming Languages and Systems (LOPLAS) archive
Volume 2 , Issue 1-4 (March–Dec. 1993) table of contents

Pages: 233 - 241

Year of Publication: 1993

ISSN:1057-4514

Authors

Xiaolei Qian	SRI International, Menlo Park, CA
Allen Goldberg	Kestrel Institute, Palo Alto, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 28, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/176454.176578 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Michel Bidoit , Hans-Jörg Kreowski , Pierre Lescanne , Fernando Orejas , Donald Sannella, Algebraic system specification and development, Springer-Verlag New York, Inc., New York, NY, 1991
	2	BIRD, R., MEETENS, L., AND WILE, D. 1987. A common basis for algorithmic specification and development. Tech. Rep. CS-N8702, Center for Mathematics and Computer Science, Amsterdam, 89-100.
	3	BLAINE, L., AND GOLDBERG, A. 1991. DTRE--A semi-automatic transformation system. In Constructing Programs from Specifications, B. MSller, Ed. North-Holland, Amsterdam, 165-204.
	4	M Broy , B Möller , M Wirsing, Algebraic implementations preserve program correctness, Science of Computer Programming, v.7 n.1, p.35-53, July 1986
	5	GOGUEN, J. A., THATCHER, J. W., AND WAGNER, E.G. 1987. An initial algebra approach to the specification, correctness and implementation of abstract data types. In Current Trends in Programming Methodology, Vol. 4: Data Structuring, R. T. Yeh, Ed. Prentice-Hail, Englewood Cliffs, N.J., 80-149.
	6	GUTTAG, J. V., AND HORNING, J.J. 1978. The algebraic specification of abstract data types. Acta Inf. 10, 27-52.
	7	Wim H. Hesselink, A mathematical approach to nondeterminism in data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.1, p.87-117, Jan. 1988 [doi>10.1145/42192.42194]
	8	José Meseguer, Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science, v.96 n.1, p.73-155, 6 April 1992
	9	Tobias Nipkow, Non-deterministic data types: models and implementations, Acta Informatica, v.22 n.6, p.629-661, March 1986 [doi>10.1007/BF00263649]
	10	D. Sannella , A. Tarlecki, Toward formal development of programs from algebraic specifications: implementations revisited, Acta Informatica, v.25 n.3, p.233-281, April 1988
	11	Harald Sondergaard , Peter Sestoft, Referential transparency, definiteness and unfoldability, Acta Informatica, v.27 n.6, p.505-517, 1990
	12	Wladyslaw M. Turski , Thomas S. E. Maibaum, Specification of computer programs, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1987

CITED BY 3

	Michał Walicki , Sigurd Meldal, Algebraic approaches to nondeterminism—an overview, ACM Computing Surveys (CSUR), v.29 n.1, p.30-81, March 1997
	Michal Walicki , Sigurd Meldal, A complete calculus for the multialgebraic and functional semantics of nondeterminism, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.2, p.366-393, March 1995
	Michal Walicki , Manfred Broy, Structured specifications and implementation of nondeterministic data types, Nordic Journal of Computing, v.2 n.3, p.358-395, Fall 1995