A computation model for Z based on concurrent constraint resolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1878, Issue , 2000, Pages 414-432

  Grieskamp, Wolfgang ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; FORMAL SPECIFICATION; LOGIC PROGRAMMING;

COMPUTATION MODEL; CONCURRENT CONSTRAINT; FUNCTIONAL LOGIC LANGUAGES; HIGHER-ORDER; LOGIC COMPUTATION; TEST DATA EVALUATION; Z SPECIFICATIONS;

COMPUTATION THEORY;

EID: 84888237327     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44525-0_24     Document Type: Conference Paper

References (25)

1. A. Aiken and E. Wimmers. Solving systems of set constraints. In Symposium on Logic in Computer Science, pages 329-340, June 1992.
2. P. Arenas-Sanchez and A. Dovier. A minimality study for set unification. Journal of Functional and Logic Programming, 1997(7), 1997.
3. R. D. Arthan. Recursive definitions in Z. In J. P. Bowen, A. Fett, and M. G. Hinchey, editors, ZUM'98: The Z Formal Specification Notation, volume 1493 of Lecture Notes in Computer Science, pages 154-171. Springer-Verlag, 1998.
4. R. Bussow and W. Grieskamp. The ZETA System Documentation. Technische Universitat Berlin, Dec. 1998. URL: http://uebb.cs.tu-berlin.de/zeta.
5. R. Bussow and W. Grieskamp. A Modular Framework for the Integration of Heterogenous Notations and Tools. In K. Araki, A. Galloway, and K. Taguchi, editors, Proc. of the 1st Intl. Conference on Integrated Formal Methods - IFM'99. Springer-Verlag, London, June 1999.
6. H. S. Goodman. The Z-into-Haskell tool-kit: An illustrative case study. In J. P. Bowen and M. G. Hinchey, editors, ZUM'95: The Z Formal Specification Notation, volume 967 of Lecture Notes in Computer Science, pages 374-388. Springer-Verlag, 1995.
7. M. Gordon and T. Melham, editors. Introduction to HOL: A theorem proving environment for higher-order logics. Cambridge University Press, 1993.
8. W. Grieskamp. The mZ calculus and its implementation. In Proceedings of the International Workshop on Implementation of Declarative Languages (IDL'99), Sept. 1999.
9. W. Grieskamp. A Set-Based Calculus and its Implementation. PhD thesis, Technische Universitat Berlin, 1999.
10. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal ofLogic Programming, 19(20), 1994.
11. M. Hanus. A unified computation model for declarative programming. In Proc. of the 1997 Joint Conference on Declarative Programming, Grado (Italy), 1997.
12. M. Hanus. Curry - an integrated functional logic language. Technical report, Internet, 1999. Language report version 0.5.
13. P. H. Hartel, M. Feeley, M. Alt, L. Augustsson, P. Baumann, M. Beemster, E. Chailloux, C. H. Flood, W. Grieskamp, J. H. G. van Groningen, K. Hammond, B. Hausman, M. Y. Ivory, R. E. Jones, J. Kamperman, P. Lee, X. Leroy, R. D. Lins, S. Loosemore, N. Rojemo, M. Serrano, J.-P. Talpin, J. Thackray, S. Thomas, P. Walters, P. Weis, and P. Wentworth. Benchmarking implementations of functional languages with "pseudoknot", a Float-Intensive benchmark. J. of Functional Programming, 6(4), 1996.
14. B. Jayaraman and K. Moon. Subset logic programs and their implementation. Journal of Logic Programming, 19(20), 1999.
15. X. Jia. An approach to animating Z specifications. Internet: http://saturn.cs.depaul.edu/~fm/zans.html, 1996.
16. G. Kahn. Natural semantics. In Symposium on Theoretical Computer Science (STACS'97), volume 247 of Lecture Notes in Computer Science, 1987.
17. M. Mehl, R. Scheidhauer, and C. Schulte. An Abstract Machine for Oz. Research Report RR-95-08, Deutsches Forschungszentrum fur Kiinstliche Intelligenz, Stuhl-satzenhausweg 3, D66123 Saarbriicken, Germany, June 1995. Also in: Proceedings of PLILP'95, Springer-Verlag, LNCS, Utrecht, The Netherlands.
18. O. Owe. Partial logic reconsidered: A conservative approach. Formal Aspects of Computing, 5:208-223, 1997.
19. G. Smolka. A calculus for higher-order concurrent constraint programming with deep guards. Research Report RR-94-03, Deutsches Forschungszentrum fuir Kuinstliche Intelligenz, Stuhlsatzenhausweg 3, D-66123 Saarbruicken, Germany, Feb. 1994.
20. J. M. Spivey. The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science, 2nd edition, 1992.
21. S. Valentine. The programming language Z. Information and Software Technology, 37(56):293-301, May-June 1995.
22. D. H. D. Warren. The extended andorra model with implicit control. In ICLP'90 Parallel Logic Programming Workshop, 1990.
23. M. M. West and B. M. Eaglestone. Software development: Two approaches to animation of Z specifications using Prolog. IEE/BCS Software Engineering Journal, 7(4):264-276, July 1992.
24. J. Wieland. A resolution algorithm for general subtyping constraints. Master's thesis, Technische Universitiat Berlin, 1999.
25. M. Winikoff, P. Dart, and E. Kazmierczak. Rapid prototyping using formal specifications. In Proceedings of the Australasian Computer Science Conference, 1998.