A modal specification theory for components with data

Modal specification is a well-known formalism used as an abstraction theory for transition systems. Modal specifications are transition systems equipped with two types of transitions: must-transitions that are mandatory to any implementation, and may-transitions that are optional. The duality of transitions allows to develop a unique approach for both logical and structural compositions, and eases the step-wise refinement process for building implementations.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[3]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[4]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[5]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

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

[7]  Kim G. Larsen,et al.  Equation solving using modal transition systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[8]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[9]  Wang Yi,et al.  UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.

[10]  Hassen Saïdi,et al.  Construction of Abstract State Graphs with PVS , 1997, CAV.

[11]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[12]  Parosh Aziz Abdulla,et al.  Algorithmic Analysis of Programs with Well Quasi-ordered Domains , 2000, Inf. Comput..

[13]  Thomas A. Henzinger,et al.  Interface Theories for Component-Based Design , 2001, EMSOFT.

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

[15]  Radha Jagadeesan,et al.  Modal Transition Systems: A Foundation for Three-Valued Program Analysis , 2001, ESOP.

[16]  Radha Jagadeesan,et al.  Abstraction-Based Model Checking Using Modal Transition Systems , 2001, CONCUR.

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

[18]  C. A. R. Hoare,et al.  Proof of correctness of data representations , 1972, Acta Informatica.

[19]  Patrice Godefroid,et al.  Model Checking with Multi-valued Logics , 2004, ICALP.

[20]  Jaco van de Pol,et al.  Modal Abstractions in µCRL , 2004, AMAST.

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

[22]  Orna Grumberg,et al.  When not losing is better than winning: Abstraction and refinement for the full mu-calculus , 2007, Inf. Comput..

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

[24]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[25]  Parosh Aziz Abdulla,et al.  Monotonic and Downward Closed Games , 2008, J. Log. Comput..

[26]  Kim G. Larsen,et al.  Complexity of Decision Problems for Mixed and Modal Specifications , 2008, FoSSaCS.

[27]  Harald Fecher,et al.  Comparing disjunctive modal transition systems with an one-selecting variant , 2008, J. Log. Algebraic Methods Program..

[28]  Jean-Baptiste Raclet,et al.  Residual for Component Specifications , 2008, Electron. Notes Theor. Comput. Sci..

[29]  Jean-Claude Royer,et al.  The STSLib Project: Towards a Formal Component Model Based on STS , 2008, FACS.

[30]  Jean-Baptiste Raclet,et al.  Modal Contracts for Component-Based Design , 2009, 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods.

[31]  Ludovic Henrio,et al.  Behavioural models for distributed Fractal components , 2009, Ann. des Télécommunications.

[32]  Axel Legay,et al.  Modal interfaces: unifying interface automata and modal specifications , 2009, EMSOFT '09.

[33]  Kim G. Larsen,et al.  On determinism in modal transition systems , 2009, Theor. Comput. Sci..

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

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

[36]  Joseph Sifakis,et al.  Rigorous Component-Based System Design Using the BIP Framework , 2011, IEEE Software.

[37]  Kim G. Larsen,et al.  Parametric Modal Transition Systems , 2011, ATVA.

[38]  Edward A. Lee,et al.  A Theory of Synchronous Relational Interfaces , 2011, TOPL.

[39]  Axel Legay,et al.  MIO Workbench: A Tool for Compositional Design with Modal Input/Output Interfaces , 2011, ATVA.

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

[41]  Benoît Caillaud,et al.  Ensuring Reachability by Design , 2012, ICTAC.