Improved verification methods for concurrent systems

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

[1]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[2]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[3]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

[4]  Pascal Durr,et al.  Resource-based Verification for Robust Composition of Aspects , 2008 .

[5]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.

[6]  Iris Loeb.  Natural Deduction, Sharing By Presentation , 2007 .

[7]  A. L. de Groot,et al.  Practical Automaton proofs in PVS , 2000 .

[8]  Jan Friso Groote,et al.  Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points , 2004, TACAS.

[9]  Cjf Cas Cremers.  Scyther : semantics and verification of security protocols , 2006 .

[10]  Pierre Wolper,et al.  Memory-efficient algorithms for the verification of temporal properties , 1990, Formal Methods Syst. Des..

[11]  D. Walker,et al.  A Calculus of Mobile Processes, Part Ii , 1989 .

[12]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[13]  Klaus Sutner,et al.  Computation theory of cellular automata , 1998 .

[14]  Martijn Warnier,et al.  Language based security for Java and JML , 2006 .

[15]  Damiano Bolzoni,et al.  Revisiting Anomaly-based Network Intrusion Detection Systems , 2009 .

[16]  Moshe Y. Vardi,et al.  Experimental Evaluation of Classical Automata Constructions , 2005, LPAR.

[17]  Rance Cleaveland,et al.  Computing Behavioural Relations, Logically , 1991, ICALP.

[18]  Jurgen Vinju,et al.  Analysis and transformation of source code by parsing and rewriting , 2005 .

[19]  Wan Fokkink,et al.  Cones and foci: A mechanical framework for protocol verification , 2006, Formal Methods Syst. Des..

[20]  RH Rudolf Mak,et al.  Design and performance analysis of data-independent stream processing systems , 2008 .

[21]  Ncwm Niels Braspenning.  Model-based integration and testing of high-tech multi-disciplinary systems , 2008 .

[22]  Ichiro Hasuo,et al.  Tracing Anonymity with Coalgebras , 2008 .

[23]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[24]  Nikolay Kavaldjiev,et al.  A run-time reconfigurable Network-on-Chip for streaming DSP applications , 2006 .

[25]  Karina R. Olmos Joffré.  Strategies for Context Sensitive Program Transformation , 2009 .

[26]  A. Prasad Sistla,et al.  Deciding Full Branching Time Logic , 1985, Inf. Control..

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

[28]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[29]  Rocco De Nicola,et al.  Action versus State based Logics for Transition Systems , 1990, Semantics of Systems of Concurrent Processes.

[30]  Alessandro Sperduti,et al.  Mining Structured Data , 2010, IEEE Computational Intelligence Magazine.

[31]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

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

[33]  V. Sundramoorthy,et al.  At Home in Service Discovery , 2006 .

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

[35]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

[36]  Jan Friso Groote,et al.  Verification of Temporal Properties of Processes in a Setting with Data , 1998, AMAST.

[37]  AJ Arjan Mooij,et al.  Constructive formal methods and protocol standardization , 2006 .

[38]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic , 2008, 25 Years of Model Checking.

[39]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[40]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[41]  Ileana Buhan,et al.  Cryptographic keys from noisy data, theory and applications , 2008 .

[42]  de Ism Ivo Jong.  Integration and test strategies for complex manufacturing machines , 2008 .

[43]  Patrice Godefroid,et al.  Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs , 1999, Formal Methods Syst. Des..

[44]  J. Brzozowski.  Canonical regular expressions and minimal state graphs for definite events , 1962 .

[45]  Christoph Meinel.  Switching Graphs and Their Complexity , 1989, MFCS.

[46]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[47]  Jack Edmonds,et al.  Matching: A Well-Solved Class of Integer Linear Programs , 2001, Combinatorial Optimization.

[48]  Ivan S. Zapreev.  Model checking Markov chains : techniques and tools , 2008 .

[49]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[50]  I. Lee,et al.  Symbolic Weak Bisimulation for Value-passing Calculi , 1998 .

[51]  Martin Peschke,et al.  Design and Validation of Computer Protocols , 2003 .

[52]  Jan A. Bergstra,et al.  Decidability of bisimulation equivalence for process generating context-free languages , 1987, JACM.

[53]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[54]  Jan Friso Groote,et al.  Analysis of distributed systems with mCRL2 , 2008 .

[55]  K. Mani Chandy,et al.  Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

[56]  Alain Kerbrat,et al.  CADP - A Protocol Validation and Verification Toolbox , 1996, CAV.

[57]  Aad Mathssen,et al.  Logical Calculi for Reasoning with Binding , 2008 .

[58]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[59]  R.S.S. O'Connor,et al.  Incompleteness & completeness : formalizing logic and analysis in type theory , 2005 .

[60]  Julian Bradfield.  Verifying Temporal Properties of Systems , 1992, Progress in Theoretical Computer Science.

[61]  Laura Brandán Briones,et al.  Theories for Model-based Testing: Real-time and Coverage , 2007 .

[62]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[63]  Marcel Verhoef,et al.  Modeling and validating distributed embedded real-time control systems , 2009 .

[64]  Hans Bekic,et al.  Definable Operation in General Algebras, and the Theory of Automata and Flowcharts , 1984, Programming Languages and Their Definition.

[65]  J. Ketema,et al.  Bohm-Like Trees for Rewriting , 2006 .

[66]  Cfj Christian Lange,et al.  Assessing and improving the quality of modeling : a series of empirical studies about the UML , 2007 .

[67]  Radu Mateescu,et al.  CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes , 2007, CAV.

[68]  Thomas A. Henzinger,et al.  Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[69]  Atze Dijkstra.  Stepping through Haskell , 2000 .

[70]  Edmund M. Clarke,et al.  The Birth of Model Checking , 2008, 25 Years of Model Checking.

[71]  A. J. Markvoort.  Towards hybrid molecular simulations , 2006 .

[72]  Søren Christensen,et al.  Bisimulation Equivalence is Decidable for all Context-Free Processes , 2022 .

[73]  Gürcan Gülesir,et al.  Evolvable Behavior Specifications Using Context-Sensitive Wildcards , 2008 .

[74]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[75]  Tomas Krilavicius,et al.  Hybrid Techniques for Hybrid Systems , 2006 .

[76]  Carla Piazza,et al.  From Bisimulation to Simulation: Coarsest Partition Problems , 2003, Journal of Automated Reasoning.

[77]  Colin Stirling,et al.  Lokal Model Checking Games , 1995, CONCUR.

[78]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[79]  EM Elena Bortnik,et al.  Formal methods in support of SMC design , 2008 .

[80]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[81]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[82]  Doron A. Peled,et al.  Combining partial order reductions with on-the-fly model-checking , 1994, Formal Methods Syst. Des..

[83]  Brian R. Duffy,et al.  The language of machines , 2003, ISICT.

[84]  Rance Cleaveland,et al.  Fast Generic Model-Checking for Data-Based Systems , 2005, FORTE.

[85]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[86]  Andrew William Roscoe,et al.  Model-checking CSP , 1994 .

[87]  Jan Friso Groote,et al.  A Bounded Retransmission Protocol for Large Data Packets , 1993, AMAST.

[88]  Vincent Danos,et al.  The structure of multiplicatives , 1989, Arch. Math. Log..

[89]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[90]  Jens R. Calamé,et al.  Testing reactive systems with data: enumerative methods and constraint solving , 2008 .

[91]  P. Zoeteweij,et al.  Composing constraint solvers , 2005 .

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

[93]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[94]  Ricardo Corin,et al.  Analysis Models for Security Protocols , 2006 .

[95]  Jan Friso Groote,et al.  Parameterised boolean equation systems , 2005, Theor. Comput. Sci..

[96]  Ivan Kurtev Ivanov,et al.  Adaptability of model transformations , 2005 .

[97]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[98]  Gerard J. Holzmann,et al.  An improved protocol reachability analysis technique , 1988, Softw. Pract. Exp..

[99]  Huimin Lin,et al.  Symbolic Transition Graph with Assignment , 1996, CONCUR.

[100]  Alan J. Hu,et al.  Checking for Language Inclusion Using Simulation Preorders , 1991, CAV.

[101]  Magiel Bruntink,et al.  Renovation of idiomatic crosscutting concerns in embedded systems , 2005 .

[102]  Thierry Massart,et al.  Infinite State Model Checking by Abstract Interpretation and Program Specialisation , 1999, LOPSTR.

[103]  Ali Mesbah,et al.  Analysis and Testing of Ajax-based Single-page Web Applications , 2009 .

[104]  Martín Abadi,et al.  Conjoining specifications , 1995, TOPL.

[105]  Marius Adrian Marin,et al.  An Integrated System to Manage Crosscutting Concerns in Source Code , 2008 .

[106]  Hui Gao,et al.  Design and verification of lock-free parallel algorithms , 2005 .

[107]  B. Gebremichael-Tesfagiorgis,et al.  Expressivity of Timed Automata Models , 2006 .

[108]  A Adam Koprowski,et al.  Termination of rewriting and its certification , 2004 .

[109]  Jasen Markovski,et al.  Real and stochastic time in process algebras for performance evaluation , 2008 .

[110]  Erika Ábrahám,et al.  An Assertional Proof System for Multithreaded Java - Theory and Tool Support , 2005 .

[111]  Marcin Czenko,et al.  TuLiP : reshaping trust management , 2009 .

[112]  Sven Schewe,et al.  An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games , 2008, CSL.

[113]  Kedar S. Namjoshi,et al.  On model checking for non-deterministic infinite-state systems , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

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

[115]  Karsten Weihe,et al.  Edge-disjoint routing in plane switch graphs in linear time , 2004, JACM.

[116]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[117]  B J Linney,et al.  What to do next? , 2001, BMJ : British Medical Journal.

[118]  C. Petri.  Kommunikation mit Automaten , 1962 .

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

[120]  Wolter Pieters,et al.  La volonté machinale: understanding the electronic voting controversy , 2008 .

[121]  Taolue Chen.  Clocks, Dice and Processes , 2009 .

[122]  Angelika Mader,et al.  Verification of modal properties using Boolean equation systems , 1997 .

[123]  T. D. Vu,et al.  Semantics and applications of process and program algebra , 2007 .

[124]  Mohammad Ali Abam.  New data structures and algorithms for mobile data , 2007 .

[125]  G Giovanni Russello,et al.  Separation and adaptation of concerns in a shared data space , 2006 .

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

[127]  Rance Cleaveland,et al.  Simulation Revisited , 2001, TACAS.

[128]  Yee Wei Law,et al.  Key management and link-layer security of wireless sensor networks : Energy-efficient attack and defense , 2005 .

[129]  Somesh Jha,et al.  Exploiting symmetry in temporal logic model checking , 1993, Formal Methods Syst. Des..

[130]  A. Rodriguez Yakushev,et al.  Towards Getting Generic Programming Ready for Prime Time , 2009 .

[131]  Kenneth L. McMillan,et al.  Verification of Infinite State Systems by Compositional Model Checking , 1999, CHARME.

[132]  Hugo Jonker,et al.  Security matters : privacy in voting and fairness in digital exchange , 2009 .

[133]  Orna Grumberg,et al.  Simulation-based minimization , 2003, TOCL.

[134]  Jan Friso Groote,et al.  The Syntax and Semantics of μCRL , 1995 .

[135]  M. J. de Mol,et al.  Reasoning about functional programs : Sparkle, a proof assistant for Clean , 2009 .

[136]  Jan Friso Groote,et al.  Model-checking processes with data , 2005, Sci. Comput. Program..

[137]  Sebastiaan Gijsbert Marinus Cornelissen,et al.  Evaluating Dynamic Analysis Techniques for Program Comprehension , 2009 .

[138]  Andrew V. Goldberg,et al.  Path problems in skew-symmetric graphs , 1994, SODA '94.

[139]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[140]  Bastiaan Stephan Graaf,et al.  Model-Driven Evolution of Software Architectures , 2007, 11th European Conference on Software Maintenance and Reengineering (CSMR'07).

[141]  Harmen Kastenberg.  Graph-based software specification and verification , 2008 .

[142]  Sami Evangelista,et al.  Memory Efficient State Space Storage in Explicit Software Model Checking , 2005, SPIN.

[143]  M. T. de Berg,et al.  Multi-functional geometric data structures , 2003 .

[144]  M. G. van der Horst,et al.  Scalable block processing algorithms , 2008 .

[145]  Dmitri Jarnikov,et al.  QoS framework for video streaming in home networks , 2007 .

[146]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[147]  Bard Bloom,et al.  Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem , 1995, Sci. Comput. Program..

[148]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[149]  E Elena Mumford,et al.  Drawing graphs for cartographic applications , 2008 .

[150]  Ana Sokolova,et al.  Coalgebraic analysis of probabilistic systems , 2005 .

[151]  Radu Mateescu,et al.  A Model Checking Language for Concurrent Value-Passing Systems , 2008, FM.

[152]  C.-B. Breunesse.  On JML: topics in tool-assisted verification of Java programs , 2006 .

[153]  Francesco Ranzato,et al.  A New Efficient Simulation Equivalence Algorithm , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[154]  Michael K. Molloy,et al.  Petri net , 2003 .

[155]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

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

[157]  Simona Orzan,et al.  Invariants for Parameterised Boolean Equation Systems , 2008, Theor. Comput. Sci..

[158]  Ling Cheung,et al.  Reconciling nondeterministic and probabilistic choices , 2006 .

[159]  Eu-Jin Goh,et al.  Searching on Encrypted Data , 2003 .

[160]  E. Allen Emerson,et al.  The Beginning of Model Checking: A Personal Perspective , 2008, 25 Years of Model Checking.

[161]  Jan Friso Groote,et al.  Algebraic Process Verification , 2001, Handbook of Process Algebra.

[162]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[163]  R. Boumen,et al.  Integration and test plans for complex manufacturing systems , 2007 .

[164]  Jan Friso Groote,et al.  An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence , 1990, ICALP.

[165]  Faron Moller,et al.  Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[166]  Eelco Dolstra,et al.  The purely functional software deployment model , 2006 .

[167]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[168]  M. Torabi Dashti,et al.  Keeping Fairness Alive : Design and formal verification of optimistic fair exchange protocols , 2008 .

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

[170]  Klaus Sutner,et al.  The size of power automata , 2003, Theor. Comput. Sci..

[171]  Henrik Reif Andersen.  Model Checking and Boolean Graphs , 1992, ESOP.

[172]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

[174]  Jan Friso Groote,et al.  A Sub-quadratic Algorithm for Conjunctive and Disjunctive Boolean Equation Systems , 2005, ICTAC.

[175]  Twan Basten,et al.  Branching Bisimilarity is an Equivalence Indeed! , 1996, Inf. Process. Lett..

[176]  Peter Verbaan,et al.  The Computational Complexity of Evolving Systems , 2006 .

[177]  Joost Engelfriet,et al.  Determinacy - (Observation Equivalence = Trace Equivalence) , 1985, Theor. Comput. Sci..

[178]  Orna Grumberg,et al.  Generation of Reduced Models for Checking Fragments of CTL , 1993, CAV.

[179]  H. Hansen.  Coalgebraic Modelling : Applications in Automata theory and Modal logic , 2009 .

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

[181]  Colin Stirling,et al.  Local Model Checking for Infinite State Spaces , 1992, Theor. Comput. Sci..

[182]  Martin Bravenboer,et al.  Exercises in Free Syntax. Syntax Definition, Parsing, and Assimilation of Language Conglomerates , 2003 .

[183]  M. A. Valero Espada,et al.  Modal Abstraction and Replication of Processes with Data , 2005 .

[184]  Jürgen Dingel,et al.  Model Checking for Infinite State Systems Using Data Abstraction, Assumption-Commitment Style reasoning and Theorem Proving , 1995, CAV.

[185]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[186]  Radu Mateescu,et al.  Local Model-Checking of an Alternation-Free Value-Based Modal Mu-Calculus , 1998 .

[187]  Patrice Godefroid.  Using Partial Orders to Improve Automatic Verification Methods , 1990, CAV.

[188]  Radu Mateescu,et al.  A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems , 2003, TACAS.

[189]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[190]  Jan Friso Groote,et al.  The Formal Specification Language mCRL2 , 2006, MMOSS.

[191]  R. V. Glabbeek.  The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR , 2007 .

[192]  Angelika H. Mader.  Verification of Modal Properties Using Infinite Boolean Equation Systems , 1997 .

[193]  Hasan Sözer,et al.  Architecting Fault-Tolerant Software Systems , 2009 .

[194]  Bahareh Badban,et al.  Verification Techniques for Extensions of Equality Logic , 2006 .

[195]  Olga Tveretina,et al.  A Decision Procedure for Equality Logic with Uninterpreted Functions , 2004, AISC.

[196]  van Mpwj Michiel Osch.  Automated model-based testing of hybrid systems , 2009 .

[197]  Arjen van Weelden,et al.  Putting Types To Good Use , 2007 .