Playing with Abstraction and Representation

In this paper, we discuss partition refinement as an algorithmic pattern for explicating semantic properties of a system directly in the corresponding model structure in a co-inductive fashion. In particular, we review a landscape of analysis and verification approaches under this unifying perspective, which enables us to highlight their mutual profiles, while it at the same time establishes a basis for their combination: The common pattern establishes comparability, which reveals complementarity, and indicates where and under which circumstances the considered approaches may profit from one another. It can thus be regarded as a guideline for systematically exploring the benefits of the corresponding methods and their combinations.

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

[2]  Bernhard Steffen,et al.  Lazy code motion , 1992, PLDI '92.

[3]  Flemming Nielson,et al.  Infinitary control flow analysis: a collecting semantics for closure analysis , 1997, POPL '97.

[4]  Frits W. Vaandrager,et al.  Learning I/O Automata , 2010, CONCUR.

[5]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[6]  Bernhard Steffen,et al.  Unifying Models , 1997, STACS.

[7]  Tiziana Margaria,et al.  Model-Driven Development with the jABC , 2006, Haifa Verification Conference.

[8]  Corina S. Pasareanu,et al.  Learning Assumptions for Compositional Verification , 2003, TACAS.

[9]  Oded Maler,et al.  Learning Regular Languages over Large Alphabets , 2014, TACAS.

[10]  Bernhard Steffen,et al.  Introduction to Active Automata Learning from a Practical Perspective , 2011, SFM.

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

[12]  Nikolaj Bjørner,et al.  Satisfiability modulo theories , 2011, Commun. ACM.

[13]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[14]  Bernhard Steffen,et al.  Inferring Automata with State-Local Alphabet Abstractions , 2013, NASA Formal Methods.

[15]  Bernhard Steffen,et al.  Partial dead code elimination , 1994, PLDI '94.

[16]  Bernhard Steffen,et al.  Quality Engineering: Leveraging Heterogeneous Information - (Invited Talk) , 2011, VMCAI.

[17]  Tiziana Margaria,et al.  Automated continuous quality assurance , 2012, 2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA).

[18]  Bernhard Steffen,et al.  Automata Learning with Automated Alphabet Abstraction Refinement , 2011, VMCAI.

[19]  Bengt Jonsson,et al.  Inferring Semantic Interfaces of Data Structures , 2012, ISoLA.

[20]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[21]  Bernhard Steffen,et al.  Learning register automata: from languages to program structures , 2014, Machine Learning.

[22]  Hardi Hungar,et al.  Model Generation by Moderated Regular Extrapolation , 2002, FASE.

[23]  Bengt Jonsson,et al.  Inferring Canonical Register Automata , 2012, VMCAI.

[24]  Axel Legay,et al.  Statistical Model Checking: An Overview , 2010, RV.

[25]  Dirk Beyer,et al.  Explicit-State Software Model Checking Based on CEGAR and Interpolation , 2013, FASE.

[26]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[27]  Antonello Calabrò,et al.  Never-stop Learning: Continuous Validation of Learned Models for Evolving Systems through Monitoring , 2012, ERCIM News.

[28]  Matthew S. Hecht,et al.  Flow Analysis of Computer Programs , 1977 .

[29]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[30]  Helmut Veith,et al.  Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.

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

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

[33]  Frits W. Vaandrager,et al.  Automata Learning through Counterexample Guided Abstraction Refinement , 2012, FM.

[34]  Bernhard Steffen,et al.  Property-Oriented Expansion , 1996, SAS.

[35]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[36]  Oliver Niese,et al.  An integrated approach to testing complex systems , 2003 .

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

[38]  Colin de la Higuera,et al.  Grammatical Inference: Learning Automata and Grammars , 2010 .

[39]  Mihalis Yannakakis,et al.  Black Box Checking , 1999, FORTE.

[40]  Goetz Botterweck,et al.  Software diversity: state of the art and perspectives , 2012, International Journal on Software Tools for Technology Transfer.

[41]  Tiziana Margaria,et al.  Automated Learning Setups in Automata Learning , 2012, ISoLA.

[42]  James R. Larus,et al.  Mining specifications , 2002, POPL '02.

[43]  Bengt Jonsson,et al.  On the Correspondence Between Conformance Testing and Regular Inference , 2005, FASE.

[44]  Keith D. Cooper,et al.  Operator strength reduction , 2001, TOPL.

[45]  Bernhard Steffen,et al.  Active continuous quality control , 2013, CBSE '13.

[46]  Bernhard Steffen,et al.  The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning , 2014, RV.

[47]  Bengt Jonsson,et al.  Learning Extended Finite State Machines , 2014, SEFM.