A Conservative Look at Operational Semantics with Variable Binding

Information and Computation

Volumn 146, Issue 1, 1998, Pages 24-54

  Fokkink, Wan ^a   Verhoef, Chris ^b  

^a SWANSEA UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001776099     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2729     Document Type: Article

References (55)

1. Allen, S. F., Constable, R. L., Howe, D. J., and Aitken, W. E. (1990), The semantics of reflected proof, in "Proceedings, 5th IEEE Symposium on Logic in Computer Science (LICS'90), Philadelphia," pp. 95-197, IEEE Computer Society Press, Los Alamitos, CA.
2. Baeten, J. C. M., and Bergstra, J. A. (1991), Real time process algebra, Form. Asp. Comput. 3(2), 142-188.
3. Baeten, J. C. M., and Bergstra, J. A. (1991), Recursive process definitions with the state operator, Theoret. Comput. Sci. 82(2), 285-302.
4. Baeten, J. C. M., and Bergstra, J. A. (1992), Discrete time process algebra, in "Proceedings, 3rd Conference on Concurrency Theory (CONCUR'92), Stony Brook" (W. R. Cleaveland, Ed.), Lecture Notes in Computer Science, Vol. 630, pp. 401-420, Springer-Verlag, Berlin.
5. Baeten, J. C. M., and Bergstra, J. A. (1996), Discrete time process algebra, Form. Asp. Comput. 8(2), 188-208.
6. Baeten, J. C. M., and Verhoef, C. (1993), A congruence theorem for structured operational semantics with predicates, in "Proceedings, 4th Conference on Concurrency Theory (CONCUR'93), Hildesheim" (E. Best, Ed.), Lecture Notes in Computer Science, Vol. 715, pp. 477-492, Springer-Verlag, Berlin.
7. Baeten, J. C. M., and Verhoef, C. (1995), Concrete process algebra, in "Handbook of Logic in Computer Science, Volume IV, Syntactical Methods" (S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, Eds.), pp. 149-268, Oxford Univ. Press, London.
8. Baeten, J. C. M., and Weijland, W. P. (1990), "Process Algebra," Cambridge Tracts in Theoretical Computer Science 18, Cambridge Univ. Press, Cambridge, UK.
9. Barendregt, H. P. (1984), "The Lambda Calculus-Its Syntax and Semantics," Studies in Logic and the Foundations of Mathematics 103, Revised edition, North-Holland, Amsterdam.
10. Bernstein, K. L. (1998), A congruence theorem for structured-operational semantics of higher-order languages, in "Proceedings, 13th IEEE Symposium on Logic in Computer Science (LICS'98), Indianapolis," IEEE Computer Society Press, to appear.
11. Bloom, B. (1995), Structural operational semantics for weak bisimulations, Theoret. Comput. Sci. 146(1/2), 25-68.
12. Bloom, B., Istrail, S., and Meyer, A. R. (1995), Bisimulation can't be traced, J. Assoc. Comput. Mech. 42(1), 232-268.
13. Bloom, B., and Vaandrager, F. W. (1995), SOS rule formats for parameterized and state-bearing processes, unpublished manuscript.
14. Bol, R. N., and Groote, J. F. (1996), The meaning of negative premises in transition system specifications, J. Assoc. Comput. Mech. 43(5), 863-914.
15. Chang, C. C., and Keisler, H. J. (1990), "Model Theory," North-Holland, Amsterdam.
16. Chen, L. (1993), Axiomatising real-timed processes, in "Proceedings, 9th Conference on Mathematical Foundations of Programming Semantics (MFPS'93), New Orleans" (S. Brooks, M. Main, A. Melton, M. Mislove, and D. Schmidt, Eds.), Lecture Notes in Computer Science, Vol. 802, pp. 215-229, Springer-Verlag, Berlin.
17. Constable, R. L., et al. (1986), "Implementing Mathematics with the Nuprl Proof Development System," Prentice Hall, New York.
18. D'Argenio, P. R. (1995), A general conservative extension theorem in process algebras with inequalities, in "Proceedings, 2nd Workshop on the Algebra of Communicating Processes (ACP'95), Eindhoven" (A. Ponse, C. Verhoef, and S. F. M. van Vlijmen, Eds.), pp. 67-79, Report CS-95-14, Eindhoven University of Technology.
19. D'Argenio, P. R., and Verhoef, C. (1997), A general conservative extension theorem in process algebras with inequalities, Theoret. Comput. Sci. 177(2), 351-380.
20. Fokkink, W. J., and van Glabbeek, R. J. (1996), Ntyft/ntyxt rules reduce to ntree rules, Inform. Comput. 126(1), 1-10.
21. Fokkink, W. J., and Klusener, A. S. (1995), An effective axiomatization for real time ACP, Inform. Comput. 122(2), 286-299.
22. Fokkink, W. J., and Verhoef, C. (1995), "A Conservative Look at Term Deduction Systems with Variable Binding," Logic Group Preprint Series 140, Utrecht University, available at http://www.phil.uu.nl.
23. Fokkink, W. J., and Verhoef, C. (1998), "Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories," Report P9802, University of Amsterdam, available at http://adam.wins.uva.nl/∼x.
24. van Gelder, A., Ross, K., and Schlipf, J. S. (1991), The well-founded semantics for general logic programs, J. Assoc. Comput. Mech. 38(3), 620-650.
25. Gelfond, M., and Lifschitz, V. (1988), The stable model semantics for logic programming, in "Proceedings, 5th Conference on Logic Programming," pp. 1070-1080, MIT Press, Cambridge, MA.
26. van Glabbeek, R. J. (1993), Full abstraction in structural operational semantics, in "Proceedings, 3rd Conference on Algebraic Methodology and Software Technology (AMAST'93), Enschede" (M. Nivat, C. Rattray, T. Rus, and G. Scollo, Eds.), Workshops in Computing, pp. 77-84, Springer-Verlag, Berlin.
27. van Glabbeek, R. J. (1995), "The Meaning of Negative Premises in Transition System Specifications II", Report STAN-CS-TN-95-16, Stanford University, available at http://theory.stanford.edu/∼rvg.
28. van Glabbeek, R. J. (1996), The meaning of negative premises in transition system specifications II, Extended abstract, in "Proceedings, 23rd Colloquium on Automata, Languages and Programming (ICALP'96), Paderborn" (F. Meyer auf der Heide and B. Monien, Eds.), Lecture Notes in Computer Science, Vol. 1099, pp. 502-513, Springer-Verlag, Berlin.
29. Groote, J. F. (1993), Transition system specifications with negative premises, Theoret. Comput. Sci. 118(2), 263-299.
30. Groote, J. F., and Ponse, A. (1994), Proof theory for μCRL: a language for processes with data, in "Proceedings, Workshop on Semantics of Specification Languages" (D. J. Andrews, J. F. Groote, and C. A. Middelburg, Eds.), Workshops in Computing, pp. 232-251, Springer-Verlag, Berlin.
31. Groote, J. F., and Ponse, A. (1995), Syntax and semantics of μCRL, in "Proceedings, 1st Workshop on the Algebra of Communicating Processes (ACP'94), Utrecht," Workshops in Computing, pp. 26-62, Springer-Verlag, Berlin.
32. Groote, J. F., and Vaandrager, F. W. (1992), Structured operational semantics and bisimulation as a congruence, Inform. Comput. 100(2), 202-260.
33. Hartel, P. H., (1997), "LATOS-A Lightweight Animation Tool for Operational Semantics," Report DSSE-TR-97-1, University of Southampton, available at http://www.dsse.ecs.soton.ac.uk.
34. Hennessy, M. (1988), "Algebraic Theory of Processes," MIT Press, Cambridge, MA.
35. Hennessy, M. (1994), A fully abstract denotational model for higher-order processes, Inform. Comput. 112(1), 55-95.
36. Hennessy, M., and Ingólfsdóttir, A. (1993), A theory of communicating processes with value passing, Inform. Comput. 107(2), 202-236.
37. Hoare, C. A. R. (1985), "Communicating Sequential Processes," Prentice Hall, New York.
38. Howe, D. J. (1996), Proving congruence of bisimulation in functional programming languages, Inform. Comput. 124(2), 103-112.
39. Milner, R. (1989), "Communication and Concurrency," Prentice Hall, New York.
40. Milner, R., Parrow, J., and Walker, D. (1991), Modal logics for mobile processes, in "Proceedings, 2nd Conference on Concurrency Theory (CONCUR'91), Amsterdam" (J. C. M. Baeten and J. F. Groote, Eds.), Lecture Notes in Computer Science, Vol. 527, pp. 45-60, Springer-Verlag, Berlin.
41. Milner, R., Parrow, J., and Walker, D. (1992), A calculus of mobile processes, part I+II, Inform. Comput. 100(1), 1-77.
42. Moller, F., and Tofts, C. (1990), A temporal calculus of communicating systems, in "Proceedings, 1st Conference on Concurrency Theory (CONCUR'90), Amsterdam" (J. C. M. Baeten and J. W. Klop, Eds.), Lecture Notes in Computer Science, Vol. 458, pp. 401-415, Springer-Verlag, Berlin.
43. Nicollin, X., and Sifakis, J. (1994), The algebra of timed processes, ATP: theory and application, Inform. Comput. 114(1), 131-178.
44. Plotkin, G. D. (1981), "A Structural Approach to Operational Semantics," Report DAIMI FN-19, Aarhus University.
45. Przymusinski, T. C. (1990), The well-founded semantics coincides with the three-valued stable semantics, Fundam. Informat. 13(4), 445-463.
46. Sangiorgi, D. (1994), The lazy lambda calculus in a concurrency scenario, Inform. Comput. 111(1), 120-153.
47. Sangiorgi, D. (1995), πI: A symmetric calculus based on internal mobility, in "Proceedings, 6th Conference on Theory and Practice of Software Development (TAPSOFT'95), Aarhus" (P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, Eds.), Lecture Notes in Computer Science, Vol. 915, pp. 172-186, Springer-Verlag, Berlin.
48. Schneider, S. A. (1995), An operational semantics for timed CSP, Inform. Comput. 116(2), 193-213.
49. de Simone, R. (1985), Higher-level synchronising devices in MEIJE-SCCS, Theoret. Comput. Sci. 37(3), 245-267.
50. Stoughton, A. (1988), Substitution revisited, Theoret. Comput. Sci. 59(3), 317-325.
51. Tarski, A. (1955), A lattice theoretical fixed point theorem and its applications, Pacific J. Mathem. 5, 285-309.
52. Verhoef, C. (1994), A general conservative extension theorem in process algebra, in "Proceedings, IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET'94), San Miniato" (E.-R. Olderog, Ed.), IFIP Transactions A-56, pp. 149-168, Elsevier, Amsterdam.
53. Verhoef, C. (1995), A congruence theorem for structured operational semantics with predicates and negative premises, Nordic J. Comput. 2(2), 274-302.
54. Wang, Y. (1991), CCS+ time=an interleaving model for real time systems, in "Proceedings, 18th Colloquium on Automata, Languages and Programming (ICALP'91), Madrid" (J. Leach Albert, B. Monien, and M. Rodríguez, Eds.), Lecture Notes in Computer Science, Vol. 510, pp. 217-228, Springer-Verlag, Berlin.
55. Watt, D. A. (1990), "Programming Concepts and Paradigms," Prentice Hall, New York.