Algebraic Properties for Free!

Algebraic properties specify some natural properties of programming and specification constructs. This paper provides an overview of techniques to guarantee or generate algebraic properties of language constructs by investigating the syntactic shape of the deduction rules defining their operational semantics.

[1]  Michael Diaz,et al.  Protocol Specification, Testing, and Verification, V , 1986 .

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

[3]  Arnar Birgisson,et al.  Rule formats for determinism and idempotence , 2009, Sci. Comput. Program..

[4]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .

[5]  Luca Aceto,et al.  GSOS and Finite Labelled Transition Systems , 1994, Theor. Comput. Sci..

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

[7]  Gordon D. Plotkin,et al.  The origins of structural operational semantics , 2004, J. Log. Algebraic Methods Program..

[8]  Jan A. Bergstra,et al.  Verification of an alternating bit protocol by means of process algebra , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

[9]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[10]  Irek Ulidowski,et al.  Semantics and expressiveness of ordered SOS , 2009, Inf. Comput..

[11]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[12]  Bas Luttik,et al.  Finite Equational Bases in Process Algebra: Results and Open Questions , 2005, Processes, Terms and Cycles.

[13]  Jan Friso Groote,et al.  SOS formats and meta-theory: 20 years after , 2007, Theor. Comput. Sci..

[14]  Luca Aceto,et al.  A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages , 2010, SOS.

[15]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[16]  J. Bergstra,et al.  Mode transfer in process algebra , 2000 .

[17]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[18]  Sjoerd Cranen,et al.  A Rule Format for Associativity , 2008, CONCUR.

[19]  Erik P. de Vink,et al.  Axiomatizing GSOS with termination , 2002, J. Log. Algebraic Methods Program..

[20]  Ed Brinksma,et al.  A tutorial on LOTOS , 1985, PSTV.

[21]  Luca Aceto,et al.  A Rule Format for Unit Elements , 2009, SOFSEM.

[22]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[23]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[24]  Irek Ulidowski,et al.  Generating priority rewrite systems for OSOS process languages , 2009, Inf. Comput..

[25]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[26]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[27]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[28]  Faron Moller,et al.  The nonexistence of finite axiomatisations for CCS congruences , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

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

[30]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[31]  Jan Friso Groote,et al.  A syntactic commutativity format for SOS , 2005, Inf. Process. Lett..

[32]  Rob van Glabbeek.  On Cool Congruence Formats for Weak Bisimulations (Extended Abstract) , 2005 .

[33]  Luca Aceto,et al.  Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours , 1994, CONCUR.

[34]  Muck van Weerdenburg.  Automating Soundness Proofs , 2009, Electron. Notes Theor. Comput. Sci..

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

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

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

[38]  Irek Ulidowski,et al.  Finite axiom systems for testing preorder and De Simone process languages , 1996, Theor. Comput. Sci..

[39]  Frits W. Vaandrager,et al.  Turning SOS rules into equations , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[40]  Vincent van Oostrom,et al.  Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday , 2005, Processes, Terms and Cycles.

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

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

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