Interface Automata for Shared Memory

Interface theories based on Interface Automata (IA) areformalisms for the component-based specification of concurrent systems. Extensions of their basic synchronization mechanism permit the modelling of data, but are studied in more complex and expressive settings involving modal transition systems, imply severe restrictions such as determinacy, or do not abstract from internal computation.

[1]  Radu Mateescu,et al.  Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems , 2008, SPIN.

[2]  Alexandra Silva,et al.  Generalizing determinization from automata to coalgebras , 2013, Log. Methods Comput. Sci..

[3]  Bernhard Steffen,et al.  Data Flow Analysis as Model Checking , 1990, TACS.

[4]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

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

[6]  Multiparty asynchronous session types , 2008, POPL '08.

[7]  Bernhard Steffen,et al.  Active Automata Learning: From DFAs to Interface Programs and Beyond , 2012, ICGI.

[8]  Erik P. de Vink,et al.  The mCRL2 Toolset for Analysing Concurrent Systems - Improvements in Expressivity and Usability , 2019, TACAS.

[9]  Michel Bidoit,et al.  A Modal Interface Theory with Data Constraints , 2010, SBMF.

[10]  Kim G. Larsen,et al.  A modal specification theory for components with data , 2011, Sci. Comput. Program..

[11]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[12]  Davide Sangiorgi,et al.  Session types revisited , 2012, PPDP.

[13]  Samir Chouali,et al.  Refinement of Interface Automata Strengthened by Action Semantics , 2009, Electron. Notes Theor. Comput. Sci..

[14]  Walter Vogler,et al.  Error-pruning in interface automata , 2015, Theor. Comput. Sci..

[15]  Interface Automata for Shared Memory , 2018, Models, Mindsets, Meta.

[16]  A. Prasad Sistla,et al.  Taming Interface Specifications , 2005, CONCUR.

[17]  Kim G. Larsen,et al.  Modal Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[18]  Martin Wirsing,et al.  Interface theories for concurrency and data , 2011, Theor. Comput. Sci..

[19]  Thomas A. Henzinger,et al.  INTERFACE-BASED DESIGN , 2005 .

[20]  Kim G. Larsen,et al.  Modal I/O Automata for Interface and Product Line Theories , 2007, ESOP.

[21]  Rolf Hennicker,et al.  On Weak Modal Compatibility, Refinement, and the MIO Workbench , 2010, TACAS.

[22]  Axel Legay,et al.  A Modal Interface Theory for Component-based Design , 2011, Fundam. Informaticae.

[23]  Bengt Jonsson,et al.  An algebraic theory of interface automata , 2014, Theor. Comput. Sci..

[24]  Bertrand Meyer,et al.  Applying 'design by contract' , 1992, Computer.

[25]  Walter Vogler,et al.  Modal Interface Automata , 2012, Log. Methods Comput. Sci..

[26]  Axel Legay,et al.  Sociable Interfaces , 2005, FroCoS.

[27]  Samir Chouali,et al.  An I/O Automata-based Approach to Verify Component Compatibility: Application to the CyCab Car , 2010, Electron. Notes Theor. Comput. Sci..

[28]  Gary T. Leavens,et al.  Behavioral interface specification languages , 2012, CSUR.

[29]  Thomas A. Henzinger,et al.  Interface automata , 2001, ESEC/FSE-9.

[30]  Bengt Jonsson,et al.  Mediator Synthesis in a Component Algebra with Data , 2015, Correct System Design.

[31]  Alberto L. Sangiovanni-Vincentelli,et al.  Contracts for System Design , 2018, Found. Trends Electron. Des. Autom..

[32]  Davide Sangiorgi,et al.  Session types revisited , 2017, Inf. Comput..

[33]  YoshidaNobuko,et al.  Multiparty Asynchronous Session Types , 2008 .

[34]  Thomas A. Henzinger,et al.  Interface theories with component reuse , 2008, EMSOFT '08.

[35]  Walter Vogler,et al.  Nondeterministic Modal Interfaces , 2015, Theor. Comput. Sci..

[36]  Walter Vogler,et al.  A linear-time branching-time perspective on interface automata , 2020, Acta Informatica.

[37]  Walter Vogler,et al.  Fault-Free Refinements for Interface Automata , 2018 .

[38]  Gerald Lüttgen,et al.  A generalised theory of Interface Automata, component compatibility and error , 2018, Acta Informatica.

[39]  Bernhard Steffen,et al.  Compositional minimisation of finite state systems using interface specifications , 1996, Formal Aspects of Computing.