
- 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 Scholar
- 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 Scholar
- 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 Scholar
- BROY, M., MOLLER, B., AND PEPPER, P. 1986. Algebraic implementations preserve program correctness. Sci. Comput. Program. 7, 35-53. Google Scholar
- 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 Scholar
- GUTTAG, J. V., AND HORNING, J.J. 1978. The algebraic specification of abstract data types. Acta Inf. 10, 27-52.Google Scholar
- HESSELINK, W. 1988. A mathematical approach to nondeterminism in data types. ACM Trans. Program. Lang. Syst. 10, 1 (Jan.), 87-117. Google Scholar
- MESEGUER, J. 1992. Conditional rewriting logic as a unified model of concurrency. Theor. Comput, Sci. 96, 1 (April), 73-155. Google Scholar
- NIPKOW, T. 1986. Non-deterministic data types: models and implementations. Acta Inf. 22, 629-661. Google Scholar
- SANNELLA, D., AND TARLECKI, A. 1988. Toward formal development of programs from algebraic specifications:implementations revisited. Acta Inf. 25, 3, 233-281. Google Scholar
- S~NDERGAARD, H., AND SESTOFT, P. 1990. Referential transparency, definiteness and unfoldability. Acta Inf. 27, 6 (May), 505-517. Google Scholar
- TURSKI, W., AND MAIBAUM, T. 1987. The Specification of Computer Programs. Addison-Wesley, Reading, Mass. Google Scholar
Index Terms
Referential opacity in nondeterministic data refinement
Recommendations
Opacity light fields: interactive rendering of surface light fields with view-dependent opacity
I3D '03: Proceedings of the 2003 symposium on Interactive 3D graphicsWe present new hardware-accelerated techniques for rendering surface light fields with opacity hulls that allow for interactive visualization of objects that have complex reflectance properties and elaborate geometrical details. The opacity hull is a ...
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness
OPODIS '08: Proceedings of the 12th International Conference on Principles of Distributed SystemsThe aim of a software transactional memory (STM) system is to facilitate the delicate problem of low-level concurrency management, i.e. the design of programs made up of processes/threads that concurrently access shared objects. To that end, a STM ...
Fourier opacity mapping
I3D '10: Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and GamesWhilst the Deep Shadow Maps algorithm for accelerating the rendering of volumetric shadows is a fitting solution for offline applications, it can consume an unbounded amount of memory and is difficult to map well to current graphics hardware. For these ...






Comments