A Conservative Look at Operational Semantics with Variable Binding

We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechanisms, and substitutions, among other notions such as negative hypotheses and unary predicates on terms. The framework is used to present a conservativity format in operational semantics, which states sufficient criteria to ensure that the extension of a transition system specification with new transition rules does not affect the semantics of the original terms.

[1]  Joseph Sifakis,et al.  The Algebra of Timed Processes, ATP: Theory and Application , 1994, Inf. Comput..

[2]  Mogens Nielsen,et al.  TAPSOFT '95: Theory and Practice of Software Development , 1995, Lecture Notes in Computer Science.

[3]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[4]  Jan Friso Groote,et al.  Proof Theory for µCRL: A Language for Processes with Data , 1993, Semantics of Specification Languages.

[5]  Chris Verhoef,et al.  Concrete process algebra , 1995, LICS 1995.

[6]  Robert L. Constable,et al.  The semantics of reflected proof , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[7]  Karen L. Bernstein.  A congruence theorem for structured operational semantics of higher-order languages , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[8]  Wan Fokkink,et al.  Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories , 1999, FASE.

[9]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[10]  Jan Friso Groote,et al.  Syntax and semantics of CRL , 1995 .

[11]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[12]  Rob J. van Glabbeek,et al.  The meaning of negative premises in transition system specifications II , 1996, J. Log. Algebraic Methods Program..

[13]  Jan A. Bergstra,et al.  Recursive Process Definitions with the State Operator , 1991, Theor. Comput. Sci..

[14]  Steve A. Schneider,et al.  An Operational Semantics for Timed CSP , 1995, Inf. Comput..

[15]  Wang Yi,et al.  CCS + Time = An Interleaving Model for Real Time Systems , 1991, ICALP.

[16]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[17]  Pieter H. Hartel,et al.  LETOS – a lightweight execution tool for operational semantics , 1999 .

[18]  Davide Sangiorgi,et al.  The lazy lambda calculus in a concurrency scenario , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[19]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[20]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, Theor. Comput. Sci..

[21]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[22]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[23]  Jan A. Bergstra,et al.  Discrete Time Process Algebra , 1992, CONCUR.

[24]  Jan Friso Groote,et al.  The Meaning of Negative Premises in Transition System Specifications , 1991, ICALP.

[25]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, CONCUR.

[26]  BolRoland,et al.  The meaning of negative premises in transition system specifications , 1996 .

[27]  Frits W. Vaandrager,et al.  SOS Rule Formats for Parameterized and State-Bearing Processes , 1995 .

[28]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[29]  Wan Fokkink,et al.  An Effective Axiomatization for Real Time ACP , 1995, Inf. Comput..

[30]  Douglas J. Howe.  Proving Congruence of Bisimulation in Functional Programming Languages , 1996, Inf. Comput..

[31]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[32]  Chris Verhoef,et al.  A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.

[33]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[34]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[35]  Anna Ingólfsdóttir,et al.  A Theory of Communicating Processes with Value Passing , 1993, Inf. Comput..

[36]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[37]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[38]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[39]  Jan A. Bergstra,et al.  The State Operator in Real Time Process Algebra , 1991, REX Workshop.

[40]  D. Walker,et al.  A Calculus of Mobile Processes, Part I , 1989 .

[41]  Davide Sangiorgi.  The Lazy Lambda Calculus in a Concurrency Scenario , 1994, Inf. Comput..

[42]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[43]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[44]  Wan Fokkink,et al.  A conservative look at term deduction systems with variable binding , 1995 .

[45]  Davide Sangiorgi,et al.  Pi-I: A Symmetric Calculus Based on Internal Mobility , 1995, TAPSOFT.

[46]  Rob van Glabbeek.  Full Abstraction in Structural Operational Semantics , 1993 .

[47]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[48]  Bard Bloom,et al.  Structural Operational Semantics for Weak Bisimulations , 1995, Theor. Comput. Sci..

[49]  Liang Chen.  Axiomatising Real-Time Processes , 1993, MFPS.

[50]  Matthew Hennessy.  A fully abstract denotational model for higher-order processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[51]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[52]  Harold T. Hodes,et al.  The | lambda-Calculus. , 1988 .

[53]  Wan Fokkink,et al.  Ntyft/Ntyxt Rules Reduce to Ntree Rules , 1996, Inf. Comput..

[54]  Alley Stoughton,et al.  Substitution Revisited , 1988, Theor. Comput. Sci..

[55]  J. C. M. Baeten,et al.  Process Algebra: Bibliography , 1990 .