2595 lines
No EOL
98 KiB
BibTeX
2595 lines
No EOL
98 KiB
BibTeX
@inproceedings{AartsV10,
|
||
author = {Fides Aarts and
|
||
Frits W. Vaandrager},
|
||
editor = {Paul Gastin and
|
||
Fran{\c{c}}ois Laroussinie},
|
||
title = {Learning {I/O} Automata},
|
||
booktitle = {{CONCUR} 2010 - Concurrency Theory, 21th International Conference,
|
||
{CONCUR} 2010, Paris, France, August 31-September 3, 2010. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {6269},
|
||
pages = {71--85},
|
||
publisher = {Springer},
|
||
year = {2010},
|
||
url = {https://doi.org/10.1007/978-3-642-15375-4\_6},
|
||
doi = {10.1007/978-3-642-15375-4\_6},
|
||
timestamp = {Tue, 23 May 2017 01:11:19 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/concur/AartsV10},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{AartsRP13,
|
||
author = {Fides Aarts and
|
||
Joeri de Ruiter and
|
||
Erik Poll},
|
||
title = {Formal Models of Bank Cards for Free},
|
||
booktitle = {Sixth {IEEE} International Conference on Software Testing, Verification
|
||
and Validation, {ICST} 2013 Workshops Proceedings, Luxembourg, Luxembourg,
|
||
March 18-22, 2013},
|
||
pages = {461--468},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1109/ICSTW.2013.60},
|
||
doi = {10.1109/ICSTW.2013.60},
|
||
timestamp = {Wed, 24 May 2017 08:30:36 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/icst/AartsRP13},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@phdthesis{Aarts14,
|
||
title = {Tomte: bridging the gap between active learning and real-world systems},
|
||
author = {Fides Dorothea Aarts},
|
||
year = {2014},
|
||
isbn = {978-90-9028499-6}
|
||
publisher = {[Sl: sn]},
|
||
series = {IPA dissertation series; 2014-12},
|
||
school = {Radboud University, Nijmegen, The Netherlands},
|
||
url = {http://hdl.handle.net/2066/130428}
|
||
}
|
||
|
||
@article{AartsKTVV14,
|
||
author = {Fides Aarts and
|
||
Harco Kuppens and
|
||
Jan Tretmans and
|
||
Frits W. Vaandrager and
|
||
Sicco Verwer},
|
||
title = {Improving active {M}ealy machine learning for protocol conformance testing},
|
||
journal = {Machine Learning},
|
||
volume = {96},
|
||
number = {1-2},
|
||
pages = {189--224},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1007/s10994-013-5405-0},
|
||
doi = {10.1007/s10994-013-5405-0},
|
||
timestamp = {Tue, 26 Jun 2018 14:09:25 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/ml/AartsKTVV14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{AartsFKV15,
|
||
author = {Fides Aarts and
|
||
Paul Fiterau{-}Brostean and
|
||
Harco Kuppens and
|
||
Frits W. Vaandrager},
|
||
editor = {Martin Leucker and
|
||
Camilo Rueda and
|
||
Frank D. Valencia},
|
||
title = {Learning Register Automata with Fresh Value Generation},
|
||
booktitle = {Theoretical Aspects of Computing - {ICTAC} 2015 - 12th International
|
||
Colloquium Cali, Colombia, October 29-31, 2015, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {9399},
|
||
pages = {165--183},
|
||
publisher = {Springer},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1007/978-3-319-25150-9\_11},
|
||
doi = {10.1007/978-3-319-25150-9\_11},
|
||
timestamp = {Tue, 23 May 2017 01:11:58 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/ictac/AartsFKV15},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{AartsJUV15,
|
||
author = {Fides Aarts and
|
||
Bengt Jonsson and
|
||
Johan Uijen and
|
||
Frits W. Vaandrager},
|
||
title = {Generating models of infinite-state communication protocols using
|
||
regular inference with abstraction},
|
||
journal = {Formal Methods in System Design},
|
||
volume = {46},
|
||
number = {1},
|
||
pages = {1--41},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1007/s10703-014-0216-x},
|
||
doi = {10.1007/s10703-014-0216-x},
|
||
timestamp = {Sat, 27 May 2017 14:24:05 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/fmsd/AartsJUV15},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{Angluin87,
|
||
author = {Dana Angluin},
|
||
title = {Learning Regular Sets from Queries and Counterexamples},
|
||
journal = {Inf. Comput.},
|
||
volume = {75},
|
||
number = {2},
|
||
pages = {87--106},
|
||
year = {1987},
|
||
url = {https://doi.org/10.1016/0890-5401(87)90052-6},
|
||
doi = {10.1016/0890-5401(87)90052-6},
|
||
timestamp = {Thu, 18 May 2017 09:54:17 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/iandc/Angluin87},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{AngluinC97,
|
||
author = {Dana Angluin and
|
||
Mikl{\'{o}}s Cs{\"{u}}r{\"{o}}s},
|
||
editor = {Yoav Freund and
|
||
Robert E. Schapire},
|
||
title = {Learning Markov Chains with Variable Memory Length from Noisy Output},
|
||
booktitle = {Proceedings of the Tenth Annual Conference on Computational Learning
|
||
Theory, {COLT} 1997, Nashville, Tennessee, USA, July 6-9, 1997.},
|
||
pages = {298--308},
|
||
publisher = {{ACM}},
|
||
year = {1997},
|
||
url = {https://doi.org/10.1145/267460.267517},
|
||
doi = {10.1145/267460.267517},
|
||
timestamp = {Tue, 06 Nov 2018 16:59:06 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/colt/AngluinC97},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{DAntoniV14,
|
||
author = {Loris D'Antoni and
|
||
Margus Veanes},
|
||
editor = {Suresh Jagannathan and
|
||
Peter Sewell},
|
||
title = {Minimization of symbolic automata},
|
||
booktitle = {The 41st Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
|
||
Programming Languages, {POPL} '14, San Diego, CA, USA, January 20-21,
|
||
2014},
|
||
pages = {541--554},
|
||
publisher = {{ACM}},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1145/2535838.2535849},
|
||
doi = {10.1145/2535838.2535849},
|
||
timestamp = {Tue, 06 Nov 2018 11:07:43 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/popl/DAntoniV14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{DAntoniV17,
|
||
author = {Loris D'Antoni and
|
||
Margus Veanes},
|
||
editor = {Rupak Majumdar and
|
||
Viktor Kuncak},
|
||
title = {The Power of Symbolic Automata and Transducers},
|
||
booktitle = {Computer Aided Verification - 29th International Conference, {CAV}
|
||
2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part {I}},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {10426},
|
||
pages = {47--67},
|
||
publisher = {Springer},
|
||
year = {2017},
|
||
url = {https://doi.org/10.1007/978-3-319-63387-9\_3},
|
||
doi = {10.1007/978-3-319-63387-9\_3},
|
||
timestamp = {Fri, 14 Jul 2017 12:55:54 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/cav/DAntoniV17},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BastianHJ09,
|
||
author = {Mathieu Bastian and
|
||
Sebastien Heymann and
|
||
Mathieu Jacomy},
|
||
editor = {Eytan Adar and
|
||
Matthew Hurst and
|
||
Tim Finin and
|
||
Natalie S. Glance and
|
||
Nicolas Nicolov and
|
||
Belle L. Tseng},
|
||
title = {Gephi: An Open Source Software for Exploring and Manipulating Networks},
|
||
booktitle = {Proceedings of the Third International Conference on Weblogs and Social
|
||
Media, {ICWSM} 2009, San Jose, California, USA, May 17-20, 2009},
|
||
publisher = {The {AAAI} Press},
|
||
year = {2009},
|
||
url = {http://aaai.org/ocs/index.php/ICWSM/09/paper/view/154},
|
||
timestamp = {Thu, 13 Dec 2012 14:15:16 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/icwsm/BastianHJ09},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BehrmannDLHPYH06,
|
||
author = {Gerd Behrmann and
|
||
Alexandre David and
|
||
Kim Guldstrand Larsen and
|
||
John H{\aa}kansson and
|
||
Paul Pettersson and
|
||
Wang Yi and
|
||
Martijn Hendriks},
|
||
title = {{UPPAAL} 4.0},
|
||
booktitle = {Third International Conference on the Quantitative Evaluation of Systems
|
||
{(QEST} 2006), 11-14 September 2006, Riverside, California, {USA}},
|
||
pages = {125--126},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1109/QEST.2006.59},
|
||
doi = {10.1109/QEST.2006.59},
|
||
timestamp = {Fri, 26 May 2017 00:51:19 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/qest/BehrmannDLHPYH06},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BergGJLRS05,
|
||
author = {Therese Berg and
|
||
Olga Grinchtein and
|
||
Bengt Jonsson and
|
||
Martin Leucker and
|
||
Harald Raffelt and
|
||
Bernhard Steffen},
|
||
editor = {Maura Cerioli},
|
||
title = {On the Correspondence Between Conformance Testing and Regular Inference},
|
||
booktitle = {Fundamental Approaches to Software Engineering, 8th International
|
||
Conference, {FASE} 2005, Held as Part of the Joint European Conferences
|
||
on Theory and Practice of Software, {ETAPS} 2005, Edinburgh, UK, April
|
||
4-8, 2005, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {3442},
|
||
pages = {175--189},
|
||
publisher = {Springer},
|
||
year = {2005},
|
||
url = {https://doi.org/10.1007/978-3-540-31984-9\_14},
|
||
doi = {10.1007/978-3-540-31984-9\_14},
|
||
timestamp = {Tue, 26 Jun 2018 14:11:36 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/fase/BergGJLRS05},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BergJR06,
|
||
author = {Therese Berg and
|
||
Bengt Jonsson and
|
||
Harald Raffelt},
|
||
editor = {Luciano Baresi and
|
||
Reiko Heckel},
|
||
title = {Regular Inference for State Machines with Parameters},
|
||
booktitle = {Fundamental Approaches to Software Engineering, 9th International
|
||
Conference, {FASE} 2006, Held as Part of the Joint European Conferences
|
||
on Theory and Practice of Software, {ETAPS} 2006, Vienna, Austria,
|
||
March 27-28, 2006, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {3922},
|
||
pages = {107--121},
|
||
publisher = {Springer},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1007/11693017\_10},
|
||
doi = {10.1007/11693017\_10},
|
||
timestamp = {Tue, 26 Jun 2018 14:11:37 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/fase/BergJR06},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BergJR08,
|
||
author = {Therese Berg and
|
||
Bengt Jonsson and
|
||
Harald Raffelt},
|
||
editor = {Jos{\'{e}} Luiz Fiadeiro and
|
||
Paola Inverardi},
|
||
title = {Regular Inference for State Machines Using Domains with Equality Tests},
|
||
booktitle = {Fundamental Approaches to Software Engineering, 11th International
|
||
Conference, {FASE} 2008, Held as Part of the Joint European Conferences
|
||
on Theory and Practice of Software, {ETAPS} 2008, Budapest, Hungary,
|
||
March 29-April 6, 2008. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {4961},
|
||
pages = {317--331},
|
||
publisher = {Springer},
|
||
year = {2008},
|
||
url = {https://doi.org/10.1007/978-3-540-78743-3\_24},
|
||
doi = {10.1007/978-3-540-78743-3\_24},
|
||
timestamp = {Tue, 26 Jun 2018 14:11:38 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/fase/BergJR08},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{Bernhard94,
|
||
author = {Philip J. Bernhard},
|
||
title = {A Reduced Test Suite for Protocol Conformance Testing},
|
||
journal = {{ACM} Trans. Softw. Eng. Methodol.},
|
||
volume = {3},
|
||
number = {3},
|
||
pages = {201--220},
|
||
year = {1994},
|
||
url = {http://doi.acm.org/10.1145/196092.196088},
|
||
doi = {10.1145/196092.196088},
|
||
timestamp = {Fri, 09 Jun 2017 11:01:58 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/tosem/Bernhard94},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BojanczykL12,
|
||
author = {Miko{\l}aj Boja{\'{n}}czyk and
|
||
Slawomir Lasota},
|
||
editor = {Artur Czumaj and
|
||
Kurt Mehlhorn and
|
||
Andrew M. Pitts and
|
||
Roger Wattenhofer},
|
||
title = {A Machine-Independent Characterization of Timed Languages},
|
||
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
|
||
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {7392},
|
||
pages = {92--103},
|
||
publisher = {Springer},
|
||
year = {2012},
|
||
url = {https://doi.org/10.1007/978-3-642-31585-5\_12},
|
||
doi = {10.1007/978-3-642-31585-5\_12},
|
||
timestamp = {Sun, 04 Jun 2017 10:07:30 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/icalp/BojanczykL12},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BojanczykBKL12,
|
||
author = {Miko{\l}aj Boja{\'{n}}czyk and
|
||
Laurent Braud and
|
||
Bartek Klin and
|
||
Slawomir Lasota},
|
||
editor = {John Field and
|
||
Michael Hicks},
|
||
title = {Towards nominal computation},
|
||
booktitle = {Proceedings of the 39th {ACM} {SIGPLAN-SIGACT} Symposium on Principles
|
||
of Programming Languages, {POPL} 2012, Philadelphia, Pennsylvania,
|
||
USA, January 22-28, 2012},
|
||
pages = {401--412},
|
||
publisher = {{ACM}},
|
||
year = {2012},
|
||
url = {https://doi.org/10.1145/2103656.2103704},
|
||
doi = {10.1145/2103656.2103704},
|
||
timestamp = {Tue, 06 Nov 2018 11:07:43 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/popl/BojanczykBKL12},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{BojanczykKL14,
|
||
author = {Miko{\l}aj Boja{\'{n}}czyk and
|
||
Bartek Klin and
|
||
Slawomir Lasota},
|
||
title = {Automata theory in nominal sets},
|
||
journal = {Logical Methods in Computer Science},
|
||
volume = {10},
|
||
number = {3},
|
||
year = {2014},
|
||
url = {https://doi.org/10.2168/LMCS-10(3:4)2014},
|
||
doi = {10.2168/LMCS-10(3:4)2014},
|
||
timestamp = {Wed, 03 May 2017 14:47:56 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/corr/BojanczykKL14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{BolligHKL08,
|
||
author = {Benedikt Bollig and
|
||
Peter Habermehl and
|
||
Carsten Kern and
|
||
Martin Leucker},
|
||
title = {Angluin-Style Learning of {NFA}},
|
||
year = {2008},
|
||
note = {Research Report LSV-08-28, LSV, ENS Cachan},
|
||
url = {http://www.lsv.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-28.pdf}
|
||
}
|
||
|
||
@inproceedings{BolligHKL09,
|
||
author = {Benedikt Bollig and
|
||
Peter Habermehl and
|
||
Carsten Kern and
|
||
Martin Leucker},
|
||
editor = {Craig Boutilier},
|
||
title = {Angluin-Style Learning of {NFA}},
|
||
booktitle = {{IJCAI} 2009, Proceedings of the 21st International Joint Conference
|
||
on Artificial Intelligence, Pasadena, California, USA, July 11-17,
|
||
2009},
|
||
pages = {1004--1009},
|
||
year = {2009},
|
||
url = {http://ijcai.org/Proceedings/09/Papers/170.pdf},
|
||
timestamp = {Wed, 20 Jul 2016 14:20:40 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/ijcai/BolligHKL09},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BolligHLM13,
|
||
author = {Benedikt Bollig and
|
||
Peter Habermehl and
|
||
Martin Leucker and
|
||
Benjamin Monmege},
|
||
editor = {Marie{-}Pierre B{\'{e}}al and
|
||
Olivier Carton},
|
||
title = {A Fresh Approach to Learning Register Automata},
|
||
booktitle = {Developments in Language Theory - 17th International Conference, {DLT}
|
||
2013, Marne-la-Vall{\'{e}}e, France, June 18-21, 2013. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {7907},
|
||
pages = {118--130},
|
||
publisher = {Springer},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1007/978-3-642-38771-5\_12},
|
||
doi = {10.1007/978-3-642-38771-5\_12},
|
||
timestamp = {Fri, 26 May 2017 00:50:55 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/dlt/BolligHLM13},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BonchiP13,
|
||
author = {Filippo Bonchi and
|
||
Damien Pous},
|
||
editor = {Roberto Giacobazzi and
|
||
Radhia Cousot},
|
||
title = {Checking {NFA} equivalence with bisimulations up to congruence},
|
||
booktitle = {The 40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
|
||
Programming Languages, {POPL} '13, Rome, Italy - January 23 - 25, 2013},
|
||
pages = {457--468},
|
||
publisher = {{ACM}},
|
||
year = {2013},
|
||
url = {http://doi.acm.org/10.1145/2429069.2429124},
|
||
doi = {10.1145/2429069.2429124},
|
||
timestamp = {Thu, 15 Jun 2017 21:39:11 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/popl/BonchiP13},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{BonchiP15,
|
||
author = {Filippo Bonchi and
|
||
Damien Pous},
|
||
title = {Hacking nondeterminism with induction and coinduction},
|
||
journal = {Commun. {ACM}},
|
||
volume = {58},
|
||
number = {2},
|
||
pages = {87--95},
|
||
year = {2015},
|
||
url = {http://doi.acm.org/10.1145/2713167},
|
||
doi = {10.1145/2713167},
|
||
timestamp = {Wed, 14 Jun 2017 20:37:02 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/cacm/BonchiP15},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BosS18,
|
||
author = {Petra van den Bos and
|
||
Marielle Stoelinga},
|
||
editor = {Andrea Orlandini and
|
||
Martin Zimmermann},
|
||
title = {Tester versus Bug: {A} Generic Framework for Model-Based Testing via
|
||
Games},
|
||
booktitle = {Proceedings Ninth International Symposium on Games, Automata, Logics,
|
||
and Formal Verification, GandALF 2018, Saarbr{\"{u}}cken, Germany,
|
||
26-28th September 2018.},
|
||
publisher = {Open Publishing Association},
|
||
series = {{EPTCS}},
|
||
volume = {277},
|
||
pages = {118--132},
|
||
year = {2018},
|
||
url = {https://doi.org/10.4204/EPTCS.277.9},
|
||
doi = {10.4204/EPTCS.277.9},
|
||
timestamp = {Tue, 16 Oct 2018 10:05:10 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/corr/abs-1809-03098},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{BotincanB13,
|
||
author = {Matko Botincan and
|
||
Domagoj Babic},
|
||
editor = {Roberto Giacobazzi and
|
||
Radhia Cousot},
|
||
title = {Sigma*: symbolic learning of input-output specifications},
|
||
booktitle = {The 40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
|
||
Programming Languages, {POPL} '13, Rome, Italy - January 23 - 25,
|
||
2013},
|
||
pages = {443--456},
|
||
publisher = {{ACM}},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1145/2429069.2429123},
|
||
doi = {10.1145/2429069.2429123},
|
||
timestamp = {Tue, 06 Nov 2018 11:07:43 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/popl/BotincanB13},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{CameronST89,
|
||
title = {Chains of subgroups in symmetric groups},
|
||
author = {Peter J. Cameron and
|
||
Ron Solomon and
|
||
Alexandre Turull},
|
||
journal = {Journal of algebra},
|
||
volume = {127},
|
||
number = {2},
|
||
pages = {340--352},
|
||
year = {1989},
|
||
publisher = {Academic Press},
|
||
url = {https://doi.org/10.1016/0021-8693(89)90256-1},
|
||
doi = {10.1016/0021-8693(89)90256-1},
|
||
issn = {0021-8693}
|
||
}
|
||
|
||
@article{CasselHJMS15,
|
||
author = {Sofia Cassel and
|
||
Falk Howar and
|
||
Bengt Jonsson and
|
||
Maik Merten and
|
||
Bernhard Steffen},
|
||
title = {A succinct canonical register automaton model},
|
||
journal = {J. Log. Algebr. Meth. Program.},
|
||
volume = {84},
|
||
number = {1},
|
||
pages = {54--66},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1016/j.jlamp.2014.07.004},
|
||
doi = {10.1016/j.jlamp.2014.07.004},
|
||
timestamp = {Sun, 28 May 2017 13:17:34 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/jlp/CasselHJMS15},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@phdthesis{Cassel15,
|
||
title = {Learning Component Behavior from Tests: Theory and Algorithms for Automata with Data},
|
||
author = {Sofia Cassel},
|
||
year = {2015},
|
||
isbn = {978-91-554-9395-0},
|
||
issn = {1651-6214 ; 1311}
|
||
publisher = {Acta Universitatis Upsaliensis},
|
||
series = {Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology},
|
||
school = {Uppsala University, Sweden},
|
||
url = {http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-265369}
|
||
}
|
||
|
||
@article{CasselHJS16,
|
||
author = {Sofia Cassel and
|
||
Falk Howar and
|
||
Bengt Jonsson and
|
||
Bernhard Steffen},
|
||
title = {Active learning for extended finite state machines},
|
||
journal = {Formal Asp. Comput.},
|
||
volume = {28},
|
||
number = {2},
|
||
pages = {233--263},
|
||
year = {2016},
|
||
url = {https://doi.org/10.1007/s00165-016-0355-5},
|
||
doi = {10.1007/s00165-016-0355-5},
|
||
timestamp = {Wed, 17 May 2017 14:25:34 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/fac/CasselHJS16},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{ChaluparPPR14,
|
||
author = {Georg Chalupar and
|
||
Stefan Peherstorfer and
|
||
Erik Poll and
|
||
Joeri de Ruiter},
|
||
editor = {Sergey Bratus and
|
||
Felix "FX" Lindner},
|
||
title = {Automated Reverse Engineering using {Lego}®},
|
||
booktitle = {8th {USENIX} Workshop on Offensive Technologies, {WOOT} '14, San Diego,
|
||
CA, USA, August 19, 2014.},
|
||
publisher = {{USENIX} Association},
|
||
year = {2014},
|
||
url = {https://www.usenix.org/conference/woot14/workshop-program/presentation/chalupar},
|
||
timestamp = {Mon, 04 Dec 2017 17:32:55 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/woot/ChaluparPPR14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{ChanVO89,
|
||
author = {Wendy Y. L. Chan and
|
||
Son T. Vuong and
|
||
M. Robert Ito},
|
||
editor = {Lawrence H. Landweber},
|
||
title = {An Improved Protocol Test Generation Procedure Based on {UIO}s},
|
||
booktitle = {{SIGCOMM} '89, Proceedings of the {ACM} Symposium on Communications
|
||
Architectures {\&} Protocols, Austin, TX, USA, September 19-22, 1989},
|
||
publisher = {{ACM}},
|
||
pages = {283--294},
|
||
year = {1989},
|
||
url = {http://doi.acm.org/10.1145/75246.75274},
|
||
doi = {10.1145/75246.75274},
|
||
timestamp = {Mon, 25 Jan 2016 16:58:54 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/sigcomm/ChanVO89},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||
comment = {DBLP data was wrong}
|
||
}
|
||
|
||
@inproceedings{ChocSS10,
|
||
author = {Chia Yuan Cho and
|
||
Domagoj Babic and
|
||
Eui Chul Richard Shin and
|
||
Dawn Song},
|
||
editor = {Ehab Al{-}Shaer and
|
||
Angelos D. Keromytis and
|
||
Vitaly Shmatikov},
|
||
title = {Inference and analysis of formal models of botnet command and control
|
||
protocols},
|
||
booktitle = {Proceedings of the 17th {ACM} Conference on Computer and Communications
|
||
Security, {CCS} 2010, Chicago, Illinois, USA, October 4-8, 2010},
|
||
pages = {426--439},
|
||
publisher = {{ACM}},
|
||
year = {2010},
|
||
url = {https://doi.org/10.1145/1866307.1866355},
|
||
doi = {10.1145/1866307.1866355},
|
||
timestamp = {Tue, 06 Nov 2018 11:07:31 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/ccs/ChocSS10},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{Chow78,
|
||
author = {Tsun S. Chow},
|
||
title = {Testing Software Design Modeled by Finite-State Machines},
|
||
journal = {{IEEE} Trans. Software Eng.},
|
||
volume = {4},
|
||
number = {3},
|
||
pages = {178--187},
|
||
year = {1978},
|
||
url = {https://doi.org/10.1109/TSE.1978.231496},
|
||
doi = {10.1109/TSE.1978.231496},
|
||
timestamp = {Wed, 17 May 2017 10:56:34 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/tse/Chow78},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{CianciaKM10,
|
||
author = {Vincenzo Ciancia and
|
||
Alexander Kurz and
|
||
Ugo Montanari},
|
||
title = {Families of Symmetries as Efficient Models of Resource Binding},
|
||
journal = {Electr. Notes Theor. Comput. Sci.},
|
||
volume = {264},
|
||
number = {2},
|
||
pages = {63--81},
|
||
year = {2010},
|
||
url = {https://doi.org/10.1016/j.entcs.2010.07.014},
|
||
doi = {10.1016/j.entcs.2010.07.014},
|
||
timestamp = {Mon, 05 Jun 2017 20:49:18 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/entcs/CianciaKM10},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{CianciaM10,
|
||
author = {Vincenzo Ciancia and
|
||
Ugo Montanari},
|
||
title = {Symmetries, local names and dynamic (de)-allocation of names},
|
||
journal = {Inf. Comput.},
|
||
volume = {208},
|
||
number = {12},
|
||
pages = {1349--1367},
|
||
year = {2010},
|
||
url = {https://doi.org/10.1016/j.ic.2009.10.007},
|
||
doi = {10.1016/j.ic.2009.10.007},
|
||
timestamp = {Tue, 06 Jun 2017 22:27:43 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/iandc/CianciaM10},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Clouston13,
|
||
author = {Ranald Clouston},
|
||
title = {Generalised Name Abstraction for Nominal Sets},
|
||
booktitle = {Foundations of Software Science and Computation Structures - 16th
|
||
International Conference, {FOSSACS} 2013. Proceedings},
|
||
pages = {434--449},
|
||
year = {2013},
|
||
crossref = {DBLP:conf/fossacs/2013},
|
||
url = {https://doi.org/10.1007/978-3-642-37075-5\_28},
|
||
doi = {10.1007/978-3-642-37075-5\_28},
|
||
timestamp = {Tue, 26 Jun 2018 14:10:47 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/fossacs/Clouston13},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{DavidMY02,
|
||
author = {Alexandre David and
|
||
M. Oliver M{\"{o}}ller and
|
||
Wang Yi},
|
||
editor = {Ralf-Detlef Kutsche and
|
||
Herbert Weber},
|
||
title = {Formal Verification of {UML} Statecharts with Real-Time Extensions},
|
||
booktitle = {Fundamental Approaches to Software Engineering, 5th International
|
||
Conference, {FASE} 2002, held as Part of the Joint European Conferences
|
||
on Theory and Practice of Software, {ETAPS} 2002, Grenoble, France,
|
||
April 8-12, 2002, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {2306},
|
||
pages = {218--232},
|
||
publisher = {Springer},
|
||
year = {2002},
|
||
url = {https://doi.org/10.1007/3-540-45923-5\_15},
|
||
doi = {10.1007/3-540-45923-5\_15},
|
||
timestamp = {Fri, 26 May 2017 14:09:14 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/fase/DavidMY02},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{DemriL09,
|
||
author = {St{\'{e}}phane Demri and
|
||
Ranko Lazic},
|
||
title = {{LTL} with the freeze quantifier and register automata},
|
||
journal = {{ACM} Trans. Comput. Log.},
|
||
volume = {10},
|
||
number = {3},
|
||
pages = {16:1--16:30},
|
||
year = {2009},
|
||
url = {http://doi.acm.org/10.1145/1507244.1507246},
|
||
doi = {10.1145/1507244.1507246},
|
||
timestamp = {Mon, 09 Jan 2017 14:08:26 +0100},
|
||
biburl = {https://dblp.org/rec/bib/journals/tocl/DemriL09},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{DenisLT02,
|
||
author = {Fran{\c{c}}ois Denis and
|
||
Aur{\'{e}}lien Lemay and
|
||
Alain Terlutte},
|
||
title = {Residual Finite State Automata},
|
||
journal = {Fundam. Inform.},
|
||
volume = {51},
|
||
number = {4},
|
||
pages = {339--368},
|
||
year = {2002},
|
||
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi51-4-02},
|
||
timestamp = {Mon, 18 May 2015 17:23:18 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/fuin/DenisLT02},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{DrewsD17,
|
||
author = {Samuel Drews and
|
||
Loris D'Antoni},
|
||
editor = {Axel Legay and
|
||
Tiziana Margaria},
|
||
title = {Learning Symbolic Automata},
|
||
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
|
||
- 23rd International Conference, {TACAS} 2017, Held as Part of the
|
||
European Joint Conferences on Theory and Practice of Software, {ETAPS}
|
||
2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part {I}},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {10205},
|
||
pages = {173--189},
|
||
year = {2017},
|
||
url = {https://doi.org/10.1007/978-3-662-54577-5\_10},
|
||
doi = {10.1007/978-3-662-54577-5\_10},
|
||
timestamp = {Wed, 24 May 2017 08:28:32 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/tacas/DrewsD17},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{DorofeevaEY05,
|
||
author = {Rita Dorofeeva and
|
||
Khaled El{-}Fakih and
|
||
Nina Yevtushenko},
|
||
editor = {Farn Wang},
|
||
title = {An Improved Conformance Testing Method},
|
||
booktitle = {Formal Techniques for Networked and Distributed Systems - {FORTE}
|
||
2005, 25th {IFIP} {WG} 6.1 International Conference, Taipei, Taiwan,
|
||
October 2-5, 2005, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {3731},
|
||
pages = {204--218},
|
||
publisher = {Springer},
|
||
year = {2005},
|
||
url = {https://doi.org/10.1007/11562436\_16},
|
||
doi = {10.1007/11562436\_16},
|
||
timestamp = {Tue, 26 Jun 2018 14:10:59 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/forte/DorofeevaEY05},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{DorofeevaEMCY10,
|
||
author = {Rita Dorofeeva and
|
||
Khaled El{-}Fakih and
|
||
St{\'{e}}phane Maag and
|
||
Ana R. Cavalli and
|
||
Nina Yevtushenko},
|
||
title = {{FSM}-based conformance testing methods: {A} survey annotated with experimental evaluation},
|
||
journal = {Information {\&} Software Technology},
|
||
volume = {52},
|
||
number = {12},
|
||
pages = {1286--1297},
|
||
year = {2010},
|
||
url = {https://doi.org/10.1016/j.infsof.2010.07.001},
|
||
doi = {10.1016/j.infsof.2010.07.001},
|
||
timestamp = {Wed, 17 May 2017 10:55:34 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/infsof/DorofeevaEMCY10},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{EmersonS96,
|
||
author = {E. Allen Emerson and
|
||
A. Prasad Sistla},
|
||
title = {Symmetry and Model Checking},
|
||
journal = {Formal Methods in System Design},
|
||
volume = {9},
|
||
number = {1/2},
|
||
pages = {105--131},
|
||
year = {1996},
|
||
url = {https://doi.org/10.1007/BF00625970},
|
||
doi = {10.1007/BF00625970},
|
||
timestamp = {Sat, 27 May 2017 14:24:05 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/fmsd/EmersonS96},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{EndoS13,
|
||
author = {Andr{\'{e}} Takeshi Endo and
|
||
Adenilso da Silva Sim{\~{a}}o},
|
||
title = {Evaluating test suite characteristics, cost, and effectiveness of
|
||
{FSM}-based testing methods},
|
||
journal = {Information {\&} Software Technology},
|
||
volume = {55},
|
||
number = {6},
|
||
pages = {1045--1062},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1016/j.infsof.2013.01.001},
|
||
doi = {10.1016/j.infsof.2013.01.001},
|
||
timestamp = {Wed, 17 May 2017 10:55:34 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/infsof/EndoS13},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{EshuisJW02,
|
||
author = {Rik Eshuis and
|
||
David N. Jansen and
|
||
Roel Wieringa},
|
||
title = {Requirements-Level Semantics and Model Checking of Object-Oriented Statecharts},
|
||
journal = {Requir. Eng.},
|
||
volume = {7},
|
||
number = {4},
|
||
pages = {243--263},
|
||
year = {2002},
|
||
url = {https://doi.org/10.1007/s007660200019},
|
||
doi = {10.1007/s007660200019},
|
||
timestamp = {Sat, 20 May 2017 00:26:07 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/re/EshuisJW02},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{FerrariMT05,
|
||
author = {Gian Luigi Ferrari and
|
||
Ugo Montanari and
|
||
Emilio Tuosto},
|
||
title = {Coalgebraic minimization of {HD}-automata for the $\pi$-calculus using
|
||
polymorphic types},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {331},
|
||
number = {2-3},
|
||
pages = {325--365},
|
||
year = {2005},
|
||
url = {https://doi.org/10.1016/j.tcs.2004.09.021},
|
||
doi = {10.1016/j.tcs.2004.09.021},
|
||
timestamp = {Thu, 08 Jun 2017 09:02:47 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/tcs/FerrariMT05},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Fiterau-BrosteanJV14,
|
||
author = {Paul Fiterau{-}Brostean and
|
||
Ramon Janssen and
|
||
Frits W. Vaandrager},
|
||
editor = {Fr{\'{e}}d{\'{e}}ric Lang and
|
||
Francesco Flammini},
|
||
title = {Learning Fragments of the {TCP} Network Protocol},
|
||
booktitle = {Formal Methods for Industrial Critical Systems - 19th International
|
||
Conference, {FMICS} 2014, Florence, Italy, September 11-12, 2014.
|
||
Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {8718},
|
||
pages = {78--93},
|
||
publisher = {Springer},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1007/978-3-319-10702-8\_6},
|
||
doi = {10.1007/978-3-319-10702-8\_6},
|
||
timestamp = {Sat, 16 Sep 2017 12:12:00 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/fmics/Fiterau-BrosteanJV14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Fiterau-Brostean16,
|
||
author = {Paul Fiterau{-}Brostean and
|
||
Ramon Janssen and
|
||
Frits W. Vaandrager},
|
||
editor = {Swarat Chaudhuri and
|
||
Azadeh Farzan},
|
||
title = {Combining Model Learning and Model Checking to Analyze {TCP} Implementations},
|
||
booktitle = {Computer Aided Verification - 28th International Conference, {CAV}
|
||
2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part {II}},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {9780},
|
||
pages = {454--471},
|
||
publisher = {Springer},
|
||
year = {2016},
|
||
url = {https://doi.org/10.1007/978-3-319-41540-6\_25},
|
||
doi = {10.1007/978-3-319-41540-6\_25},
|
||
timestamp = {Thu, 25 May 2017 00:39:07 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/cav/Fiterau-Brostean16},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Fiterau-BrosteanH17,
|
||
author = {Paul Fiterau{-}Brostean and
|
||
Falk Howar},
|
||
editor = {Laure Petrucci and
|
||
Cristina Seceleanu and
|
||
Ana Cavalcanti},
|
||
title = {Learning-Based Testing the Sliding Window Behavior of {TCP} Implementations},
|
||
booktitle = {Critical Systems: Formal Methods and Automated Verification - Joint
|
||
22nd International Workshop on Formal Methods for Industrial Critical
|
||
Systems - and - 17th International Workshop on Automated Verification
|
||
of Critical Systems, FMICS-AVoCS 2017, Turin, Italy, September 18-20,
|
||
2017, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {10471},
|
||
pages = {185--200},
|
||
publisher = {Springer},
|
||
year = {2017},
|
||
url = {https://doi.org/10.1007/978-3-319-67113-0\_12},
|
||
doi = {10.1007/978-3-319-67113-0\_12},
|
||
timestamp = {Tue, 05 Sep 2017 14:29:34 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/fmics/Fiterau-Brostean17},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Fiterau-BrosteanLPRVV17,
|
||
author = {Paul Fiterau{-}Brostean and
|
||
Toon Lenaerts and
|
||
Erik Poll and
|
||
Joeri de Ruiter and
|
||
Frits W. Vaandrager and
|
||
Patrick Verleg},
|
||
editor = {Hakan Erdogmus and
|
||
Klaus Havelund},
|
||
title = {Model learning and model checking of {SSH} implementations},
|
||
booktitle = {Proceedings of the 24th {ACM} {SIGSOFT} International {SPIN} Symposium
|
||
on Model Checking of Software, Santa Barbara, CA, USA, July 10-14,
|
||
2017},
|
||
pages = {142--151},
|
||
publisher = {{ACM}},
|
||
year = {2017},
|
||
url = {https://doi.org/10.1145/3092282.3092289},
|
||
doi = {10.1145/3092282.3092289},
|
||
timestamp = {Tue, 06 Nov 2018 11:06:50 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/spin/Fiterau-Brostean17},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@phdthesis{Fiterau-Brostean18,
|
||
title = {Active Model Learning for the Analysis of Network Protocols},
|
||
author = {Paul Fiterau{-}Brostean},
|
||
year = {2018},
|
||
isbn = {978-94-028-0963-3}
|
||
publisher = {[Sl: sn]},
|
||
series = {IPA dissertation series; 2018-04},
|
||
school = {Radboud University, Nijmegen, The Netherlands},
|
||
url = {http://hdl.handle.net/2066/187331}
|
||
}
|
||
|
||
@article{FujiwaraBKAG91,
|
||
author = {Susumu Fujiwara and
|
||
Gregor von Bochmann and
|
||
Ferhat Khendek and
|
||
Mokhtar Amalou and
|
||
Abderrazak Ghedamsi},
|
||
title = {Test Selection Based on Finite State Models},
|
||
journal = {{IEEE} Trans. Software Eng.},
|
||
volume = {17},
|
||
number = {6},
|
||
pages = {591--603},
|
||
year = {1991},
|
||
url = {https://doi.org/10.1109/32.87284},
|
||
doi = {10.1109/32.87284},
|
||
timestamp = {Wed, 17 May 2017 10:56:36 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/tse/FujiwaraBKAG91},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{GabbayP02,
|
||
author = {Murdoch Gabbay and
|
||
Andrew M. Pitts},
|
||
title = {A New Approach to Abstract Syntax with Variable Binding},
|
||
journal = {Formal Asp. Comput.},
|
||
volume = {13},
|
||
number = {3-5},
|
||
pages = {341--363},
|
||
year = {2002},
|
||
url = {https://doi.org/10.1007/s001650200016},
|
||
doi = {10.1007/s001650200016},
|
||
timestamp = {Tue, 06 Jun 2017 22:21:37 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/fac/GabbayP02},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{GaravelLMS11,
|
||
author = {Hubert Garavel and
|
||
Fr{\'{e}}d{\'{e}}ric Lang and
|
||
Radu Mateescu and
|
||
Wendelin Serwe},
|
||
editor = {Parosh Aziz Abdulla and
|
||
K. Rustan M. Leino},
|
||
title = {{CADP} 2010: {A} Toolbox for the Construction and Analysis of Distributed
|
||
Processes},
|
||
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
|
||
- 17th International Conference, {TACAS} 2011, Held as Part of the
|
||
Joint European Conferences on Theory and Practice of Software, {ETAPS}
|
||
2011, Saarbr{\"{u}}cken, Germany, March 26-April 3, 2011. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {6605},
|
||
pages = {372--387},
|
||
publisher = {Springer},
|
||
year = {2011},
|
||
url = {https://doi.org/10.1007/978-3-642-19835-9\_33},
|
||
doi = {10.1007/978-3-642-19835-9\_33},
|
||
timestamp = {Tue, 26 Jun 2018 14:11:56 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/tacas/GaravelLMS11},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@book{Gill62,
|
||
author = {Arthur Gill},
|
||
publisher = {McGraw-Hill},
|
||
title = {Introduction to the theory of finite-state machines},
|
||
year = {1962},
|
||
isbn = {978-0070232433}
|
||
}
|
||
|
||
@inproceedings{GraafD07,
|
||
author = {Bas Graaf and
|
||
Arie van Deursen},
|
||
editor = {Jo{\~{a}}o M. Fernandes and
|
||
Ricardo Jorge Machado and
|
||
Ridha Kh{\'{e}}dri and
|
||
Siobh{\'{a}}n Clarke},
|
||
title = {Model-Driven Consistency Checking of Behavioural Specifications},
|
||
booktitle = {Model-based Methodologies for Pervasive and Embedded Software, 4th
|
||
International Workshop on Model-based Methodologies for Pervasive and
|
||
Embedded Software, {MOMPES} 2007, Braga, Portugal, March 31, 2007, Proceedings},
|
||
pages = {115--126},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2007},
|
||
url = {https://doi.org/10.1109/MOMPES.2007.12},
|
||
doi = {10.1109/MOMPES.2007.12},
|
||
timestamp = {Thu, 15 Jun 2017 21:44:48 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/mompes/GraafD07},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{Gries73,
|
||
author = {David Gries},
|
||
title = {Describing an Algorithm by {Hopcroft}},
|
||
journal = {Acta Inf.},
|
||
volume = {2},
|
||
pages = {97--109},
|
||
year = {1973},
|
||
timestamp = {Wed, 29 Mar 2017 16:45:28 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/acta/Gries73},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{GrigoreT16,
|
||
author = {Radu Grigore and
|
||
Nikos Tzevelekos},
|
||
title = {History-Register Automata},
|
||
journal = {Logical Methods in Computer Science},
|
||
volume = {12},
|
||
number = {1},
|
||
year = {2016},
|
||
url = {https://doi.org/10.2168/LMCS-12(1:7)2016},
|
||
doi = {10.2168/LMCS-12(1:7)2016},
|
||
timestamp = {Mon, 13 Aug 2018 16:46:38 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/corr/abs-1209-0680},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{GrozLPS08,
|
||
author = {Roland Groz and
|
||
Keqin Li and
|
||
Alexandre Petrenko and
|
||
Muzammil Shahbaz},
|
||
editor = {Kenji Suzuki and
|
||
Teruo Higashino and
|
||
Andreas Ulrich and
|
||
Toru Hasegawa},
|
||
title = {Modular System Verification by Inference, Testing and Reachability
|
||
Analysis},
|
||
booktitle = {Testing of Software and Communicating Systems, 20th {IFIP} {TC} 6/WG
|
||
6.1 International Conference, TestCom 2008, 8th International Workshop,
|
||
{FATES} 2008, Tokyo, Japan, June 10-13, 2008, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {5047},
|
||
pages = {216--233},
|
||
publisher = {Springer},
|
||
year = {2008},
|
||
url = {https://doi.org/10.1007/978-3-540-68524-1\_16},
|
||
doi = {10.1007/978-3-540-68524-1\_16},
|
||
timestamp = {Tue, 26 Jun 2018 14:11:07 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/pts/GrozLPS08},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{GrozSPO16,
|
||
author = {Roland Groz and
|
||
Nicolas Bremond and
|
||
Adenilso da Silva Sim{\~{a}}o},
|
||
editor = {Olgierd Unold and
|
||
Witold Dyrka and
|
||
Wojciech Wieczorek},
|
||
title = {Inferring {FSM} Models of Systems Without Reset},
|
||
booktitle = {International Conference on Grammatical Inference, ICGI 2018},
|
||
pages = {30--43},
|
||
publisher = {Proceedings of Machine Learning Research},
|
||
year = {2018},
|
||
note = {Wachten op doi?}
|
||
}
|
||
|
||
@inproceedings{HansenKLMPS10,
|
||
author = {Helle Hvid Hansen and
|
||
Jeroen Ketema and
|
||
Bas Luttik and
|
||
Mohammad Reza Mousavi and
|
||
Jaco van de Pol and
|
||
Osmar Marchi dos Santos},
|
||
editor = {Bernhard K. Aichernig and
|
||
Frank S. de Boer and
|
||
Marcello M. Bonsangue},
|
||
title = {Automated Verification of Executable {UML} Models},
|
||
booktitle = {Formal Methods for Components and Objects - 9th International Symposium,
|
||
{FMCO} 2010, Graz, Austria, November 29 - December 1, 2010. Revised
|
||
Papers},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {6957},
|
||
pages = {225--250},
|
||
publisher = {Springer},
|
||
year = {2010},
|
||
url = {https://doi.org/10.1007/978-3-642-25271-6\_12},
|
||
doi = {10.1007/978-3-642-25271-6\_12},
|
||
timestamp = {Fri, 02 Jun 2017 20:50:15 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/fmco/HansenKLMPS10},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{HieronsT15,
|
||
author = {Robert M. Hierons and
|
||
Uraz Cengiz T{\"{u}}rker},
|
||
title = {Incomplete Distinguishing Sequences for Finite State Machines},
|
||
journal = {Comput. J.},
|
||
volume = {58},
|
||
number = {11},
|
||
pages = {3089--3113},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1093/comjnl/bxv041},
|
||
doi = {10.1093/comjnl/bxv041},
|
||
timestamp = {Sat, 20 May 2017 00:22:24 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/cj/HieronsT15},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@book{Higuera10,
|
||
author = {Colin de la Higuera},
|
||
publisher = {Cambridge University Press},
|
||
title = {Grammatical Inference: Learning Automata and Grammars},
|
||
year = {2010},
|
||
isbn = {9781139194655},
|
||
doi = {10.1017/CBO9781139194655},
|
||
url = {https://doi.org/10.1017/CBO9781139194655}
|
||
}
|
||
|
||
@inproceedings{Hopcroft71,
|
||
author = {John Edward Hopcroft},
|
||
booktitle = {Theory of Machines and Computations - Proceedings of an International
|
||
Symposium on the Theory of Machines and Computations Held at Technion
|
||
in Haifa, Israel, on August 16–19, 1971},
|
||
editor = {Zvi Kohavi and
|
||
Azaria Paz}
|
||
pages = {189--196},
|
||
title = {An $n \log n$ algorithm for minimizing states in a finite automaton},
|
||
year = {1971},
|
||
publisher = {Academic Press},
|
||
doi = {10.1016/B978-0-12-417750-5.50022-1},
|
||
url = {https://doi.org/10.1016/B978-0-12-417750-5.50022-1},
|
||
isbn = {978-0-12-417750-5}
|
||
}
|
||
|
||
@inproceedings{HowarSM11,
|
||
author = {Falk Howar and
|
||
Bernhard Steffen and
|
||
Maik Merten},
|
||
editor = {Ranjit Jhala and
|
||
David A. Schmidt},
|
||
title = {Automata Learning with Automated Alphabet Abstraction Refinement},
|
||
booktitle = {Verification, Model Checking, and Abstract Interpretation - 12th International
|
||
Conference, {VMCAI} 2011, Austin, TX, USA, January 23-25, 2011. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {6538},
|
||
pages = {263--277},
|
||
publisher = {Springer},
|
||
year = {2011},
|
||
url = {https://doi.org/10.1007/978-3-642-18275-4\_19},
|
||
doi = {10.1007/978-3-642-18275-4\_19},
|
||
timestamp = {Wed, 24 May 2017 08:30:31 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/vmcai/HowarSM11},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{HowarSJC12,
|
||
author = {Falk Howar and
|
||
Bernhard Steffen and
|
||
Bengt Jonsson and
|
||
Sofia Cassel},
|
||
editor = {Viktor Kuncak and
|
||
Andrey Rybalchenko},
|
||
title = {Inferring Canonical Register Automata},
|
||
booktitle = {Verification, Model Checking, and Abstract Interpretation - 13th International
|
||
Conference, {VMCAI} 2012, Philadelphia, PA, USA, January 22-24, 2012.
|
||
Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {7148},
|
||
pages = {251--266},
|
||
publisher = {Springer},
|
||
year = {2012},
|
||
url = {https://doi.org/10.1007/978-3-642-27940-9\_17},
|
||
doi = {10.1007/978-3-642-27940-9\_17},
|
||
timestamp = {Wed, 24 May 2017 08:30:31 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/vmcai/HowarSJC12},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{HungarNS03,
|
||
author = {Hardi Hungar and
|
||
Oliver Niese and
|
||
Bernhard Steffen},
|
||
editor = {Warren A. Hunt Jr. and
|
||
Fabio Somenzi},
|
||
title = {Domain-Specific Optimization in Automata Learning},
|
||
booktitle = {Computer Aided Verification, 15th International Conference, {CAV}
|
||
2003, Boulder, CO, USA, July 8-12, 2003, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {2725},
|
||
pages = {315--327},
|
||
publisher = {Springer},
|
||
year = {2003},
|
||
url = {https://doi.org/10.1007/978-3-540-45069-6\_31},
|
||
doi = {10.1007/978-3-540-45069-6\_31},
|
||
timestamp = {Mon, 29 May 2017 16:53:43 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/cav/HungarNS03},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{IpD96,
|
||
author = {C. Norris Ip and
|
||
David L. Dill},
|
||
title = {Better Verification Through Symmetry},
|
||
journal = {Formal Methods in System Design},
|
||
volume = {9},
|
||
number = {1/2},
|
||
pages = {41--75},
|
||
year = {1996},
|
||
url = {https://doi.org/10.1007/BF00625968},
|
||
doi = {10.1007/BF00625968},
|
||
timestamp = {Sat, 27 May 2017 14:24:05 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/fmsd/IpD96},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{IsbernerHS13,
|
||
author = {Malte Isberner and
|
||
Falk Howar and
|
||
Bernhard Steffen},
|
||
editor = {Guillaume Brat and
|
||
Neha Rungta and
|
||
Arnaud Venet},
|
||
title = {Inferring Automata with State-Local Alphabet Abstractions},
|
||
booktitle = {{NASA} Formal Methods, 5th International Symposium, {NFM} 2013, Moffett
|
||
Field, CA, USA, May 14-16, 2013. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {7871},
|
||
pages = {124--138},
|
||
publisher = {Springer},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1007/978-3-642-38088-4\_9},
|
||
doi = {10.1007/978-3-642-38088-4\_9},
|
||
timestamp = {Mon, 05 Jun 2017 12:39:01 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/nfm/IsbernerHS13},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{IsbernerHS14,
|
||
author = {Malte Isberner and
|
||
Falk Howar and
|
||
Bernhard Steffen},
|
||
title = {Learning register automata: from languages to program structures},
|
||
journal = {Machine Learning},
|
||
volume = {96},
|
||
number = {1-2},
|
||
pages = {65--98},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1007/s10994-013-5419-7},
|
||
doi = {10.1007/s10994-013-5419-7},
|
||
timestamp = {Tue, 26 Jun 2018 14:09:24 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/ml/IsbernerHS14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@phdthesis{Isberner15,
|
||
title = {Foundations of Active Automata Learning: An Algorithmic Perspective},
|
||
author = {Malte Isberner},
|
||
year = {2015},
|
||
month = {October},
|
||
school = {Technical University of Dortmund, Germany},
|
||
url = {https://eldorado.tu-dortmund.de/bitstream/2003/34282/1/Dissertation.pdf}
|
||
}
|
||
|
||
@inproceedings{JacobsS14a,
|
||
author = {Bart Jacobs and
|
||
Alexandra Silva},
|
||
editor = {Franck van Breugel and
|
||
Elham Kashefi and
|
||
Catuscia Palamidessi and
|
||
Jan Rutten},
|
||
title = {Automata Learning: {A} Categorical Perspective},
|
||
booktitle = {Horizons of the Mind. {A} Tribute to Prakash Panangaden - Essays Dedicated
|
||
to Prakash Panangaden on the Occasion of His 60th Birthday},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {8464},
|
||
pages = {384--406},
|
||
publisher = {Springer},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1007/978-3-319-06880-0\_20},
|
||
doi = {10.1007/978-3-319-06880-0\_20},
|
||
timestamp = {Tue, 23 May 2017 01:06:47 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/birthday/JacobsS14a},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{KaminskiF94,
|
||
author = {Michael Kaminski and
|
||
Nissim Francez},
|
||
title = {Finite-Memory Automata},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {134},
|
||
number = {2},
|
||
pages = {329--363},
|
||
year = {1994},
|
||
url = {https://doi.org/10.1016/0304-3975(94)90242-9},
|
||
doi = {10.1016/0304-3975(94)90242-9},
|
||
timestamp = {Sun, 28 May 2017 13:20:09 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/tcs/KaminskiF94},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@book{KearnsV94,
|
||
author = {Michael J. Kearns and
|
||
Umesh V. Vazirani},
|
||
title = {An Introduction to Computational Learning Theory},
|
||
publisher = {{MIT} Press},
|
||
year = {1994},
|
||
url = {https://mitpress.mit.edu/books/introduction-computational-learning-theory},
|
||
isbn = {978-0-262-11193-5},
|
||
timestamp = {Wed, 10 May 2017 15:11:16 +0200},
|
||
biburl = {https://dblp.org/rec/bib/books/daglib/0041035},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{KlinS16,
|
||
author = {Bartek Klin and
|
||
Michal Szynwelski},
|
||
editor = {Robert Atkey and
|
||
Neelakantan R. Krishnaswami},
|
||
title = {{SMT} Solving for Functional Programming over Infinite Structures},
|
||
booktitle = {Proceedings 6th Workshop on Mathematically Structured Functional Programming,
|
||
MSFP@ETAPS 2016, Eindhoven, Netherlands, 8th April 2016.},
|
||
series = {{EPTCS}},
|
||
volume = {207},
|
||
pages = {57--75},
|
||
year = {2016},
|
||
url = {https://doi.org/10.4204/EPTCS.207.3},
|
||
doi = {10.4204/EPTCS.207.3},
|
||
timestamp = {Wed, 12 Sep 2018 01:05:15 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/corr/KlinS16},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{Knuutila01,
|
||
author = {Timo Knuutila},
|
||
title = {Re-describing an algorithm by Hopcroft},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {250},
|
||
number = {1-2},
|
||
pages = {333--363},
|
||
year = {2001},
|
||
url = {https://doi.org/10.1016/S0304-3975(99)00150-4},
|
||
doi = {10.1016/S0304-3975(99)00150-4},
|
||
timestamp = {Wed, 14 Jun 2017 20:32:10 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/tcs/Knuutila01},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{KopczynskiT16,
|
||
author = {Eryk Kopczynski and
|
||
Szymon Toru{\'{n}}czyk},
|
||
editor = {Tim King and
|
||
Ruzica Piskac},
|
||
title = {{LOIS:} an Application of {SMT} Solvers},
|
||
booktitle = {Proceedings of the 14th International Workshop on Satisfiability Modulo
|
||
Theories affiliated with the International Joint Conference on Automated
|
||
Reasoning, SMT@IJCAR 2016, Coimbra, Portugal, July 1-2, 2016.},
|
||
series = {{CEUR} Workshop Proceedings},
|
||
volume = {1617},
|
||
pages = {51--60},
|
||
publisher = {CEUR-WS.org},
|
||
year = {2016},
|
||
url = {http://ceur-ws.org/Vol-1617/paper5.pdf},
|
||
timestamp = {Mon, 18 Jul 2016 14:39:46 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/cade/KopczynskiT16},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{KopczynskiT17,
|
||
author = {Eryk Kopczynski and
|
||
Szymon Toru{\'{n}}czyk},
|
||
editor = {Giuseppe Castagna and
|
||
Andrew D. Gordon},
|
||
title = {{LOIS:} syntax and semantics},
|
||
booktitle = {Proceedings of the 44th {ACM} {SIGPLAN} Symposium on Principles of
|
||
Programming Languages, {POPL} 2017, Paris, France, January 18-20,
|
||
2017},
|
||
pages = {586--598},
|
||
publisher = {{ACM}},
|
||
year = {2017},
|
||
url = {http://dl.acm.org/citation.cfm?id=3009876},
|
||
timestamp = {Tue, 06 Nov 2018 11:07:42 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/popl/KopczynskiT17},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{KozenMP015,
|
||
author = {Dexter Kozen and
|
||
Konstantinos Mamouras and
|
||
Daniela Petrisan and
|
||
Alexandra Silva},
|
||
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
|
||
Kazuo Iwama and
|
||
Naoki Kobayashi and
|
||
Bettina Speckmann},
|
||
title = {Nominal {K}leene Coalgebra},
|
||
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
|
||
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {9135},
|
||
pages = {286--298},
|
||
publisher = {Springer},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1007/978-3-662-47666-6\_23},
|
||
doi = {10.1007/978-3-662-47666-6\_23},
|
||
timestamp = {Fri, 02 Nov 2018 09:50:27 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/icalp/KozenMP015},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{KrennSA09,
|
||
author = {Willibald Krenn and
|
||
Rupert Schlick and
|
||
Bernhard K. Aichernig},
|
||
editor = {Frank S. de Boer and
|
||
Marcello M. Bonsangue and
|
||
Stefan Hallerstede and
|
||
Michael Leuschel},
|
||
title = {Mapping {UML} to Labeled Transition Systems for Test-Case Generation
|
||
- {A} Translation via Object-Oriented Action Systems},
|
||
booktitle = {Formal Methods for Components and Objects - 8th International Symposium,
|
||
{FMCO} 2009, Eindhoven, The Netherlands, November 4-6, 2009. Revised
|
||
Selected Papers},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {6286},
|
||
pages = {186--207},
|
||
publisher = {Springer},
|
||
year = {2009},
|
||
url = {https://doi.org/10.1007/978-3-642-17071-3\_10},
|
||
doi = {10.1007/978-3-642-17071-3\_10},
|
||
timestamp = {Fri, 02 Jun 2017 20:50:15 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/fmco/KrennSA09},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{LanusseTEMGTSDT09,
|
||
title = {Papyrus {UML}: an open source toolset for {MDA}},
|
||
author = {Agnes Lanusse and
|
||
Yann Tanguy and
|
||
Huascar Espinoza and
|
||
Chokri Mraidha and
|
||
Sebastien Gerard and
|
||
Patrick Tessier and
|
||
Remi Schnekenburger and
|
||
Hubert Dubois and
|
||
Fran{\c{c}}ois Terrier},
|
||
editor = {Regis Vogel}
|
||
booktitle = {Proc. of the Fifth European Conference on Model-Driven Architecture Foundations and Applications (ECMDA-FA 2009)},
|
||
pages = {1--4},
|
||
year = {2009},
|
||
publisher = {CTIT},
|
||
series = {CTIT Proceedings Series WP09-12}
|
||
}
|
||
|
||
@article{LeeY94,
|
||
author = {David Lee and
|
||
Mihalis Yannakakis},
|
||
title = {Testing Finite-State Machines: State Identification and Verification},
|
||
journal = {{IEEE} Trans. Computers},
|
||
volume = {43},
|
||
number = {3},
|
||
pages = {306--320},
|
||
year = {1994},
|
||
url = {https://doi.org/10.1109/12.272431},
|
||
doi = {10.1109/12.272431},
|
||
timestamp = {Sat, 20 May 2017 00:24:37 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/tc/LeeY94},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Leucker06,
|
||
author = {Martin Leucker},
|
||
editor = {Frank S. de Boer and
|
||
Marcello M. Bonsangue and
|
||
Susanne Graf and
|
||
Willem P. de Roever},
|
||
title = {Learning Meets Verification},
|
||
booktitle = {Formal Methods for Components and Objects, 5th International Symposium,
|
||
{FMCO} 2006, Amsterdam, The Netherlands, November 7-10, 2006, Revised
|
||
Lectures},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {4709},
|
||
pages = {127--151},
|
||
publisher = {Springer},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1007/978-3-540-74792-5\_6},
|
||
doi = {10.1007/978-3-540-74792-5\_6},
|
||
timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/fmco/Leucker06},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{LiGS06,
|
||
author = {Keqin Li and
|
||
Roland Groz and
|
||
Muzammil Shahbaz},
|
||
editor = {Elie Najm and
|
||
Jean-Fran{\c{c}}ois Pradat-Peyre and
|
||
V{\'{e}}ronique Donzeau-Gouge},
|
||
title = {Integration Testing of Distributed Components Based on Learning Parameterized
|
||
{I/O} Models},
|
||
booktitle = {Formal Techniques for Networked and Distributed Systems - {FORTE}
|
||
2006, 26th {IFIP} {WG} 6.1 International Conference, Paris, France,
|
||
September 26-29, 2006.},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {4229},
|
||
pages = {436--450},
|
||
publisher = {Springer},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1007/11888116\_31},
|
||
doi = {10.1007/11888116\_31},
|
||
timestamp = {Tue, 26 Jun 2018 14:10:58 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/forte/LiGS06},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{LuoPB95,
|
||
author = {Gang Luo and
|
||
Alexandre Petrenko and
|
||
Gregor v. Bochmann},
|
||
title = {Selecting test sequences for partially-specified nondeterministic finite state machines},
|
||
booktitle = {Protocol Test Systems. IFIP — The International Federation for Information Processing},
|
||
year = {1995},
|
||
pages = {95--110},
|
||
publisher = {Springer},
|
||
editors = {Tadanori Mizuno and
|
||
Teruo Higashino and
|
||
Norio Shiratori},
|
||
url = {https://doi.org/10.1007/978-0-387-34883-4\_6},
|
||
doi = {10.1007/978-0-387-34883-4\_6},
|
||
isbn = {978-0-387-34883-4}
|
||
}
|
||
|
||
@article{MalerP95,
|
||
author = {Oded Maler and
|
||
Amir Pnueli},
|
||
title = {On the Learnability of Infinitary Regular Sets},
|
||
journal = {Inf. Comput.},
|
||
volume = {118},
|
||
number = {2},
|
||
pages = {316--326},
|
||
year = {1995},
|
||
url = {https://doi.org/10.1006/inco.1995.1070},
|
||
doi = {10.1006/inco.1995.1070},
|
||
timestamp = {Thu, 18 May 2017 09:54:20 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/iandc/MalerP95},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{MalerM17,
|
||
author = {Oded Maler and
|
||
Irini-Eleftheria Mens},
|
||
editor = {Luca Aceto and
|
||
Giorgio Bacci and
|
||
Giovanni Bacci and
|
||
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
|
||
Axel Legay and
|
||
Radu Mardare},
|
||
title = {A Generic Algorithm for Learning Symbolic Automata from Membership
|
||
Queries},
|
||
booktitle = {Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand
|
||
Larsen on the Occasion of His 60th Birthday},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {10460},
|
||
pages = {146--169},
|
||
publisher = {Springer},
|
||
year = {2017},
|
||
url = {https://doi.org/10.1007/978-3-319-63121-9\_8},
|
||
doi = {10.1007/978-3-319-63121-9\_8},
|
||
timestamp = {Tue, 22 Aug 2017 08:17:15 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/birthday/MalerM17},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@phdthesis{Mens17,
|
||
author = {Irini-Eleftheria Mens},
|
||
title = {Learning regular languages over large alphabets},
|
||
title:fr = {Apprentissage de langages r{\'{e}}guliers sur des alphabets de grandes tailles}
|
||
school = {Grenoble Alpes University, France},
|
||
year = {2017},
|
||
url = {https://tel.archives-ouvertes.fr/tel-01792635},
|
||
timestamp = {Thu, 21 Jun 2018 09:51:17 +0200},
|
||
biburl = {https://dblp.org/rec/bib/phd/hal/Mens17},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{MertenSHM11,
|
||
author = {Maik Merten and
|
||
Bernhard Steffen and
|
||
Falk Howar and
|
||
Tiziana Margaria},
|
||
editor = {Parosh Aziz Abdulla and
|
||
K. Rustan M. Leino},
|
||
title = {Next Generation {LearnLib}},
|
||
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
|
||
- 17th International Conference, {TACAS} 2011, Held as Part of the
|
||
Joint European Conferences on Theory and Practice of Software, {ETAPS}
|
||
2011, Saarbr{\"{u}}cken, Germany, March 26-April 3, 2011. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {6605},
|
||
pages = {220--223},
|
||
publisher = {Springer},
|
||
year = {2011},
|
||
url = {https://doi.org/10.1007/978-3-642-19835-9\_18},
|
||
doi = {10.1007/978-3-642-19835-9\_18},
|
||
timestamp = {Tue, 26 Jun 2018 14:11:57 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/tacas/MertenSHM11},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{MertenHSCJ12,
|
||
author = {Maik Merten and
|
||
Falk Howar and
|
||
Bernhard Steffen and
|
||
Sofia Cassel and
|
||
Bengt Jonsson},
|
||
editor = {Cormac Flanagan and
|
||
Barbara K{\"{o}}nig},
|
||
title = {Demonstrating Learning of Register Automata},
|
||
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
|
||
- 18th International Conference, {TACAS} 2012, Held as Part of the
|
||
European Joint Conferences on Theory and Practice of Software, {ETAPS}
|
||
2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {7214},
|
||
pages = {466--471},
|
||
publisher = {Springer},
|
||
year = {2012},
|
||
url = {https://doi.org/10.1007/978-3-642-28756-5\_32},
|
||
doi = {10.1007/978-3-642-28756-5\_32},
|
||
timestamp = {Tue, 26 Jun 2018 14:11:56 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/tacas/MertenHSCJ12},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{MontanariP97,
|
||
author = {Ugo Montanari and
|
||
Marco Pistore},
|
||
title = {An Introduction to History Dependent Automata},
|
||
journal = {Electr. Notes Theor. Comput. Sci.},
|
||
volume = {10},
|
||
pages = {170--188},
|
||
year = {1997},
|
||
url = {https://doi.org/10.1016/S1571-0661(05)80696-6},
|
||
doi = {10.1016/S1571-0661(05)80696-6},
|
||
timestamp = {Sun, 28 May 2017 13:22:55 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/entcs/MontanariP97},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{MontanariS14,
|
||
author = {Ugo Montanari and
|
||
Matteo Sammartino},
|
||
title = {A network-conscious {\(\pi\)}-calculus and its coalgebraic semantics},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {546},
|
||
pages = {188--224},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1016/j.tcs.2014.03.009},
|
||
doi = {10.1016/j.tcs.2014.03.009},
|
||
timestamp = {Thu, 08 Jun 2017 09:02:39 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/tcs/MontanariS14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Moore56,
|
||
author = {Edward F. Moore},
|
||
title = {Gedanken–experiments on Sequential Machines},
|
||
booktitle = {Sequential Machines, Automata Studies, Annals of Mathematical Studies, no.34},
|
||
year = {1956},
|
||
pages = {129--153},
|
||
publisher = {Princeton University Press}
|
||
}
|
||
|
||
@inproceedings{MouraB08,
|
||
author = {Leonardo Mendon{\c{c}}a de Moura and
|
||
Nikolaj Bj{\o}rner},
|
||
editor = {C. R. Ramakrishnan and
|
||
Jakob Rehof},
|
||
title = {{Z3:} An Efficient {SMT} Solver},
|
||
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems,
|
||
14th International Conference, {TACAS} 2008, Held as Part of the Joint
|
||
European Conferences on Theory and Practice of Software, {ETAPS} 2008,
|
||
Budapest, Hungary, March 29-April 6, 2008. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {4963},
|
||
pages = {337--340},
|
||
publisher = {Springer},
|
||
year = {2008},
|
||
url = {https://doi.org/10.1007/978-3-540-78800-3\_24},
|
||
doi = {10.1007/978-3-540-78800-3\_24},
|
||
timestamp = {Tue, 26 Jun 2018 14:11:58 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/tacas/MouraB08},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{MurawskiRT15,
|
||
author = {Andrzej S. Murawski and
|
||
Steven J. Ramsay and
|
||
Nikos Tzevelekos},
|
||
title = {Bisimilarity in Fresh-Register Automata},
|
||
booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
|
||
2015, Kyoto, Japan, July 6-10, 2015},
|
||
pages = {156--167},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1109/LICS.2015.24},
|
||
doi = {10.1109/LICS.2015.24},
|
||
timestamp = {Thu, 25 May 2017 00:42:41 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/lics/MurawskiRT15},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{MurawskiRT18,
|
||
author = {Andrzej S. Murawski and
|
||
Steven J. Ramsay and
|
||
Nikos Tzevelekos},
|
||
editor = {Igor Potapov and
|
||
Paul G. Spirakis and
|
||
James Worrell},
|
||
title = {Polynomial-Time Equivalence Testing for Deterministic Fresh-Register
|
||
Automata},
|
||
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
|
||
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
|
||
series = {LIPIcs},
|
||
volume = {117},
|
||
pages = {72:1--72:14},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
|
||
year = {2018},
|
||
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.72},
|
||
doi = {10.4230/LIPIcs.MFCS.2018.72},
|
||
timestamp = {Tue, 28 Aug 2018 15:28:12 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/mfcs/MurawskiRT18},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@phdthesis{Niese2003,
|
||
author = {Oliver Niese},
|
||
title = {An integrated approach to testing complex systems},
|
||
school = {Technical University of Dortmund, Germany},
|
||
year = {2003},
|
||
url = {http://eldorado.uni-dortmund.de:8080/0x81d98002\_0x0007b62b},
|
||
urn = {urn:nbn:de:101:1-201103292278},
|
||
timestamp = {Wed, 07 Dec 2016 14:16:48 +0100},
|
||
biburl = {https://dblp.org/rec/bib/phd/de/Niese2003},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{PeledVY02,
|
||
author = {Doron A. Peled and
|
||
Moshe Y. Vardi and
|
||
Mihalis Yannakakis},
|
||
title = {Black Box Checking},
|
||
journal = {Journal of Automata, Languages and Combinatorics},
|
||
volume = {7},
|
||
number = {2},
|
||
pages = {225--246},
|
||
year = {2002},
|
||
timestamp = {Fri, 12 Feb 2016 07:36:50 +0100},
|
||
biburl = {https://dblp.org/rec/bib/journals/jalc/PeledVY02},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{PetrenkoYLD93,
|
||
author = {Alexandre Petrenko and
|
||
Nina Yevtushenko and
|
||
Alexandre Lebedev and
|
||
Anindya Das},
|
||
editor = {Omar Rafiq},
|
||
title = {Nondeterministic State Machines in Protocol Conformance Testing},
|
||
booktitle = {Protocol Test Systems, VI, Proceedings of the {IFIP} {TC6/WG6.1} Sixth
|
||
International Workshop on Protocol Test systems, Pau, France, 28-30
|
||
September, 1993},
|
||
series = {{IFIP} Transactions},
|
||
volume = {{C-19}},
|
||
pages = {363--378},
|
||
publisher = {North-Holland},
|
||
year = {1993},
|
||
timestamp = {Thu, 17 Oct 2002 11:13:42 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/pts/PetrenkoYLD93},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{Petrenko97,
|
||
author = {Alexandre Petrenko},
|
||
title = {Technical Correspondence Comments on "A Reduced Test Suite for Protocol
|
||
Conformance Testing"},
|
||
journal = {{ACM} Trans. Softw. Eng. Methodol.},
|
||
volume = {6},
|
||
number = {3},
|
||
pages = {329--331},
|
||
year = {1997},
|
||
url = {http://doi.acm.org/10.1145/258077.265733},
|
||
doi = {10.1145/258077.265733},
|
||
timestamp = {Wed, 26 Nov 2003 14:30:28 +0100},
|
||
biburl = {https://dblp.org/rec/bib/journals/tosem/Petrenko97},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Petrenko0GHO14,
|
||
author = {Alexandre Petrenko and
|
||
Keqin Li and
|
||
Roland Groz and
|
||
Karim Hossen and
|
||
Catherine Oriat},
|
||
title = {Inferring Approximated Models for Systems Engineering},
|
||
booktitle = {15th International {IEEE} Symposium on High-Assurance Systems Engineering,
|
||
{HASE} 2014, Miami Beach, FL, USA, January 9-11, 2014},
|
||
pages = {249--253},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1109/HASE.2014.46},
|
||
doi = {10.1109/HASE.2014.46},
|
||
timestamp = {Thu, 25 May 2017 00:41:35 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/hase/Petrenko0GHO14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{PetrenkoY14,
|
||
author = {Alexandre Petrenko and
|
||
Nina Yevtushenko},
|
||
title = {Adaptive Testing of Nondeterministic Systems with {FSM}},
|
||
booktitle = {15th International {IEEE} Symposium on High-Assurance Systems Engineering,
|
||
{HASE} 2014, Miami Beach, FL, USA, January 9-11, 2014},
|
||
pages = {224--228},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1109/HASE.2014.39},
|
||
doi = {10.1109/HASE.2014.39},
|
||
timestamp = {Thu, 25 May 2017 00:41:35 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/hase/PetrenkoY14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@book{Pitts13,
|
||
author={Andrew M. Pitts},
|
||
editor={Samson Abramsky and
|
||
Peter Aczel and
|
||
Yuri Gurevich and
|
||
John Tucker},
|
||
publisher={Cambridge University Press},
|
||
series={Cambridge Tracts in Theoretical Computer Science},
|
||
title={Nominal sets: Names and symmetry in computer science},
|
||
year={2013}
|
||
}
|
||
|
||
@inproceedings{Pitts14,
|
||
author = {Andrew M. Pitts},
|
||
editor = {Hugo Herbelin and
|
||
Pierre Letouzey and
|
||
Matthieu Sozeau},
|
||
title = {Nominal Presentation of Cubical Sets Models of Type Theory},
|
||
booktitle = {20th International Conference on Types for Proofs and Programs, {TYPES}
|
||
2014, May 12-15, 2014, Paris, France},
|
||
series = {LIPIcs},
|
||
volume = {39},
|
||
pages = {202--220},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
|
||
year = {2014},
|
||
url = {https://doi.org/10.4230/LIPIcs.TYPES.2014.202},
|
||
doi = {10.4230/LIPIcs.TYPES.2014.202},
|
||
timestamp = {Thu, 23 Aug 2018 15:56:39 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/types/Pitts14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{Pitts16,
|
||
author = {Andrew M. Pitts},
|
||
title = {Nominal techniques},
|
||
journal = {{SIGLOG} News},
|
||
volume = {3},
|
||
number = {1},
|
||
pages = {57--72},
|
||
year = {2016},
|
||
url = {http://doi.acm.org/10.1145/2893582.2893594},
|
||
doi = {10.1145/2893582.2893594},
|
||
timestamp = {Mon, 18 Jul 2016 11:41:35 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/siglog/Pitts16},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@thesis{Ploeger05,
|
||
title = {Analysis of concurrent state machines in embedded copier software},
|
||
author = {Bas Ploeger},
|
||
year = {2005},
|
||
school = {Master's thesis, Eindhoven University of Technology}
|
||
}
|
||
|
||
@article{RaffeltMSM09,
|
||
author = {Harald Raffelt and
|
||
Maik Merten and
|
||
Bernhard Steffen and
|
||
Tiziana Margaria},
|
||
title = {Dynamic testing via automata learning},
|
||
journal = {{STTT}},
|
||
volume = {11},
|
||
number = {4},
|
||
pages = {307--324},
|
||
year = {2009},
|
||
url = {https://doi.org/10.1007/s10009-009-0120-7},
|
||
doi = {10.1007/s10009-009-0120-7},
|
||
timestamp = {Thu, 18 May 2017 09:53:11 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/sttt/RaffeltMSM09},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{RaffeltSBM09,
|
||
author = {Harald Raffelt and
|
||
Bernhard Steffen and
|
||
Therese Berg and
|
||
Tiziana Margaria},
|
||
title = {{LearnLib}: a framework for extrapolating behavioral models},
|
||
journal = {{STTT}},
|
||
volume = {11},
|
||
number = {5},
|
||
pages = {393--407},
|
||
year = {2009},
|
||
url = {https://doi.org/10.1007/s10009-009-0111-8},
|
||
doi = {10.1007/s10009-009-0111-8},
|
||
timestamp = {Thu, 18 May 2017 09:53:11 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/sttt/RaffeltSBM09},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{RivestS93,
|
||
author = {Ronald L. Rivest and
|
||
Robert E. Schapire},
|
||
title = {Inference of Finite Automata Using Homing Sequences},
|
||
journal = {Inf. Comput.},
|
||
volume = {103},
|
||
number = {2},
|
||
pages = {299--347},
|
||
year = {1993},
|
||
url = {https://doi.org/10.1006/inco.1993.1021},
|
||
doi = {10.1006/inco.1993.1021},
|
||
timestamp = {Thu, 18 May 2017 09:54:18 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/iandc/RivestS93},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@phdthesis{Rot17,
|
||
author = {Jurriaan C. Rot},
|
||
title = {Enhanced Coinduction},
|
||
school = {Leiden University, the Netherlands},
|
||
publisher = {Faculty of Science, Leiden University},
|
||
series = {IPA Dissertation series; 2015-18},
|
||
isbn = {9789462991743},
|
||
year = {2015},
|
||
url = {http://hdl.handle.net/1887/35814}
|
||
}
|
||
|
||
@inproceedings{RuiterP15,
|
||
author = {Joeri de Ruiter and
|
||
Erik Poll},
|
||
editor = {Jaeyeon Jung and
|
||
Thorsten Holz},
|
||
title = {Protocol State Fuzzing of {TLS} Implementations},
|
||
booktitle = {24th {USENIX} Security Symposium, {USENIX} Security 15, Washington,
|
||
D.C., USA, August 12-14, 2015.},
|
||
pages = {193--206},
|
||
publisher = {{USENIX} Association},
|
||
year = {2015},
|
||
url = {https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/de-ruiter},
|
||
timestamp = {Fri, 19 Aug 2016 15:38:04 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/uss/RuiterP15},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Rutten98,
|
||
author = {Jan J. M. M. Rutten},
|
||
editor = {Davide Sangiorgi and
|
||
Robert de Simone},
|
||
title = {Automata and Coinduction (An Exercise in Coalgebra)},
|
||
booktitle = {{CONCUR} '98: Concurrency Theory, 9th International Conference, Nice,
|
||
France, September 8-11, 1998, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {1466},
|
||
pages = {194--218},
|
||
publisher = {Springer},
|
||
year = {1998},
|
||
url = {https://doi.org/10.1007/BFb0055624},
|
||
doi = {10.1007/BFb0055624},
|
||
timestamp = {Tue, 23 May 2017 11:53:59 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/concur/Rutten98},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{SabnaniD88,
|
||
author = {Krishan K. Sabnani and
|
||
Anton T. Dahbura},
|
||
title = {A Protocol Test Generation Procedure},
|
||
journal = {Computer Networks},
|
||
volume = {15},
|
||
pages = {285--297},
|
||
year = {1988},
|
||
url = {https://doi.org/10.1016/0169-7552(88)90064-5},
|
||
doi = {10.1016/0169-7552(88)90064-5},
|
||
timestamp = {Thu, 18 May 2017 09:50:57 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/cn/SabnaniD88},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Sakamoto97,
|
||
author = {Hiroshi Sakamoto},
|
||
editor = {Ming Li and
|
||
Akira Maruoka},
|
||
title = {Learning Simple Deterministic Finite-Memory Automata},
|
||
booktitle = {Algorithmic Learning Theory, 8th International Conference, {ALT} '97,
|
||
Sendai, Japan, October 6-8, 1997, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {1316},
|
||
pages = {416--431},
|
||
publisher = {Springer},
|
||
year = {1997},
|
||
url = {https://doi.org/10.1007/3-540-63577-7\_58},
|
||
doi = {10.1007/3-540-63577-7\_58},
|
||
timestamp = {Tue, 23 May 2017 11:53:57 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/alt/Sakamoto97},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{SchutsHV16,
|
||
author = {Mathijs Schuts and
|
||
Jozef Hooman and
|
||
Frits W. Vaandrager},
|
||
editor = {Erika {\'{A}}brah{\'{a}}m and
|
||
Marieke Huisman},
|
||
title = {Refactoring of Legacy Software Using Model Learning and Equivalence
|
||
Checking: {A}n Industrial Experience Report},
|
||
booktitle = {Integrated Formal Methods - 12th International Conference, {IFM} 2016,
|
||
Reykjavik, Iceland, June 1-5, 2016, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {9681},
|
||
pages = {311--325},
|
||
publisher = {Springer},
|
||
year = {2016},
|
||
url = {https://doi.org/10.1007/978-3-319-33693-0\_20},
|
||
doi = {10.1007/978-3-319-33693-0\_20},
|
||
timestamp = {Wed, 24 May 2017 08:28:10 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/ifm/SchutsHV16},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{Segoufin06,
|
||
author = {Luc Segoufin},
|
||
editor = {Zolt{\'{a}}n {\'{E}}sik},
|
||
title = {Automata and Logics for Words and Trees over an Infinite Alphabet},
|
||
booktitle = {Computer Science Logic, 20th International Workshop, {CSL} 2006, 15th
|
||
Annual Conference of the EACSL, Szeged, Hungary, September 25-29,
|
||
2006, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {4207},
|
||
pages = {41--57},
|
||
publisher = {Springer},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1007/11874683\_3},
|
||
doi = {10.1007/11874683\_3},
|
||
timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/csl/Segoufin06},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@book{SelicGW94,
|
||
author = {Bran Selic and
|
||
Garth Gullekson and
|
||
Paul T. Ward},
|
||
title = {Real-time object-oriented modeling},
|
||
series = {Wiley professional computing},
|
||
publisher = {Wiley},
|
||
year = {1994},
|
||
isbn = {978-0-471-59917-3},
|
||
timestamp = {Fri, 29 Apr 2011 18:24:07 +0200},
|
||
biburl = {https://dblp.org/rec/bib/books/daglib/0078907},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{SimaoPY09,
|
||
author = {Adenilso da Silva Sim{\~{a}}o and
|
||
Alexandre Petrenko and
|
||
Nina Yevtushenko},
|
||
editor = {Manuel N{\'{u}}{\~{n}}ez and
|
||
Paul Baker and
|
||
Mercedes G. Merayo},
|
||
title = {Generating Reduced Tests for {FSMs} with Extra States},
|
||
booktitle = {Testing of Software and Communication Systems, 21st {IFIP} {WG} 6.1
|
||
International Conference, {TESTCOM} 2009 and 9th International Workshop,
|
||
{FATES} 2009, Eindhoven, The Netherlands, November 2-4, 2009. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {5826},
|
||
pages = {129--145},
|
||
publisher = {Springer},
|
||
year = {2009},
|
||
url = {https://doi.org/10.1007/978-3-642-05031-2\_9},
|
||
doi = {10.1007/978-3-642-05031-2\_9},
|
||
timestamp = {Tue, 26 Jun 2018 14:11:07 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/pts/SimaoPY09},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{SimaoP10,
|
||
author = {Adenilso da Silva Sim{\~{a}}o and
|
||
Alexandre Petrenko},
|
||
title = {Fault Coverage-Driven Incremental Test Generation},
|
||
journal = {Comput. J.},
|
||
volume = {53},
|
||
number = {9},
|
||
pages = {1508--1522},
|
||
year = {2010},
|
||
url = {https://doi.org/10.1093/comjnl/bxp073},
|
||
doi = {10.1093/comjnl/bxp073},
|
||
timestamp = {Sat, 20 May 2017 00:22:27 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/cj/SimaoP10},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{SimaoP14,
|
||
author = {Adenilso da Silva Sim{\~{a}}o and
|
||
Alexandre Petrenko},
|
||
editor = {Holger Schlingloff and
|
||
Alexander K. Petrenko},
|
||
title = {Generating Complete and Finite Test Suite for ioco: {Is} It Possible?},
|
||
booktitle = {Proceedings Ninth Workshop on Model-Based Testing, {MBT} 2014, Grenoble,
|
||
France, 6 April 2014.},
|
||
series = {{EPTCS}},
|
||
volume = {141},
|
||
pages = {56--70},
|
||
year = {2014},
|
||
url = {https://doi.org/10.4204/EPTCS.141.5},
|
||
doi = {10.4204/EPTCS.141.5},
|
||
timestamp = {Wed, 12 Sep 2018 01:05:14 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/corr/SimaoP14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@techreport{ShinwellP05,
|
||
title = {Fresh objective {Caml} user manual},
|
||
author = {Mark R. Shinwell and
|
||
Andrew M. Pitts},
|
||
year = {2005},
|
||
month = {feb},
|
||
institution = {University of Cambridge, Computer Laboratory},
|
||
url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-621.pdf},
|
||
number = {UCAM-CL-TR-621},
|
||
issn = {1476-2986}
|
||
}
|
||
|
||
@article{Shinwell06,
|
||
author = {Mark R. Shinwell},
|
||
title = {Fresh {O'Caml}: Nominal Abstract Syntax for the Masses},
|
||
journal = {Electr. Notes Theor. Comput. Sci.},
|
||
volume = {148},
|
||
number = {2},
|
||
pages = {53--77},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1016/j.entcs.2005.11.040},
|
||
doi = {10.1016/j.entcs.2005.11.040},
|
||
timestamp = {Sun, 28 May 2017 13:22:58 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/entcs/Shinwell06},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{SmetsersVVV14,
|
||
author = {Rick Smetsers and
|
||
Michele Volpato and
|
||
Frits W. Vaandrager and
|
||
Sicco Verwer},
|
||
editor = {Alexander Clark and
|
||
Makoto Kanazawa and
|
||
Ryo Yoshinaka},
|
||
title = {Bigger is Not Always Better: on the Quality of Hypotheses in Active
|
||
Automata Learning},
|
||
booktitle = {Proceedings of the 12th International Conference on Grammatical Inference,
|
||
{ICGI} 2014, Kyoto, Japan, September 17-19, 2014.},
|
||
series = {{JMLR} Workshop and Conference Proceedings},
|
||
volume = {34},
|
||
pages = {167--181},
|
||
publisher = {JMLR.org},
|
||
year = {2014},
|
||
url = {http://jmlr.org/proceedings/papers/v34/smetsers14a.html},
|
||
timestamp = {Wed, 29 Mar 2017 16:45:26 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/icgi/SmetsersVVV14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{SteffenHM11,
|
||
author = {Bernhard Steffen and
|
||
Falk Howar and
|
||
Maik Merten},
|
||
editor = {Marco Bernardo and
|
||
Val{\'{e}}rie Issarny},
|
||
title = {Introduction to Active Automata Learning from a Practical Perspective},
|
||
booktitle = {Formal Methods for Eternal Networked Software Systems - 11th International
|
||
School on Formal Methods for the Design of Computer, Communication
|
||
and Software Systems, {SFM} 2011, Bertinoro, Italy, June 13-18, 2011.
|
||
Advanced Lectures},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {6659},
|
||
pages = {256--296},
|
||
publisher = {Springer},
|
||
year = {2011},
|
||
url = {https://doi.org/10.1007/978-3-642-21455-4\_8},
|
||
doi = {10.1007/978-3-642-21455-4\_8},
|
||
timestamp = {Wed, 25 Jul 2018 16:50:31 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/sfm/SteffenHM11},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{TapplerAB17,
|
||
author = {Martin Tappler and
|
||
Bernhard K. Aichernig and
|
||
Roderick Bloem},
|
||
title = {Model-Based Testing IoT Communication via Active Automata Learning},
|
||
booktitle = {2017 {IEEE} International Conference on Software Testing, Verification
|
||
and Validation, {ICST} 2017, Tokyo, Japan, March 13-17, 2017},
|
||
pages = {276--287},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2017},
|
||
url = {https://doi.org/10.1109/ICST.2017.32},
|
||
doi = {10.1109/ICST.2017.32},
|
||
timestamp = {Fri, 02 Nov 2018 09:43:57 +0100},
|
||
biburl = {https://dblp.org/rec/bib/conf/icst/TapplerAB17},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{TurkerY14,
|
||
author = {Uraz Cengiz T{\"{u}}rker and
|
||
H{\"{u}}sn{\"{u}} Yenig{\"{u}}n},
|
||
title = {Hardness and inapproximability of minimizing adaptive distinguishing sequences},
|
||
journal = {Formal Methods in System Design},
|
||
volume = {44},
|
||
number = {3},
|
||
pages = {264--294},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1007/s10703-014-0205-0},
|
||
doi = {10.1007/s10703-014-0205-0},
|
||
timestamp = {Sat, 27 May 2017 14:24:05 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/fmsd/TurkerY14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{UrbanT05,
|
||
author = {Christian Urban and
|
||
Christine Tasson},
|
||
editor = {Robert Nieuwenhuis},
|
||
title = {Nominal Techniques in {Isabelle}/{HOL}},
|
||
booktitle = {Automated Deduction - CADE-20, 20th International Conference on Automated
|
||
Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {3632},
|
||
pages = {38--53},
|
||
publisher = {Springer},
|
||
year = {2005},
|
||
url = {https://doi.org/10.1007/11532231\_4},
|
||
doi = {10.1007/11532231\_4},
|
||
timestamp = {Tue, 30 May 2017 16:36:52 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/cade/UrbanT05},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{Vaandrager17,
|
||
author = {Frits W. Vaandrager},
|
||
title = {Model learning},
|
||
journal = {Commun. {ACM}},
|
||
volume = {60},
|
||
number = {2},
|
||
pages = {86--95},
|
||
year = {2017},
|
||
url = {http://doi.acm.org/10.1145/2967606},
|
||
doi = {10.1145/2967606},
|
||
timestamp = {Mon, 06 Feb 2017 15:05:06 +0100},
|
||
biburl = {https://dblp.org/rec/bib/journals/cacm/Vaandrager17},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{ValmariL08,
|
||
author = {Antti Valmari and
|
||
Petri Lehtinen},
|
||
title = {Efficient Minimization of {DFA}s with Partial Transition Functions},
|
||
booktitle = {Symposium on Theoretical Aspects of Computer Science (STACS), Bordeaux, France, 2008},
|
||
pages = {645--656},
|
||
year = {2008},
|
||
url = {http://arxiv.org/abs/0802.2826},
|
||
archivePrefix = {arXiv},
|
||
eprint = {0802.2826},
|
||
timestamp = {Mon, 13 Aug 2018 16:47:46 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/corr/abs-0802-2826},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{Vasilevskii73,
|
||
author = {M.P. Vasilevskii},
|
||
title = {Failure diagnosis of automata},
|
||
journal = {Cybernetics and Systems Analysis},
|
||
volume = {9},
|
||
number = {4},
|
||
pages = {653--665},
|
||
year = {1973},
|
||
publisher = {Kluwer Academic Publishers - Plenum Publishers},
|
||
note = {Translated from Kibernetika, No. 4, pp. 98-108, July-August, 1973},
|
||
url = {https://doi.org/10.1007/BF01068590},
|
||
doi = {10.1007/BF01068590},
|
||
isbn = {1573-8337}
|
||
}
|
||
|
||
|
||
|
||
@book{Bojanczyk18,
|
||
author = {Miko{\l}aj Boja{\'{n}}czyk},
|
||
title = {Slightly Infinite Sets},
|
||
publisher = {Draft December 4, 2018},
|
||
year = {2018},
|
||
url = {https://www.mimuw.edu.pl/~bojan/upload/main-6.pdf}
|
||
}
|
||
|
||
|
||
@inproceedings{BojanczykKLT13,
|
||
author = {Miko{\l}aj Boja{\'{n}}czyk and
|
||
Bartek Klin and
|
||
Slawomir Lasota and
|
||
Szymon Toru{\'{n}}czyk},
|
||
title = {Turing Machines with Atoms},
|
||
booktitle = {28th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
|
||
2013, New Orleans, LA, USA, June 25-28, 2013},
|
||
pages = {183--192},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1109/LICS.2013.24},
|
||
doi = {10.1109/LICS.2013.24},
|
||
timestamp = {Thu, 25 May 2017 00:42:40 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/lics/BojanczykKLT13},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{GabbayP99,
|
||
author = {Murdoch Gabbay and
|
||
Andrew M. Pitts},
|
||
title = {A New Approach to Abstract Syntax Involving Binders},
|
||
booktitle = {14th Annual {IEEE} Symposium on Logic in Computer Science, Trento,
|
||
Italy, July 2-5, 1999},
|
||
pages = {214--224},
|
||
year = {1999},
|
||
url = {https://doi.org/10.1109/LICS.1999.782617},
|
||
doi = {10.1109/LICS.1999.782617},
|
||
timestamp = {Thu, 25 May 2017 00:42:40 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/lics/GabbayP99},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@techreport{Gabbay07,
|
||
author = {Murdoch James Gabbay},
|
||
title = {Nominal Renaming Sets},
|
||
note = {Heriot-Watt University},
|
||
year = {2007},
|
||
url = {https://www.gabbay.org/paper.html#nomrs-tr}
|
||
}
|
||
|
||
@inproceedings{GabbayH08,
|
||
author = {Murdoch James Gabbay and
|
||
Martin Hofmann},
|
||
title = {Nominal Renaming Sets},
|
||
booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning, 15th
|
||
International Conference, {LPAR} 2008. Proceedings},
|
||
pages = {158--173},
|
||
year = {2008},
|
||
url = {https://doi.org/10.1007/978-3-540-89439-1\_11},
|
||
doi = {10.1007/978-3-540-89439-1\_11},
|
||
timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/lpar/GabbayH08},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{OHearn03,
|
||
author = {Peter W. O'Hearn},
|
||
title = {On bunched typing},
|
||
journal = {J. Funct. Program.},
|
||
volume = {13},
|
||
number = {4},
|
||
pages = {747--796},
|
||
year = {2003},
|
||
url = {https://doi.org/10.1017/S0956796802004495},
|
||
doi = {10.1017/S0956796802004495},
|
||
timestamp = {Sat, 27 May 2017 14:24:34 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/jfp/OHearn03},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{HermidaJ98,
|
||
author = {Claudio Hermida and
|
||
Bart Jacobs},
|
||
title = {Structural Induction and Coinduction in a Fibrational Setting},
|
||
journal = {Inf. Comput.},
|
||
volume = {145},
|
||
number = {2},
|
||
pages = {107--152},
|
||
year = {1998},
|
||
url = {https://doi.org/10.1006/inco.1998.2725},
|
||
doi = {10.1006/inco.1998.2725},
|
||
timestamp = {Thu, 18 May 2017 09:54:19 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/iandc/HermidaJ98},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@book{jacobs-coalg,
|
||
author = {Bart Jacobs},
|
||
title = {Introduction to Coalgebra: Towards Mathematics of States and Observation},
|
||
series = {Cambridge Tracts in Theoretical Computer Science},
|
||
volume = {59},
|
||
publisher = {Cambridge University Press},
|
||
year = {2016},
|
||
url = {https://doi.org/10.1017/CBO9781316823187},
|
||
doi = {10.1017/CBO9781316823187},
|
||
isbn = {9781316823187},
|
||
timestamp = {Tue, 16 May 2017 14:01:42 +0200},
|
||
biburl = {https://dblp.org/rec/bib/books/cu/J2016},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{Rutten00,
|
||
author = {Jan J. M. M. Rutten},
|
||
title = {Universal coalgebra: a theory of systems},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {249},
|
||
number = {1},
|
||
pages = {3--80},
|
||
year = {2000},
|
||
url = {https://doi.org/10.1016/S0304-3975(00)00056-6},
|
||
doi = {10.1016/S0304-3975(00)00056-6},
|
||
timestamp = {Sun, 28 May 2017 13:20:01 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/tcs/Rutten00},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@article{JSS14,
|
||
author = {B. Jacobs and
|
||
A. Silva and
|
||
A. Sokolova},
|
||
title = {Trace semantics via determinization},
|
||
journal = {J. Comput. Syst. Sci.},
|
||
volume = {81},
|
||
number = {5},
|
||
pages = {859--879},
|
||
year = {2015}
|
||
}
|
||
|
||
@article{KlinR16,
|
||
author = {Bartek Klin and
|
||
Jurriaan Rot},
|
||
title = {Coalgebraic trace semantics via forgetful logics},
|
||
journal = {Logical Methods in Computer Science},
|
||
volume = {12},
|
||
number = {4},
|
||
year = {2016},
|
||
url = {https://doi.org/10.2168/LMCS-12(4:10)2016},
|
||
doi = {10.2168/LMCS-12(4:10)2016},
|
||
timestamp = {Mon, 13 Aug 2018 16:48:39 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/corr/KlinR16},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{KerstanKW14,
|
||
author = {Henning Kerstan and
|
||
Barbara K{\"{o}}nig and
|
||
Bram Westerbaan},
|
||
title = {Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions},
|
||
booktitle = {Coalgebraic Methods in Computer Science - 12th {IFIP} {WG} 1.3 International
|
||
Workshop, {CMCS} 2014, Colocated with {ETAPS} 2014, Grenoble, France,
|
||
April 5-6, 2014, Revised Selected Papers},
|
||
pages = {168--188},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1007/978-3-662-44124-4\_10},
|
||
doi = {10.1007/978-3-662-44124-4\_10},
|
||
timestamp = {Fri, 26 May 2017 00:50:45 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/cmcs/KerstanKW14},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@phdthesis{Staton07,
|
||
author = {Staton, Sam},
|
||
title = {{Name-passing process calculi: operational models and
|
||
structural operational semantics}},
|
||
year = 2007,
|
||
month = jun,
|
||
url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-688.pdf},
|
||
institution = {University of Cambridge, Computer Laboratory},
|
||
number = {UCAM-CL-TR-688}
|
||
}
|
||
|
||
@article{SilvaBBR13,
|
||
author = {Alexandra Silva and
|
||
Filippo Bonchi and
|
||
Marcello M. Bonsangue and
|
||
Jan J. M. M. Rutten},
|
||
title = {Generalizing determinization from automata to coalgebras},
|
||
journal = {Logical Methods in Computer Science},
|
||
volume = {9},
|
||
number = {1},
|
||
year = {2013},
|
||
url = {https://doi.org/10.2168/LMCS-9(1:9)2013},
|
||
doi = {10.2168/LMCS-9(1:9)2013},
|
||
timestamp = {Mon, 13 Aug 2018 16:47:28 +0200},
|
||
biburl = {https://dblp.org/rec/bib/journals/corr/abs-1302-1046},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@inproceedings{FioreT01,
|
||
author = {Marcelo P. Fiore and
|
||
Daniele Turi},
|
||
title = {Semantics of Name and Value Passing},
|
||
booktitle = {16th Annual {IEEE} Symposium on Logic in Computer Science, Boston,
|
||
Massachusetts, USA, June 16-19, 2001, Proceedings},
|
||
pages = {93--104},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2001},
|
||
url = {https://doi.org/10.1109/LICS.2001.932486},
|
||
doi = {10.1109/LICS.2001.932486},
|
||
timestamp = {Thu, 25 May 2017 00:42:40 +0200},
|
||
biburl = {https://dblp.org/rec/bib/conf/lics/FioreT01},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@book{AtiyahM69,
|
||
author = {Michael Francis Atiyah and
|
||
I. G. MacDonald},
|
||
title = {Introduction to commutative algebra},
|
||
publisher = {Addison-Wesley-Longman},
|
||
year = {1969},
|
||
isbn = {978-0-201-40751-8},
|
||
timestamp = {Fri, 29 Apr 2011 18:24:08 +0200},
|
||
biburl = {https://dblp.org/rec/bib/books/daglib/0091700},
|
||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||
}
|
||
|
||
@misc{Simmons,
|
||
author = {Harold Simmons},
|
||
title = {The topos of actions on a monoid},
|
||
url = {http://www.cs.man.ac.uk/~hsimmons/DOCUMENTS/PAPERSandNOTES/Rsets.pdf},
|
||
note = {Unpublished manuscript, number 12N}
|
||
} |