Nominal Automata for Resource Usage Control

Two classes of nominal automata, namely Usage Automata (UAs) and Variable Finite Automata (VFAs) are considered to express resource control policies over program execution traces expressed by a nominal calculus (Usages). We first analyse closure properties of UAs, and then show UAs less expressive than VFAs. We finally carry over to VFAs the symbolic technique for model checking Usages against UAs, so making it possible to verify the compliance of a program with a larger class of security properties.

[1]  Kevin W. Hamlen,et al.  Computability classes for enforcement mechanisms , 2006, TOPL.

[2]  Gian Luigi Ferrari,et al.  Local policies for resource usage analysis , 2009, TOPL.

[3]  Luc Segoufin.  Automata and Logics for Words and Trees over an Infinite Alphabet , 2006, CSL.

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

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

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

[7]  Wojciech Rytter,et al.  On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[8]  Michael Kaminski,et al.  Context-free languages over infinite alphabets , 1998, Acta Informatica.

[9]  Javier Esparza,et al.  On the Decidability of Model Checking for Several µ-calculi and Petri Nets , 1994, CAAP.

[10]  Thomas Schwentick,et al.  Towards Regular Languages over Infinite Alphabets , 2001, MFCS.

[11]  Benedikt Bollig.  An Automaton over Data Words That Captures EMSO Logic , 2011, CONCUR.

[12]  Gian Luigi Ferrari,et al.  Planning and verifying service composition , 2009, J. Comput. Secur..

[13]  Massimo Bartoletti,et al.  Securing Java with Local Policies , 2009, J. Object Technol..

[14]  Michael Benedikt,et al.  Automata vs. Logics on Data Words , 2010, CSL.

[15]  Sophie Tison.  Trees in Algebra and Programming — CAAP'94 , 1994, Lecture Notes in Computer Science.

[16]  Massimo Bartoletti,et al.  LocUsT: a tool for checking usage policies , 2008 .

[17]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[18]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

[19]  Cheng-Shang Chang.  Calculus , 2020, Bicycle or Unicycle?.

[20]  Roberto Gorrieri,et al.  Foundations of Security Analysis and Design VII , 2014, Lecture Notes in Computer Science.

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

[22]  Peter Bro Miltersen,et al.  On Pseudorandom Generators in NC , 2001, MFCS.

[23]  Patricia Bouyer,et al.  A logical characterization of data languages , 2002, Inf. Process. Lett..

[24]  Gian-Luigi Ferrari,et al.  Nominal models and resource usage control , 2011 .

[25]  Gian Luigi Ferrari,et al.  Model Checking Usage Policies , 2008, TGC.

[26]  Andrew D. Gordon,et al.  Notes on Nominal Calculi for Security and Mobility , 2000, FOSAD.

[27]  David Van Horn,et al.  Types and trace effects of higher order programs , 2008, J. Funct. Program..

[28]  Orna Grumberg,et al.  Variable Automata over Infinite Alphabets , 2010, LATA.

[29]  Christel Baier,et al.  Principles of model checking , 2008 .

[30]  Jane Hillston,et al.  Challenges for Quantitative Analysis of Collective Adaptive Systems , 2013, TGC.

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

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

[33]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[34]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.