Freshness and Name-Restriction in Sets of Traces with Names

We use nominal sets (sets with names and binding) to define a framework for trace semantics with dynamic allocation of resources. Using novel constructions in nominal sets, including the technical devices of positive nominal sets and maximal planes, we define notions of capture-avoiding composition and name-restriction on sets of traces with names. We conclude with an extended version of Kleene algebras which summarises in axiomatic form the relevant properties of the constructions.

[1]  Murdoch James Gabbay,et al.  Nominal (Universal) Algebra: Equational Logic with Names and Binding , 2009, J. Log. Comput..

[2]  Vincenzo Ciancia,et al.  Symmetries, local names and dynamic (de)-allocation of names , 2010, Inf. Comput..

[3]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[5]  Nikos Tzevelekos.  Fresh-register automata , 2011, POPL '11.

[6]  Dexter Kozen.  A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[7]  Andrew M. Pitts,et al.  On a monadic semantics for freshness , 2005, Theor. Comput. Sci..

[8]  Fabio Gadducci,et al.  About permutation algebras, (pre)sheaves and named sets , 2006, High. Order Symb. Comput..

[9]  Marcello M. Bonsangue,et al.  Pi-Calculus in Logical Form , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[10]  C. A. R. Hoare,et al.  Semantics of Nondeterminism, Concurrency, and Communication , 1979, J. Comput. Syst. Sci..

[11]  Andrzej S. Murawski,et al.  Nominal games and full abstraction for the nu-calculus , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[12]  Andrew M. Pitts,et al.  A Metalanguage for Programming with Bound Names Modulo Renaming , 2000, MPC.

[13]  Marino Miculan,et al.  A framework for typed HOAS and semantics , 2003, PPDP '03.

[14]  Marco Pistore,et al.  π-Calculus, structured coalgebras, and minimal HD-automata , 2000 .

[15]  Murdoch James Gabbay,et al.  A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets , 2009, Theor. Comput. Sci..

[16]  Martin Odersky,et al.  A functional theory of local names , 1994, POPL '94.

[17]  Marco Pistore,et al.  pi-Calculus, Structured Coalgebras, and Minimal HD-Automata , 2000, MFCS.

[18]  Davide Sangiorgi,et al.  A Fully Abstract Model for the [pi]-calculus , 1996, Inf. Comput..

[19]  Dexter Kozen,et al.  On Induction vs. *-Continuity , 1981, Logic of Programs.

[20]  Andrew M. Pitts,et al.  FreshML: programming with binders made simple , 2003, ICFP '03.

[21]  Murdoch James Gabbay.  A general mathematics of names , 2007, Inf. Comput..

[22]  Andrew M. Pitts,et al.  Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? , 1993, MFCS.

[23]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[24]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[25]  Sam Staton,et al.  Comparing Operational Models of Name-Passing Process Calculi , 2004, CMCS.

[26]  Alfred V. Aho,et al.  Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , 1978 .

[27]  J. Cheney,et al.  A sequent calculus for nominal logic , 2004, LICS 2004.

[28]  Daniele Turi,et al.  Semantics of name and value passing , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[29]  Davide Sangiorgi,et al.  A Fully-Abstract Model for the (cid:25) -calculus , 2022 .

[30]  Maribel Fernández,et al.  Nominal rewriting with name generation: abstraction vs. locality , 2005, PPDP.

[31]  Nissim Francez,et al.  Finite-Memory Automata , 1994, Theor. Comput. Sci..

[32]  Andrew M. Pitts.  Nominal system T , 2010, POPL '10.

[33]  Mogens Nielsen,et al.  Mathematical Foundations of Computer Science 2000 , 2001, Lecture Notes in Computer Science.

[34]  Robin Milner.  Action Calculi, or Syntactic Action Structures , 1993, MFCS.

[35]  Murdoch James Gabbay,et al.  Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax , 2011, The Bulletin of Symbolic Logic.