Learning Component Behavior from Tests : Theory and Algorithms for Automata with Data

Formal models are often used to describe the behavior of a computer program or component. Behavioral models have many different usages, e.g., in model-based techniques for software development and ...

[1]  Tiziana Margaria,et al.  LearnLib: a framework for extrapolating behavioral models , 2009, International Journal on Software Tools for Technology Transfer.

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

[3]  Jakob Rehof,et al.  Zing: A Model Checker for Concurrent Software , 2004, CAV.

[4]  Dexter Kozen,et al.  Automata and Computability , 1997, Undergraduate Texts in Computer Science.

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

[6]  Leonardo Mariani,et al.  Automatic generation of software behavioral models , 2008, 2008 ACM/IEEE 30th International Conference on Software Engineering.

[7]  Tiziana Margaria,et al.  Next Generation LearnLib , 2011, TACAS.

[8]  Frits W. Vaandrager,et al.  Inference and Abstraction of the Biometric Passport , 2010, ISoLA.

[9]  Klaus Havelund,et al.  Model checking programs , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.

[10]  Zvonimir Rakamaric,et al.  Symbolic Learning of Component Interfaces , 2012, SAS.

[11]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

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

[13]  Bengt Jonsson,et al.  Generating models of infinite-state communication protocols using regular inference with abstraction , 2015, Formal Methods Syst. Des..

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

[15]  Fides Aarts,et al.  Tomte : bridging the gap between active learning and real-world systems , 2014 .

[16]  Benedikt Bollig,et al.  A Fresh Approach to Learning Register Automata , 2013, Developments in Language Theory.

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

[18]  Loris D'Antoni,et al.  Minimization of symbolic automata , 2014, POPL.

[19]  Carlo Ghezzi,et al.  Synthesizing intensional behavior models by graph transformation , 2009, 2009 IEEE 31st International Conference on Software Engineering.

[20]  Douglas C. Schmidt,et al.  Guest Editor's Introduction: Model-Driven Engineering , 2006, Computer.

[21]  Thomas Schwentick,et al.  Two-variable logic on data words , 2011, TOCL.

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

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

[24]  Robert Eschbach,et al.  Iterative refinement of specification for component based embedded systems , 2011, ISSTA '11.

[25]  Raoul Praful Jetley,et al.  A formal methods approach to medical device review , 2006, Computer.

[26]  Bengt Jonsson,et al.  A succinct canonical register automaton model , 2015, J. Log. Algebraic Methods Program..

[27]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[28]  Neil Walkinshaw,et al.  Reverse Engineering State Machines by Interactive Grammar Inference , 2007, 14th Working Conference on Reverse Engineering (WCRE 2007).

[29]  Bengt Jonsson,et al.  Learning of event-recording automata , 2010, Theor. Comput. Sci..

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

[31]  Michael Benedikt,et al.  What You Must Remember When Processing Data Words , 2010, AMW.

[32]  Slawomir Lasota,et al.  Automata with Group Actions , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[33]  Kim G. Larsen,et al.  CMC: A Tool for Compositional Model-Checking of Real-Time Systems , 1998, FORTE.

[34]  Margus Veanes,et al.  An Evaluation of Automata Algorithms for String Analysis , 2011, VMCAI.

[35]  Dawn Xiaodong Song,et al.  Inference and analysis of formal models of botnet command and control protocols , 2010, CCS '10.

[36]  Joost Engelfriet,et al.  Tree-Walking Pebble Automata , 1999, Jewels are Forever.

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

[38]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[39]  Jun Sun,et al.  TzuYu: Learning stateful typestates , 2013, 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE).

[40]  Frits W. Vaandrager,et al.  Algorithms for Inferring Register Automata - A Comparison of Existing Approaches , 2014, ISoLA.

[41]  Stéphane Demri,et al.  LTL with the Freeze Quantifier and Register Automata , 2006, LICS.

[42]  Parosh Aziz Abdulla,et al.  Correction to: An integrated specification and verification technique for highly concurrent data structures , 2013, TACAS.

[43]  David Lee,et al.  Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[44]  T. Kanade.  Model-Based Testing of Reactive Systems , 2005 .

[45]  Frits W. Vaandrager,et al.  Learning and Testing the Bounded Retransmission Protocol , 2012, ICGI.

[46]  Helen J. Wang,et al.  Discoverer: Automatic Protocol Reverse Engineering from Network Traces , 2007, USENIX Security Symposium.

[47]  Bengt Jonsson,et al.  Regular Inference for State Machines Using Domains with Equality Tests , 2008, FASE.

[48]  Thomas Schwentick,et al.  Two-Variable Logic on Words with Data , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[49]  Sławomir Lasota,et al.  Relating timed and register automata , 2010 .

[50]  Bengt Jonsson,et al.  A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations , 2012, ATVA.

[51]  Bor-Yuh Evan Chang,et al.  Boogie: A Modular Reusable Verifier for Object-Oriented Programs , 2005, FMCO.

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

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

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

[55]  Thomas Schwentick,et al.  Finite state machines for strings over infinite alphabets , 2004, TOCL.

[56]  Thomas Schwentick,et al.  On Notions of Regularity for Data Languages , 2007, FCT.

[57]  Michael Kaminski,et al.  Finite-Memory Automata with Non-Deterministic Reassignment , 2010, Int. J. Found. Comput. Sci..

[58]  Yichen Xie,et al.  Zing: Exploiting Program Structure for Model Checking Concurrent Software , 2004, CONCUR.

[59]  David Lee,et al.  A model-based approach to security flaw detection of network protocol implementations , 2008, 2008 IEEE International Conference on Network Protocols.

[60]  Stephan Merz,et al.  Model Checking , 2000 .

[61]  Bernhard Steffen,et al.  The Open-Source LearnLib - A Framework for Active Automata Learning , 2015, CAV.

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

[63]  Keqin Li,et al.  Learning and Integration of Parameterized Components Through Testing , 2007, TestCom/FATES.

[64]  Domagoj Babic,et al.  Sigma*: symbolic learning of input-output specifications , 2013, POPL.

[65]  Benedikt Bollig,et al.  A Robust Class of Data Languages and an Application to Learning , 2014, Log. Methods Comput. Sci..

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

[67]  Joeri de Ruiter,et al.  Formal Models of Bank Cards for Free , 2013, 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops.

[68]  Therese Bohlin,et al.  Regular Inference for Communication Protocol Entities , 2008 .

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

[70]  Leonardo Mariani,et al.  Dynamic Analysis for Diagnosing Integration Faults , 2011, IEEE Transactions on Software Engineering.

[71]  Arie van Deursen,et al.  Crawling Ajax-Based Web Applications through Dynamic Analysis of User Interface State Changes , 2012, TWEB.

[72]  Pavol Cerný,et al.  Synthesis of interface specifications for Java classes , 2005, POPL '05.

[73]  Stephen McCamant,et al.  The Daikon system for dynamic detection of likely invariants , 2007, Sci. Comput. Program..

[74]  Colin de la Higuera,et al.  A bibliographical study of grammatical inference , 2005, Pattern Recognit..

[75]  Hiroshi Sakamoto,et al.  Intractability of decision problems for finite-memory automata , 2000, Theor. Comput. Sci..

[76]  Frits W. Vaandrager,et al.  Learning Register Automata with Fresh Value Generation , 2015, ICTAC.

[77]  Nikolaj Bjørner,et al.  Symbolic finite state transducers: algorithms and applications , 2012, POPL '12.

[78]  Benjamin Livshits,et al.  Improving software insecurity with precise static and runtime analysis , 2006 .

[79]  Gerard J. Holzmann,et al.  The SPIN Model Checker , 2003 .

[80]  Bengt Jonsson,et al.  Regular Inference for State Machines with Parameters , 2006, FASE.

[81]  Dawn Xiaodong Song,et al.  MACE: Model-inference-Assisted Concolic Exploration for Protocol and Vulnerability Discovery , 2011, USENIX Security Symposium.

[82]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[83]  Marta Z. Kwiatkowska,et al.  Probabilistic model checking in practice: case studies with PRISM , 2005, PERV.