skip to main content
article
Free Access

Referential opacity in nondeterministic data refinement

Published:01 March 1993Publication History
First page image

References

  1. BIDOIT, M., KREOWSKI, H.-J., LESCANNE, P., OREJAS, F., AND SANNELLA, D. 1991. Algebraic system specification and development. In Lecture Notes in Computer Science. Vol. 501. Springer-Verlag, New York. Google ScholarGoogle Scholar
  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.Google ScholarGoogle Scholar
  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.Google ScholarGoogle Scholar
  4. BROY, M., MOLLER, B., AND PEPPER, P. 1986. Algebraic implementations preserve program correctness. Sci. Comput. Program. 7, 35-53. Google ScholarGoogle Scholar
  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.Google ScholarGoogle Scholar
  6. GUTTAG, J. V., AND HORNING, J.J. 1978. The algebraic specification of abstract data types. Acta Inf. 10, 27-52.Google ScholarGoogle Scholar
  7. HESSELINK, W. 1988. A mathematical approach to nondeterminism in data types. ACM Trans. Program. Lang. Syst. 10, 1 (Jan.), 87-117. Google ScholarGoogle Scholar
  8. MESEGUER, J. 1992. Conditional rewriting logic as a unified model of concurrency. Theor. Comput, Sci. 96, 1 (April), 73-155. Google ScholarGoogle Scholar
  9. NIPKOW, T. 1986. Non-deterministic data types: models and implementations. Acta Inf. 22, 629-661. Google ScholarGoogle Scholar
  10. SANNELLA, D., AND TARLECKI, A. 1988. Toward formal development of programs from algebraic specifications:implementations revisited. Acta Inf. 25, 3, 233-281. Google ScholarGoogle Scholar
  11. S~NDERGAARD, H., AND SESTOFT, P. 1990. Referential transparency, definiteness and unfoldability. Acta Inf. 27, 6 (May), 505-517. Google ScholarGoogle Scholar
  12. TURSKI, W., AND MAIBAUM, T. 1987. The Specification of Computer Programs. Addison-Wesley, Reading, Mass. Google ScholarGoogle Scholar

Index Terms

  1. Referential opacity in nondeterministic data refinement

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image ACM Letters on Programming Languages and Systems
              ACM Letters on Programming Languages and Systems  Volume 2, Issue 1-4
              March–Dec. 1993
              241 pages
              ISSN:1057-4514
              EISSN:1557-7384
              DOI:10.1145/176454
              Issue’s Table of Contents

              Copyright © 1993 ACM

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 March 1993
              Published in loplas Volume 2, Issue 1-4

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!