Correct and user-friendly implementations of transformation systems

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

Volumn 1051, Issue , 1996, Pages 629-648

  Kolyang, K ^a   Santen, T ^b   Wolff, B ^a  

^a UNIVERSITY OF BREMEN   (Germany)

^b FRAUNHOFER FIRST   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHICAL USER INTERFACES; MACHINERY;

GLOBAL SEARCH; PROGRAM DERIVATION; PROGRAM TRANSFORMATIONS; TECHNICAL FRAMEWORKS; THEOREM PROVERS; TOOLS AND METHODS; TRANSFORMATION SYSTEMS; USER FRIENDLY;

FORMAL METHODS;

EID: 84955559608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60973-3_111     Document Type: Conference Paper

References (27)

1. Andrews, P.B., An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, Academic Press, 1986.
2. Basin, D., Isawhelk: Whelk interpreted in Isabelle. Abstract accepted at the 11th International Conference on Logic Programming (ICLP 94). Full version available via http://www.mpi-sb.mpg.de/guide/staff/basin/- pubs/iclp 11.ps.Z.
3. Bauer et al. (The CIP Language Group): The Munich Project CIP. Volume I: The wide spectrum language CIP-L. LNCS 183. 1985.
4. Bowen, J. P., Hinchey, M. J., Seven more Myths of Formal Methods: Dispelling Industrial Prejudices, in FME'94: Industrial Benefit of Formal Methods, proc. 2nd Int. Symposium of Formal Methods Europe, LNCS 873, Springer Verlag 1994, pp. 105-117.
5. Bird, R., de Moor, O.: Solving Optimisation Problems with Catamorphisms, in Proc. Second Conference on the Mathematics of Program Construction, LNCS 669, Springer Verlag 1993, pp. 49-56.
6. Church, A., A formulation of the simple theory of types. Journal of Symbolic Logic, 5, 1940, pp. 56-68.
7. Cant, A., Ozohls, M.A. Xlsabelle: A graphical User Interface to the Isabelle Theorem Prover. ftp://ftp.cl.cam.ac.uk/ml/Xlsabelle-2.0.tar.gz
8. Constable, R. S. et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, 1986.
9. Gersdorf, B., Liu, J. personnal communication.
10. Gordon, M.J.C., Melham, T.M.: Introduction to HOL: a theorem proving environment for higher order logics, Cambridge University Press, 1993.
11. Gordon. M: Notes on PVS from a HOL perspective. Available via Internet http://www.cl.cam.ac.uk/users/mjcg/PVS.ps.gz, 1995.
12. Hoffmann, B., Krieg-Brtickner, B. (eds.): PROgram Development by Specification and Transformation, The PROSPECTRA Methodology, Language Family, and System. LNCS 680, Springer-Verlag 1993.
13. Harper, R., MacQueen, R., Milner, R: Standard ML. Technical Report ECS-LFCS-86-2. 1986.
14. Heisel, M., Santen, T., Zimmermann, D.: Tool Support for Formal Software Development: A Generic Architecture, in Software Engineering -- ESEC '95, LNCS 989, Springer Verlag, 1995, pp. 272-293.
15. Kreitz, C.: Meta-Synthesis. Deriving Programs that Develop Programs. Technische Hochschule Darmstadt, 1993.
16. Krieg-Briickner, B., Peleska, J., Olderog, E.-R., Balzer, D., Baer, A.: Uniform Workbench -- Universelle Entwicklungsumgebung fiir formale Methoden. Technischer Bericht 8/95, Universit/it Bremen, 1995.
17. Kolyang, Wolff, B.: Development by Refinement Revisited: Lessons learnt from a case study. Proc. Softwaretechnik '95. Software-Technik Trends, Gesellschaft fiir Informatik, 1995, pp. 55-66.
18. Owre, S., Shankar, N., Rushby, J.M.: The PVS Specification Language (Beta Release). Comp. Sci. Lab., SRI International, Menlo Park, 1993.
19. Ousterhout, J.K.: Tcl and the Tk Toolkit. Addison Wesley, 1994.
20. Paulson, L. C.: Isabelle - A Generic Theorem Prover. LNCS 828, Springer Verlag, 1994.
21. Paulson, L. C.: A fixedpoint approach to implementing (co)inductive definitions, in Alan Bundy (ed), 12th International Conference on Automated Deduction, LNAI 814, 1994, Springer Verlag, pp. 148-161.
22. Pessaux, F., Rouaix, F.: The Caml/Tk interface, Projet Cristal, INRIA Rocquencourt, July 1995 ftp://ftp.inria.fr/lang/./INRIAIProjects/cristal/ caml-light/camltk.dvi.tar.gz
23. Smith, D. R.: Structure and Design of Global Search Algorithms, Technical Report Kes.U.87.12, Kestrel Institute, Palo Alto, 1987.
24. Smith, D. R.: KIDS - a semi-automatic program development system. IEEE Transactions on Software Engineering Special Issue on Formal Methods in Software Engineering, 16(9), 1990, pp. 1024-1043.
25. Smith, D. R., Parra, E. A., Westfold, S. J.: Synthesis of High-Performance Transportation Schedulers, Technical Report, Kestrel Institute, Palo Alto, 1995.
26. Syme, D.: A New Interface for HOL - Ideas, Issues and Implementation in Higher Order Logic: Theorem Proving and its Applications, LNCS 971, Springer Verlag 1995. pp 325-339.
27. Vullinghs,T., Tuijnman, D., Schulte, W., Lightweight GUI's for functional programming. PLILP 95, Utrecht, The Netherlands, 1995.