print · source · login   

(redirected from Main.Literature)

Literature

Theory / Foundation / Educational

AHV12
F. Aarts, F. Heidarian, and F.W. Vaandrager. A Theory of History Dependent Abstractions for Learning Interface Automata. In M. Koutny and I. Ulidowski, editors. Proceedings 23rd International Conference on Concurrency Theory (CONCUR), Newcastle upon Tyne, UK, September 3-8, 2012. LNCS 7454, pp. 240-255, Springer-Verlag, 2012.
DLT02
Francois Denis, Aurelien Lemay, and Alain Terlutte. Residual Finite State Automata. Fundamenta Informaticae, 51(4):339-368, 2002.
G78
E. Mark Gold. Complexity of automaton identification from given data. Information and Control, 37(3):302-320, 1978.
KV94
Michael J. Kearns and Umesh V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, Cambridge, MA, USA, 1994.
AH01
L. de Alfaro and T. Henzinger. Interface automata. In ESEC/FSE-01, Software Engineering Notes 26, pages 109–120, 2001. ACM Press.
LT87
N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In PODC’87, pages 137–151.

Learning algorithms

Aarts14
F. Aarts, Tomte: Bridging the Gap between Active Learning and Real-world Systems. PhD thesis, Radboud University Nijmegen, October 2014.
AW10
F. Aarts and F.W. Vaandrager. Learning I/O Automata. In P. Gastin and F. Laroussinie, editors. Proceedings CONCUR'10, Paris, France, August 31st - September 3rd, 2010. LNCS 6269, pp. 71-85, Springer-Verlag, 2010.
AJU10
F. Aarts, B. Jonsson, and J. Uijen. Generating Models of Infinite-State Communication Protocols using Regular Inference with Abstraction. In Proceedings ICTSS 2010, 22nd IFIP International Conference on Testing Software and Systems, Natal, Brazil, November 8-12, 2010
AHKOV12
F. Aarts, F. Heidarian, H. Kuppens, P. Olsen, and F.W. Vaandrager. Automata Learning Through Counterexample-Guided Abstraction Refinement. In D. Giannakopoulou and D. Mery, editors. Proceedings 18th International Symposium on Formal Methods (FM 2012), Paris, France, August 27-31, 2012. LNCS 7436, pp. 10-27, Springer-Verlag, 2012.
Ang78
Dana Angluin. On the complexity of minimum inference of regular sets. Information and Control, 39(3):337-350, 1978.
Ang87
Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 2(75):87-106, 1987.
BDGW94
Jose L. Balcazar, Josep Diaz, Ricard Gavalda, and Osamu Watanabe. The query complexity of learning DFA. New Generation Comput., 12(4):337-358, 1994.
BJR06
Therese Berg, Bengt Jonsson, and Harald Raffelt. Regular Inference for State Machines with Parameters. In Luciano Baresi and Reiko Heckel, editors, Proc. FASE '10, 13th Int. Conf. on Fundamental Approaches to Software Engineering, volume 3922 of Lecture Notes in Computer Science, pages 107-121. Springer Verlag, 2006.
BJR08
Therese Berg, Bengt Jonsson, and Harald Raffelt. Regular Inference for State Machines Using Domains with Equality Tests. In Jose Luiz Fiadeiro and Paola Inverardi, editors, Proc. FASE '08, 11th Int. Conf. on Fundamental Approaches to Software Engineering, volume 4961 of Lecture Notes in Computer Science, pages 317-331. Springer Verlag, 2008.
CWKK09
P.M. Comparetti, G. Wondracek, C. Krügel, and E. Kirda. Prospex: Protocol specification extraction. In IEEE Symposium on Security and Privacy, pages 110-125. IEEE CS, 2009.
ELS10
Javier Esparza, Martin Leucker, and Maximilian Schlund. Learning Workflow Petri Nets. In Proceedings of the 31st International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (Petri Nets'10), Lecture Notes in Computer Science. Springer, 2010. to appear.
FISBJ12
Falk Howar, Malte Isberner, Bernhard Steffen, Oliver Bauer, and Bengt Jonsson. Inferring semantic interfaces of data structures. In Tiziana Margaria and Bernhard Steffen, editors, Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, volume 7609 of Lecture Notes in Computer Science, pages 554–571. Springer Berlin Heidelberg, 2012.
GJP06
Olga Grinchtein, Bengt Jonsson, and Paul Pettersson. Inference of Event- Recording Automata Using Timed Decision Trees. In Proc. CONCUR 2006, 17th Int. Conf. on Concurrency Theory, pages 435-449, 2006.
HHNS02
A. Hagerer, H. Hungar, O. Niese, and B. Steffen. Model generation by moderated regular extrapolation. Lecture Notes in Computer Science, pages 80-95, 2002.
Hig10
C. de la Higuera. Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, April 2010.
HSJC12
Falk Howar, Bernhard Steffen, Bengt Jonsson, and Sofia Cassel. Inferring canonical register automata. In Viktor Kuncak and Andrey Rybalchenko, editors, Verification, Model Checking, and Abstract Interpretation, volume 7148 of Lecture Notes in Computer Science, pages 251–266. Springer Berlin Heidelberg, 2012.
HS04
Hardi Hungar and Bernhard Steffen. Behavior-based model construction. Int. J. Softw. Tools Technol. Transf., 6(1):4-14, 2004.
IHS14
Malte Isberner, Falk Howar, and Bernhard Steffen. Learning register automata: from languages to program structures. Machine Learning, 96(1-2):65–98, 2014.
MP91
Oded Maler and Amir Pnueli. On the learnability of infinitary regular sets. In Proc. of the #1th annual workshop on Computational learning theory (COLT '91), pages 128-138, San Francisco, CA, USA, 1991. Morgan Kaufmann Publishers Inc.
RS89
Ronald L. Rivest and Robert E. Schapire. Inference of finite automata using homing sequences. In Proc. of the #1st Annual ACM Symposium on Theory of Computing (STOC '89), pages 411-420. MIT Laboratory for Computer Science, ACM Press, May 1989.
SG09
Muzammil Shahbaz and Roland Groz. Inferring Mealy Machines. In FM '09: Proceedings of the 2nd World Congress on Formal Methods, pages 207-222, Berlin, Heidelberg, 2009. Springer Verlag.
SLG07
Muzammil Shahbaz, Keqin Li, and Roland Groz. Learning Parameterized State Machine Model for Integration Testing. In Proc. 31st Annual Int. Computer Software and Applications Conf., volume 2, pages 755-760, Washington, DC, USA, 2007. IEEE Computer Society.
TomteFreshConf
F. Aarts, P. Fiterau-Brostean, H. Kuppens, and F.W. Vaandrager. Learning Register Automata with Fresh Value Generation. In M. Leucker, C. Rueda and F.D. Valencia, editors. Proceedings 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015), Cali, Colombia, October 29-31, 2015. LNCS 9399, pp. 1-19, Springer, 2015. DOI: 10.1007/978-3-319-25150-9_11.
TomteFreshJournal
F. Aarts, P. Fiterau-Brostean, H. Kuppens, and F.W. Vaandrager. Learning Register Automata with Fresh Value Generation. Journal paper invited for special issue of MSCS of best ICTAC 2015 papers.

Testing

BGJLRS05
Therese Berg, Olga Grinchtein, Bengt Jonsson, Martin Leucker, Harald Raffelt, and Bernhard Steffen. On the correspondence between conformance testing and regular inference. In Maura Cerioli, editor, Proc. of #1th Int. Conf. on Fundamental Approaches to Software Engineering (FASE '05), volume 3442 of Lecture Notes in Computer Science, pages 175-189. Springer Verlag, April 4-8 2005.
BJKLP05
Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, and Alexander Pretschner. Model-Based Testing of Reactive Systems:, volume 3472 of Lecture Notes in Computer Science. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2005.
Cho78
Tsun S. Chow. Testing software design modeled by finite-state machines. IEEE Transactions on Software Engineering, 4(3):178-187, May 1978.
FBKAG91
Susumu Fujiwara, Gregor von Bochmann, Ferhat Khendek, Mokhtar Amalou, and Abderrazak Ghedamsi. Test selection based on finite state models. IEEE Transactions on Software Engineering, 17(6):591-603, 1991.
HMNSBI01
A. Hagerer, T. Margaria, O. Niese, B. Steffen, G. Brune, and H.D. Ide. E.- cient regression testing of CTI-systems: Testing a complex call-center solution. Annual review of communication, Int.Engineering Consortium (IEC), 55:1033-1040, 2001.
JJRZ05
B. Jeannet, T. Jeron, V. Rusu, and E. Zinovieva. Symbolic test selection based on approximate analysis. In TACAS, pages 349-364. Springer, 2005.
RMSM09
Harald Raffelt, Maik Merten, Bernhard Steffen, and Tiziana Margaria. Dynamic testing via automata learning. Int. J. Softw. Tools Technol. Transf., 11(4):307- 324, 2009.
RBJ00
Vlad Rusu, Lydie Du Bousquet, and Thierry Jeron. An approach to symbolic test generation. In In Proc. Integrated Formal Methods, pages 338-357. Springer Verlag, 2000.
Tre11
J. Tretmans. Model-Based Testing and Some Steps towards Test-Based Modelling. In proceedings "Formal Methods for Eternal Networked Software Systems". Edited by M. Bernardo and V. Issarny. Lecture Notes in Computer Science, 2011, Volume 6659/2011, pp. 297-326.
Tre08
J. Tretmans. Model based testing with labelled transition systems. In R. Hierons, J. Bowen, and M. Harman, editors, Formal Methods and Testing, volume 4949 of Lecture Notes in Computer Science, pages 1-38. Springer Berlin / Heidelberg, 2008.

Verification

CGP03
Jamieson M. Cobleigh, Dimitra Giannakopoulou, and Corina S. Pasareanu. Learning assumptions for compositional veri cation. In Proc. TACAS '03, 9th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 2619 of Lecture Notes in Computer Science, pages 331-346. Springer Verlag, 2003.
GGP07
Mihaela Gheorghiu, Dimitra Giannakopoulou, and Corina S. Pasareanu. Refining Interface Alphabets for Compositional Verification. In TACAS, pages 292-307, 2007.
Leu06
M. Leucker. Learning meets veri cation. In FMCO, LNCS 4709, pages 127-151. Springer, 2006.
ID96
C. Ip and D. Dill. Better verification through symmetry. FMSD, 9(1/2):41-75, 1996.
LGSBB95
C. Loiseaux, S. Graf, J. Sifakis, A. Boujjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. FMSD, 6(1):11-44, 1995.
PGBCB08
Corina S. Pasareanu, Dimitra Giannakopoulou, Mihaela Gheorghiu Bobaru, Jamieson M. Cobleigh, and Howard Barringer. Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning. Formal Methods in System Design, 32(3):175-205, 2008.
PVY99
Doron Peled, Moshe Y. Vardi, and Mihalis Yannakakis. Black box checking. In Jianping Wu, Samuel T. Chanson, and Qiang Gao, editors, Proc. of the Joint Int. Conf. on Formal Description Techniques for Distributed System and Communication/Protocols and Protocol Specification, Testing and Verification FORTE/PSTV '99:, pages 225-240. Kluwer Academic Publishers, 1999.

Case Studies / Optimizations / Benchmarks

Aarts14
F. Aarts, Tomte: Bridging the Gap between Active Learning and Real-world Systems. PhD thesis, Radboud University Nijmegen, October 2014.
ASV10
F. Aarts, J. Schmaltz, and F.W. Vaandrager. Inference and Abstraction of the Biometric Passport. In T. Margaria and B. Steffen, editors. Proceedings 4th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2010), 18-20 October 2010 - Amirandes, Heraclion, Crete. LNCS 6415, pp. 673-686, Springer-Verlag, 2010.
AKHV14
F. Aarts, H. Kuppens, F. Howar, and F.W. Vaandrager. Algorithms for Inferring Register Automata - A Comparison of Existing Approaches. In T. Margaria and B. Steffen, editors. Proceedings 6th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISOLA 2014), 8-11 October 2014, Imperial, Corfu, Greece. LNCS 8802, pp. 202-2019, Springer Verlag, 2014.
AKTVV12
F. Aarts, H. Kuppens, G.J. Tretmans, F.W. Vaandrager, and S. Verwer. Learning and Testing the Bounded Retransmission Protocol. In J. Heinz, C. de la Higuera, and T. Oates, editors. Proceedings 11th International Conference on Grammatical Inference (ICGI 2012), September 5-8, 2012. University of Maryland, College Park, USA. JMLR Workshop and Conference Proceedings 21:4-18, 2012.
ARP13
F. Aarts, J. de Ruiter, and E. Poll. Formal models of bank cards for free. In Proceedings SECTEST 2013, 4th International Workshop on Security Testing, Luxembourg, March 22, 2013.
BJLS03
Therese Berg, Bengt Jonsson, Martin Leucker, and Mayank Saksena. Insights to Angluin's Learning. Technical Report 2003-039, Department of Information Technology, Uppsala University, August 2003.
BJ09
Therese Bohlin and Bengt Jonsson. Regular inference for communication protocol entities. Technical report, Department of Information Technology, Uppsala University, Schweden, 2009.
BKKL07
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker. Replaying play in and play out: Synthesis of design models from scenarios by learning. In Orna Grumberg and Michael Huth, editors, Proc. of #1th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '07), Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS '07) Braga, Portugal, volume 4424 of Lecture Notes in Computer Sci- ence, pages 435-450. Springer, 2007.
CBSS10
Chia Yuan Cho, Domagoj Babic, Eui Chul Richard Shin, and Dawn Song. Inference and analysis of formal models of botnet command and control protocols. In Conf. on Computer and Communications Security, pages 426-439. ACM, 2010.
CPPR14
Georg Chalupar, Stefan Peherstorfer, Erik Poll, and Joeri de Ruiter. Automated Reverse Engineering using Lego. 8th USENIX Workshop on Offensive Technologies (WOOT'14), USENIX Association, 2014.
HNS03
Hardi Hungar, Oliver Niese, and Bernhard Steffen. Domain-specific optimization in automata learning. In Warren A. Hunt Jr. and Fabio Somenzi, editors, Proc. of the #1th Int. Conf. on Computer Aided Verification (CAV '03), volume 2725 of Lecture Notes in Computer Science, pages 315-327. Springer Verlag, July 2003.
K17
M. Kerkers. Assessing the Security of IEC 60870-5-104 Implementations using Automata Learning. Master thesis, University of Twente, April 2017.
MRS05
Tiziana Margaria, Harald Raffelt, and Bernhard Steffen. Knowledge-based relevance filtering for efficient system-level test-based model generation. Innovations in Systems and Software Engineering, 1(2):147-156, July 2005.
MNRS04
T. Margaria, O. Niese, H. Raffelt, and B. Steffen. Ecient test-based model generation for legacy reactive systems. In HLDVT '04: Proceedings of the High- Level Design Validation and Test Workshop, 2004. Ninth IEEE International, pages 95-100, Washington, DC, USA, 2004. IEEE Computer Society.
MRS05a
Tiziana Margaria, Harald Raffelt, and Bernhard Steen. Analyzing Second- Order Effects Between Optimizations for System-Level Test-Based Model Generation. In Test Conference, 2005. Proceedings. ITC 2005. IEEE International. IEEE Computer Society, November 2005.
RMSM08
Harald Raffelt, Tiziana Margaria, Bernhard Steffen, and Maik Merten. Hybrid test of web applications with webtest. In TAV-WEB '08: Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications, pages 1-7, New York, NY, USA, 2008. ACM.
RP15
Joeri de Ruiter, Erik Poll. Protocol state fuzzing of TLS implementations. 24th USENIX Security Symposium (USENIX Security 15), USENIX Association, 2015
Sme13
Wouter Smeenk. Applying Automata Learning to Complex Industrial Software. Master's Thesis, Radboud University Nijmegen, September 2012.
SMRN04
Bernhard Steffen, Tiziana Margaria, Harald Raffelt, and Oliver Niese. Efficient test-based model generation of legacy systems. In Proc. of the #1th IEEE Int. Workshop on High Level Design Validation and Test (HLDVT '04), pages 95-100, Sonoma (CA), USA, November 2004. IEEE Computer Society Press.
SMVJ15
Wouter Smeenk, Joshua Moerman, Frits Vaandrager, David N. Jansen. Applying Automata Learning to Embedded Control Software. Proceedings 17th International Conference on Formal Engineering Methods (ICFEM 2015), Paris, 3-6 November 2015.

Tools

Bel10
A. Belinfante. Jtorx: A tool for on-line model-driven test derivation and execution. In J. Esparza and R. Majumdar, editors, Tools and Algorithms for the Construction and Analysis of Systems, volume 6015 of Lecture Notes in Computer Science, pages 266-270. Springer Berlin / Heidelberg, 2010.
BDL04
G. Behrmann, A. David, and K. Larsen. A tutorial on Uppaal. In Formal Methods for the Design of Real-Time Systems, volume 3185 of Lecture Notes in Computer Science, pages 33-35. Springer Berlin/Heidelberg, 2004.
BKKL08
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker. Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. In Franck van Breugel and Marsha Chechik, editors, Proc. of 19th Int. Conf. on Concurrency Theory (CONCUR '08), Toronto, Canada, August 19-22, 2008, volume 5201 of Lecture Notes in Computer Science, pages 162-166. Springer, 2008.
EPGMPTX07
M.D. Ernst, J.H. Perkins, P.J. Guo, S. McCamant, C. Pacheco, M.S. Tschantz, and C. Xiao. The Daikon system for dynamic detection of likely invariants. SCP, 69(1-3):35-45, 2007.
RSBM09
Harald Raffelt, Bernhard Steffen, Therese Berg, and Tiziana Margaria. LearnLib: a framework for extrapolating behavioral models. Int. J. Softw. Tools Technol. Transf., 11(5):393-407, 2009.
TB03
J. Tretmans and E. Brinksma. Torx: Automated model-based testing. In A. Hartman and K. Dussa-Ziegler, editors, First European Conference on Model-Driven Software Engineering, pages 31-43, December 2003.

Challenges

CHJ10
David Combe, Colin de la Higuera, and Jean-Christophe Janodet. Zulu: an Interactive Learning Competition. In Proceedings of FSMNLP 2009, 2010. to appear.
VEH12
Sicco Verwer, Remi Eyraud, and Colin de la Higuera. Results of the PAutomaC Probabilistic Automaton Learning Competition. In ICGI, pp. 243-248, JMLR proceedings 21, 2012.

Other benchmarks

AUTOMATARK
AutomatArk (Automata Benchmark) is a github project to collect benchmark problems for different models of automata, transducers, and related logics. Mainly DFA/NFA models.

Miscellaneous

CGJLV03
E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement for symbolic model checking. J. ACM, 50(5):752-794, 2003.