LETOS - a lightweight execution tool for operational semantics

Software - Practice and Experience

Volumn 29, Issue 15, 1999, Pages 1379-1416

  Hartel, Pieter H ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES; JAVA PROGRAMMING LANGUAGE; WEB BROWSERS;

OPERATIONAL SEMANTICS; PUBLICATION QUALITY RENDERING; SOFTWARE PACKAGE LATEX; SOFTWARE PACKAGE LETOS;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0033331740     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-024X(19991225)29:15<1379::AID-SPE286>3.0.CO;2-V     Document Type: Article

References (52)

1. Centaur team. Centaur tutorial. Research report, INRIA Rocquencourt, France, July 1994.
2. A. van Deursen, J. Heering and P. Klint, Language Prototyping: An Algebraic Specification Approach, AMAST* Series in Computing, World Scientific, Singapore, 1996.
3. H. R. Nielson and F. Nielson, Semantics with Applications: A Formal Introduction, John Wiley & Sons, Chichester, UK, 1991.
4. D. A. Turner, 'Miranda: A non-strict functional language with polymorphic types', in J.-P. Jouannaud (ed), 2nd Int. Conf. Functional Programming Languages and Computer Architecture, LNCS 201, Springer-Verlag, Berlin, 1985, pp. 1-16.
5. S. Stepney, High Integrity Compilation: A Case Study, Prentice Hall, Hemel Hempstead, UK, 1993.
6. M. Pettersson, 'Compiling natural semantics', PhD thesis, Department of Computer and Information Science, Linköping University, Sweden, 1995. (ftp.ida.liu.se/pub/labs/pelab/rml/papers/thesis.ps.gz)
7. T. B. Dinesh and S. Üsküdarh, 'While semantics in ASF+SDF', in T. B. Dinesh and S. Üsküdarli (eds), Using the ASF+SDF Meta-environment for Teaching Computer Science, CWI, Amsterdam, August 1994, pp. 109-124. (ftp.wins.uva.nl/pub/gipe/drafts/)
8. T. Despeyroux, 'Typol, a formalism to implement natural semantics', Research report 94, INRIA Sophia Antipolis, March 1988.
9. I. Attali and D. Parigot, 'Integrating natural semantics and attribute grammars: the Minotaur system', Research Report 2339, INRIA Sophia Antipolis, September 1994.
10. P. Borras, D. Clément, Th. Despeyroux, J. Incerpi, G. Kahn, B. Lang and V. Pascual, 'Centaur: the system', Third Annual Symposium on Software Development Environments (DE3), Boston, USA, 1988, pp. 14-24.
11. M. Pettersson, 'A compiler for natural semantics', in T. Gyimothy (ed.), 6th Int. Conf. Compiler Construction (CC), LNCS 1060, Springer-Verlag, Berlin, April 1996, pp. 177-191. (ftp.ida.liu.se/pub/labs/pelab/papers/cc96rml.ps.gz)
12. C. Verhoef, 'A congruence theorem for structured operational semantics with predicates and negative predicates', Nordic J. of Computing, 2(2), 274-302 (Summer 1995).
13. W. Fokkink and C. Verhoef, 'A conservative look at term deduction systems with variable binding', Logic group preprint series 140, Department of Philosophy, University of Utrecht, September 1995.
14. Xiaoping Jia, 'ZTC: A type checker for Z-user's guide', Department of Computer and Information Science, DePaul University, Chicago, Illinois, May 1995. (ftp.comlab.ox.ac.uk/pub/Zforum/ZTC-1.3/guide.ps.Z)
15. M. A. Hewitt, C. M. O'Halloran and C. T. Sennett, 'Experiences with PiZa, a Z animator', in J. P. Bowen, M. G. Hinchley and D. Till (eds.), 10th Int. Conf. of Z Users: The Z Formal Specification Notation (ZUM), LNCS 1212, Reading, UK, April 1997, pp. 37-51. (www.cs.reading.ac.uk/zum97/)
16. E. Best, Semantics of Sequential and Parallel Programs, Prentice Hall, Hemel Hempstead, UK, 1996.
17. J. C. Mitchell, Foundations of Programming Languages, MIT Press, Cambridge, MA, 1996.
18. G. Winksel, The Formal Semantics of Programming Languages, MIT Press, Cambridge, MA, 1993.
19. B. Kirkerud, Programming Language Semantics, International Thomson Computer Press, London, UK, 1997.
20. A. Pettorossi and M. Proietti, 'Transformation of logic programs', in D. Gabbay, C. J. Hogger and J. A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5 Logic Programming, Oxford University Press, 1996, pp. 200-299.
21. CEN European Committee for Standardization, 'Identification card systems - inter-sector electronic purse', Draft standard prEN 1546, European Committee for Standardization, Brussels, November 1995.
22. G. Hutton, 'Higher-order functions for parsing', J. Functional Programming, 2(3), 323-343 (July 1992).
23. W. G. Vree and P. H. Hartel, 'Communication lifting: fixed point computation for parallelism', J. Functional Programming, 5(4), 549-581 (October 1995). (ftp.wins.uva.nl/pub/computer-systems/functional/reports/ JFP_communication_lifting.ps.Z)
24. C. A. Gunter, Semantics of Programming Languages, MIT Press, Cambridge, MA, 1992.
25. T. Johnsson, 'Attribute grammars as a functional programming paradigm', in G. Kahn (ed.), 3rd Int. Conf. Functional Programming Languages and Computer Architecture, LNCS 274, Portland, Oregon, September 1987, pp. 154-173. Springer-Verlag, Berlin.
26. H. Abramson and V. Dahl, Logic Grammars, Springer-Verlag, Berlin, 1989.
27. J. F. T. Kamperman, 'Compilation of term rewriting systems', PhD thesis, Faculty of Mathematics, Computer Science, Physics and Astronomy, University of Amsterdam, September 1996.
28. S. L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice Hall, Englewood Cliffs, NJ, 1987.
29. J. F. Groote and F. W. Vaandrager, 'Structured operational semantics and bisimulation as a congruence', Information and Computation, 100(2), 202-260 (October 1992).
30. J. C. M. Baeten and C. Verhoef, 'Concrete process algebra', in S. Abramsky, D. M. Gabbay and T. S. E. Maibaum (eds.), Handbook of Logic in Computer Science, Volume IV, Oxford University Press, 1995, pp. 149-268.
31. W. J. Fokkink and C. Verhoef, 'Conservative extension in positive/negative conditional term rewriting with applications to software renovation factories', in J.-P. Finance (ed.), 2nd Conf. on Fundamental Approaches to Software Engineering, LNCS 1577, Amsterdam, The Netherlands, 1999, pp. 98-113. Springer-Verlag, Berlin.
32. P. H. Hartel, M. J. Butler and M. Levy, 'The operational semantics of a Java secure processor', in J. Alves-Foss (ed.), Formal Syntax and Semantics of Java, LNCS 1523, Springer-Verlag, 1999, pp. 313-352. (www.dsse.ecs.soton.ac.uk/techreports/98-1.html)
33. R. Milner, J. Parrow and D. Walker, 'A calculus of mobile processes part 1', Information and Computation, 100(1), 1-40 (September 1992).
34. P. Hartel, M. Butler, A. Currie, P. Henderson, M. Leuschel, A. Martin, A. Smith, U. Ultes-Nitsche and B. Walters, 'Questions and answers about ten formal methods', in S. Gnesi and D. Latella (eds.), 4th Int. Workshop on Formal Methods for Industrial Critical Systems, Vol II, Trento, Italy, July 1999, pp. 179-203. (www.dsse.ecs.soton.ac.uk/techreports/99-1.html)
35. P. Hartel, J. Hill and M. Sims, 'An operational model of QuickPay', in J.-J. Quisquater and B. Schneier (eds.), 3rd Int. Conf. Smart Card Research and Advanced Application (CARDIS 1998), LNCS, Louvain la Neuve, Belgium, September 1998. Springer-Verlag, Berlin, (www.dsse.ecs.soton.ac.uk/techreports/98-4.html)
36. M. I. Alberda, P. H. Hartel and E. K. de Jong Frz, 'Using formal methods to cultivate trust in smart card operating systems', Future Generation Computer Systems, 13(1), 39-54 (July 1997). (ftp.wins.uva.nl/pub/computer-systems/functional/reports/FGCS_formal_methods.ps. Z)
37. J. Mountjoy, P. H. Hartel and H. Corporaal, 'Modular operational semantic specification of transport triggered architectures', in C. Delgado Kloos and E. Cerny (eds.), 13th IFIP WG 10.5 Conf. on Computer Hardware Description Languages and their Applications, Toledo, Spain, April 1997, pp. 260-279. (ftp.wins.uva.nl/pub/computer-systems/functional/reports/CHDL97_specification. ps.Z)
38. S. L. Peyton Jones, C. V. Hall, K. Hammond, W. D. Partain and P. L. Wadler, 'The Glasgow Haskell compiler: a technical overview', in Joint Framework for Information Technology (JFIT) Technical Conf., Keele, UK, March 1993, pp. 249-257.
39. P. L. Wadler, 'How to replace failure by a list of successes, a method for exception handling, backtracking, and pattern matching in lazy functional languages', in J.-P. Jouannaud (ed), 2nd Int. Conf. Functional Programming Languages and Computer Architecture, LNCS 201, Nancy, France, September 1985, pp. 113-128. Springer-Verlag, Berlin.
40. R. Milner, Communication and Concurrency, Prentice Hall, Hemel Hempstead, UK, 1989.
41. R. Milner, 'A theory of type polymorphism in programming', J. Computer and System Science, 17(3), 348-375 (December 1978).
42. J. A. Robinson, 'A machine-oriented logic based on the resolution principle', JACM, 12(1), 23-41 (January 1965).
43. H. P. Barendregt, 'Lambda calculi with types', in S. Abramsky, D. M. Gabbai and T. S. E. Maibaum (eds), Handbook of Logic in Computer Science, Volume II Background: Computational Structures, Oxford, 1992, pp. 117-309. Oxford University Press, UK.
44. L. B. Sherrell and D. L. Carver, 'FunZ: An intermediate specification language', The Computer J., 38(3), 193-206 (1995).
45. D. A. Watt, 'Executable semantic descriptions', Software - Practice and Experience, 16(1), 13-43 (January 1986).
46. K. Slonneger, 'Executing continuation semantics: a comparison', Software - Practice and Experience, 23(12), 1379-1397 (December 1993).
47. R. Bornat and R. Sufrin, 'Jape: A calculator for animating proof-on-paper', in W. McCune (ed.), 14th Int. Conf. on Automated Deduction (CADE), LNCS 1249, Townsville, North Queensland, Australia, July 1997, pp. 412-415. Springer Verlag, Berlin.
48. M. Dam and F. Jensen, 'Compiler generation from relational semantics', in B. Robinet and R. Wilhelm (eds.), 1st European Symp. on Programming (ESOP), LNCS 213, Saarbrücken, West Germany, March 1986, pp. 1-29. Springer-Verlag, Berlin.
49. A. M. Gravell and P. Henderson, 'Executing formal specifications need not be harmful', Software Engineering J., 11(2), 104-110 (March 1996).
50. A. C. Winstanley and D. W. Bustard, 'EXPOSE: an animation tool for process-oriented specifications', Software Engineering J., 6(6), 463-475 (November 1991).
51. J. Grundy and T. Långbacka, 'Towards a browsable record of HOL proofs', TUCS Technical Reports 7, Turku Center for Computer Science, Turku, Finland, May 1996.
52. L. Lamport, 'How to write a proof, The American Mathematical Monthly, 102(7), 600-608 (August 1995).