2019

1. 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany. Herman Geuvers, LIPIcs, 131, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019.
2. Formal Modeling and Analysis of Timed Systems - 17th International Conference, FORMATS 2019, Amsterdam, The Netherlands, August 27-29, 2019, Proceedings. \'Etienne André and Mariëlle Stoelinga, Lecture Notes in Computer Science, 11750, Springer, 2019, 10.1007/978-3-030-29662-9.
3. Alexis Linard, Colin de la Higuera and Frits W. Vaandrager. Learning Unions of k-Testable Languages. Language and Automata Theory and Applications - 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings, 328-339, 2019, 10.1007/978-3-030-13435-8\_24, Carlos Mart\'\in-Vide, Alexander Okhotin and Dana Shapira, Lecture Notes in Computer Science, 11417, Springer.
4. Alexis Linard, Doina Bucur and Mariëlle Stoelinga. Fault Trees from Data: Efficient Learning with an Evolutionary Algorithm. Dependable Software Engineering. Theories, Tools, and Applications - 5th International Symposium, SETTA 2019, Shanghai, China, November 27-29, 2019, Proceedings, 19-37, 2019, 10.1007/978-3-030-35540-1\_2.
5. Alexis Linard, Doina Bucur and Mariëlle Stoelinga. Fault Trees from Data: Efficient Learning with an Evolutionary Algorithm. CoRR, abs/1909.06258, 2019, 1909.06258.
6. Alexis Linard and Joost van Pinxten. An Application of Hyper-Heuristics to Flexible Manufacturing Systems. 22nd Euromicro Conference on Digital System Design, DSD 2019, Kallithea, Greece, August 28-30, 2019, 343-350, 2019, 10.1109/DSD.2019.00057.
7. B. Akesson, J. Hooman, J. Sleuters and A. Yankov. Reducing design time and promoting evolvability using Domain-Specific Languages in an industrial context. Model Management and Analytics for Large Scale Systems, 245-272, Academic Press, Elsevier, 2019, 10.
8. Bas Broere and Hans Zantema. The k-Dimensional Cube is k-Representable. Journal of Automata, Languages and Combinatorics, 24, 1, 3-12, 2019, 10.25596/jalc-2019-003.
9. Benedikt Ahrens, Dan Frumin, Marco Maggesi and Niels van der Weide. Bicategories in Univalent Foundations. 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019), 5:1-5:17, Leibniz International Proceedings in Informatics (LIPIcs), 2019, 131, Herman Geuvers, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 10.4230/LIPIcs.FSCD.2019.5, Keywords: bicategory theory, univalent mathematics, dependent type theory, Coq.
10. Erik Bischoff, Lonneke Boer, Maarten Van Der Heijden, Peter Lucas, Reinier Akkermans, Jan Vercoulen, Yvonne Heijdra, Pim Assendelft and Tjard Schermer. A smart mHealth tool versus a paper action plan to support self-management of COPD exacerbations: a randomised controlled trial. 2019, Eur Respiratory Soc.
11. P. van den Bos and J. Tretmans. Coverage-Based Testing with Symbolic Transition Systems. D. Beyer and C. Keller, Tests and Proofs - TAP 2019, Lecture Notes in Computer Science, 11823, 64-82, 2019, Springer Int.\ Publishing, http://dx.doi.org/10.1007/978-3-030-31157-5_5.
12. Marcos LP Bueno, Arjen Hommersom, Peter JF Lucas and Joost Janzing. A Data-Driven Exploration of Hypotheses on Disease Dynamics. Conference on Artificial Intelligence in Medicine in Europe, 170-179, 2019, Springer.
13. Marcos LP Bueno, Arjen Hommersom, Peter JF Lucas and Joost Janzing. A probabilistic framework for predicting disease dynamics: a case study of psychotic depression. Journal of biomedical informatics, 103232, 2019, Elsevier.
14. Carlos E. Budde, Marco Biagi, Raúl E. Monti, Pedro R. D'Argenio and Mariëlle Stoelinga. Rare Event Simulation for non-Markovian repairable Fault Trees. CoRR, abs/1910.11672, 2019, 1910.11672.
15. Carsten Fuhs and Cynthia Kop. A static higher-order dependency pair framework. Proc.\ European Symposium on Programming (ESOP), 2019, LNCS, 11423, 752-782, Springer.
16. Carsten Fuhs and Cynthia Kop. A static higher-order dependency pair framework. Proc.\ Workshop on Program Equivalence and Relational Reasoning (PERR), 2019, Informal proceedings.
17. Damien Pous and Jurriaan Rot. Companions, Causality and Codensity. Logical Methods in Computer Science, 15, 3, 2019.
18. Dan Frumin, Léon Gondelman and Robbert Krebbers. Semi-automated Reasoning About Non-determinism in C Expressions. Programming Languages and Systems - 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, 60-87, 2019, 10.1007/978-3-030-17184-1\_3.
19. Daniel Neider, Rick Smetsers, Frits W. Vaandrager and Harco Kuppens. Benchmarks for Automata Learning and Conformance Testing. Models, Mindsets, Meta: The What, the How, and the Why Not? - Essays Dedicated to Bernhard Steffen on the Occasion of His 60th Birthday, 390-416, 2019, 10.1007/978-3-030-22348-9\_23.
20. Daniil Frumin and Benno van den Berg. A homotopy-theoretic model of function extensionality in the effective topos. Mathematical Structures in Computer Science, 29, 4, 588-614, 2019, 10.1017/S0960129518000142.
21. Enno Ruijters, Daniël Reijsbergen, Pieter-Tjerk de Boer and Mariëlle Stoelinga. Rare event simulation for dynamic fault trees. Rel. Eng. & Sys. Safety, 186, 220-231, 2019, 10.1016/j.ress.2019.02.004.
22. F.W. Vaandrager. Automata Learning and Galois Connections (Invited Talk). 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece., 4:1-4:1, 2019, 10.4230/LIPIcs.ICALP.2019.4, C. Baier, I. Chatzigiannakis, P. Flocchini and S. Leonardi, LIPIcs, 132, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
23. Falk Howar, Bengt Jonsson and Frits W. Vaandrager. Combining Black-Box and White-Box Techniques for Learning Register Automata. Computing and Software Science - State of the Art and Perspectives, 563-588, 2019, 10.1007/978-3-319-91908-9\_26, Bernhard Steffen and Gerhard J. Woeginger, Lecture Notes in Computer Science, 10000, Springer.
24. Filippo Bonchi, Tom van Bussel, Matias David Lee and Jurriaan Rot. Bisimilarity of open terms in stream GSOS. Sci. Comput. Program., 172, 1-26, 2019.
25. Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Matteo Sammartino and Alexandra Silva. Tree Automata as Algebras: Minimisation and Determinisation. CALCO, LIPIcs, 139, 6:1-6:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
26. Hendrik Pieter Barendregt and Sebastiaan A. Terwijn. Partial combinatory algebra and generalized numberings. CoRR, abs/1910.07750, 2019, 1910.07750.
27. Henk Barendregt and Sebastiaan A. Terwijn. Fixed point theorems for precomplete numberings. Ann. Pure Appl. Logic, 170, 10, 1151-1161, 2019, 10.1016/j.apal.2019.04.013.
28. Henk Don and Hans Zantema. Counting Symbol Switches in Synchronizing Automata. Journal of Automata, Languages and Combinatorics, 24, 2-4, 253-286, 2019, 10.25596/jalc-2019-253.
29. Herman Geuvers, Iris van der Giessen and Tonny Hurkens. Strong Normalization for Truth Table Natural Deduction. Fundam. Inform., 170, 1-3, 139-176, 2019, 10.3233/FI-2019-1858.
30. Ilona Wilmont, Erik Barendsen and Stijn Hoppenbrouwers. A Case Study of Executive Functions in Real Process Modeling Sessions. Advanced Information Systems Engineering Workshops - CAiSE 2019 International Workshops, Rome, Italy, June 3-7, 2019, Proceedings, 17-28, 2019, 10.1007/978-3-030-20948-3\_2.
31. Jaime Arias, Carlos E. Budde, Wojciech Penczek, Laure Petrucci and Mariëlle Stoelinga. Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-Agent Systems. CoRR, abs/1906.05283, 2019, 1906.05283.
32. Jana Wagemaker, Marcello M. Bonsangue, Tobias Kappé, Jurriaan Rot and Alexandra Silva. Completeness and Incompleteness of Synchronous Kleene Algebra. MPC, Lecture Notes in Computer Science, 11825, 385-413, Springer, 2019.
33. Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann, Bernd Becker, Ralf Wimmer and Leonore Winterer. Correct-by-construction policies for POMDPs. Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT, 6-8, 2019, ACM.
34. R. Janssen and J. Tretmans. Matching Implementations to Specifications: The Corner Cases of \emphioco. ACM/SIGAPP Symp.\ on Applied Computing - Software Verification and Testing Track, SAC'19, 2019, 2196-2205, ACM, New York, NY, USA, http://doi.acm.org/10.1145/3297280.3297496.
35. R. Janssen, F. Vaandrager and J. Tretmans. Relating Alternating Relations for Conformance and Refinement. W. Ahrendt and S.L. Tapia Tarifa, Integrated Formal Methods - iFM 2019, Lecture Notes in Computer Science, 11918, 246-264, 2019, Springer Int.\ Publishing, https://doi.org/10.1007/978-3-030-34968-4_14.
36. Joost Visser, Alessandro Corbetta, Vlado Menkovski and Federico Toschi. Stampnet: Unsupervised Multi-Class Object Discovery. 2019 IEEE International Conference on Image Processing, ICIP 2019, Taipei, Taiwan, September 22-25, 2019, 2951-2955, 2019, 10.1109/ICIP.2019.8803767.
37. Jurriaan Rot. Distributive laws for monotone specifications. Acta Inf., 56, 7-8, 585-617, 2019.
38. Bas Lijnse. Robust Private Web Maps with Open Tools and Open Data. Proceedings of the 16th International Conference on Information Systems for Crisis Response And Management, ISCRAM '19, 2019, Z \ Francoand J. J. \ Gonzálezand J. H. Canós, Valencia, Spain, May.
39. Alexis Linard, Marcos LP Bueno, Doina Bucur and MIA Stoelinga. Induction of Fault Trees through Bayesian Networks. 2019, Singapore: Research Publishing.
40. Manxia Liu, Fabio Stella, Arjen Hommersom, Peter JF Lucas, Lonneke Boer and Erik Bischoff. A comparison between discrete and continuous time Bayesian networks in learning from clinical time series data with irregularity. Artificial intelligence in medicine, 95, 104-117, 2019, Elsevier.
41. M. Lubbers, P. Koopman and R. Plasmeijer. Multitasking on Microcontrollers using Task Oriented Programming. Opatija, Croatia, 10.23919/MIPRO.2019.8756711, 2019 42nd International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), May, 2019, 1587-1592.
42. Lukasz Czajka and Cynthia Kop. Polymorphic Higher-Order Termination. Proc.\ Formal Structures for Computation and Deduction (FSCD), 2019, LIPIcs, 131, 12:1-12:18, Dagstuhl.
43. Malte S. Klie\ss, Mariëlle Stoelinga and M. Birna van Riemsdijk. From Good Intentions to Behaviour Change - Probabilistic Feature Diagrams for Behaviour Support Agents. PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference, Turin, Italy, October 28-31, 2019, Proceedings, 354-369, 2019, 10.1007/978-3-030-33792-6\_22.
44. Marc Jasper, Malte Mues, Alnis Murtovi, Maximilian Schlüter, Falk Howar, Bernhard Steffen, Markus Schordan, Dennis Hendriks, Ramon R. H. Schiffelers, Harco Kuppens and Frits W. Vaandrager. RERS 2019: Combining Synthesis with Real-World Models. Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of TACAS: TOOLympics, Held as Part of ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part III, 101-115, 2019, 10.1007/978-3-030-17502-3\_7, Dirk Beyer, Marieke Huisman, Fabrice Kordon and Bernhard Steffen, Lecture Notes in Computer Science, 11429, Springer.
45. Marcus Gerhold, Arnd Hartmanns and Mariëlle Stoelinga. Model-based testing of stochastically timed systems. ISSE, 15, 3-4, 207-233, 2019, 10.1007/s11334-019-00349-z.
46. Marko C. J. D. van Eekelen, Daniil Frumin, Herman Geuvers, Léon Gondelman, Robbert Krebbers, Marc Schoolderman, Sjaak Smetsers, Freek Verbeek, Beno\^\it Viguier and Freek Wiedijk. A benchmark for C program verification. CoRR, abs/1904.01009, 2019, 1904.01009.
47. Markus Klinik, Jan Martin Jansen and Rinus Plasmeijer. Resource Scheduling with Computable Constraints for Maritime Command and Control. MAST Asia 2019, Makuhari Messe, Chiba, Tokyo, Japan, 2019.
48. Michael Beeson, Julien Narboux and Freek Wiedijk. Proof-checking Euclid. Ann. Math. Artif. Intell., 85, 2-4, 213-257, 2019, 10.1007/s10472-018-9606-x.
49. Michiel de Bondt, Henk Don and Hans Zantema. Lower Bounds for Synchronizing Word Lengths in Partial Automata. Int. J. Found. Comput. Sci., 30, 1, 29-60, 2019, 10.1142/S0129054119400021.
50. Milan Ceska, Christian Dehnert, Nils Jansen, Sebastian Junges and Joost-Pieter Katoen. Model Repair Revamped - - On the Automated Synthesis of Markov Chains -. From Reactive Systems to Cyber-Physical Systems, Lecture Notes in Computer Science, 11500, 107-125, Springer, 2019.
51. Milan Ceska, Nils Jansen, Sebastian Junges and Joost-Pieter Katoen. Shepherding Hordes of Markov Chains. TACAS (2), Lecture Notes in Computer Science, 11428, 172-190, Springer, 2019.
52. Joshua Moerman. Learning Product Automata. Proceedings of The 14th International Conference on Grammatical Inference 2018, 54-66, 2019, Olgierd Unold, Witold Dyrka and Wojciech Wieczorek, 93, Proceedings of Machine Learning Research, , feb, PMLR, http://proceedings.mlr.press/v93/moerman19a/moerman19a.pdf.
53. Muhammad Chenariyan Nakhaee, Djoerd Hiemstra, Mariëlle Stoelinga and Martijn van Noort. The Recent Applications of Machine Learning in Rail Track Maintenance: A Survey. Reliability, Safety, and Security of Railway Systems. Modelling, Analysis, Verification, and Certification - Third International Conference, RSSRail 2019, Lille, France, June 4-6, 2019, Proceedings, 91-105, 2019, 10.1007/978-3-030-18744-6\_6.
54. Niccol\`o Veltri and Niels van der Weide. Guarded Recursion in Agda via Sized Types. 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019), 32:1-32:19, Leibniz International Proceedings in Informatics (LIPIcs), 2019, 131, Herman Geuvers, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 10.4230/LIPIcs.FSCD.2019.32, Keywords: guarded recursion, type theory, semantics, coinduction, sized types.
55. Niccol\`o Veltri and Niels van der Weide. Guarded Recursion in Agda via Sized Types. 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019), 32:1-32:19, Leibniz International Proceedings in Informatics (LIPIcs), 2019, 131, Herman Geuvers, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 10.4230/LIPIcs.FSCD.2019.32, Keywords: guarded recursion, type theory, semantics, coinduction, sized types.
56. Nico Naus, Tim Steenvoorden and Markus Klinik. A symbolic execution semantics for TopHat. IFL2019, 2019.
57. Niels van der Weide and Herman Geuvers. The Construction of Set-Truncated Higher Inductive Types. Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, MFPS 2019, London, UK, June 4-7, 2019, 261-280, 2019, 10.1016/j.entcs.2019.09.014.
58. Nils Jansen, Laura R. Humphrey, Jana Tumova and Ufuk Topcu. Structured Synthesis for Probabilistic Systems. NFM, Lecture Notes in Computer Science, 11460, 237-254, Springer, 2019.
59. Petra van den Bos and Frits W. Vaandrager. State Identification for Labeled Transition Systems with Inputs and Outputs. CoRR, abs/1907.11034, 2019, 1907.11034.
60. Petra van den Bos, Ramon Janssen and Joshua Moerman. n-Complete test suites for IOCO. Software Quality Journal, 27, 2, 563-588, 2019, 10.1007/s11219-018-9422-x.
61. Ramon Janssen, Frits W. Vaandrager and Jan Tretmans. Relating Alternating Relations for Conformance and Refinement. CoRR, abs/1909.13604, 2019, 1909.13604.
62. C Reijnen, E Gogou, L van der Putten, N Visser, K van de Vijver, M Santacana, J Bulten, E Colas, A Gil-Moreno, A Reques and others. Development and validation of an endometrial carcinoma preoperative bayesian network using molecular and clinical biomarkers (ENDORISK): an ENITEC collaboration study. 2019, BMJ Specialist Journals.
63. Enno Ruijters, Carlos E Budde, Muhammad Chenariyan Nakhaee, Mariëlle Ida Antoinette Stoelinga, Doina Bucur, Djoerd Hiemstra and Stefano Schivo. FFORT: A benchmark suite for fault tree analysis. 2019, Singapore: Research Publishing.
64. Simone Barlocco, Clemens Kupke and Jurriaan Rot. Coalgebra Learning via Duality. FoSSaCS, Lecture Notes in Computer Science, 11425, 62-79, Springer, 2019.
65. Camil Staps, John Van Groningen and Rinus Plasmeijer. Lazy Interworking of Compiled and Interpreted Code for Sandboxing and Distributed Systems. 10.1145/3412932.3412941, Implementation and Application of Functional Languages (IFL '19), September 25–27, 2019, Singapore, Singapore, Jurriën Stutterheim and Wei Ngan Chin, 2019, New York, NY, USA, ACM, 12.
66. Steven Carr, Nils Jansen, Ralf Wimmer, Alexandru Constantin Serban, Bernd Becker and Ufuk Topcu. Counterexample-Guided Strategy Improvement for POMDPs Using Recurrent Neural Networks. IJCAI, 5532-5539, ijcai.org, 2019.
67. Stijn de Gouw, Frank S. de Boer, Richard Bubel, Reiner Hähnle, Jurriaan Rot and Dominic Steinhöfel. Verifying OpenJDK's Sort Method for Generic Collections. J. Autom. Reasoning, 62, 1, 93-126, 2019, 10.1007/s10817-017-9426-4.
68. T. Nägele, T. Broenink, J. Hooman and J. Broenink. Early Analysis of Cyber-Physical Systems using Co-simulation and Multi-level Modelling. Proc. IEEE Conference on Industrial Cyber Physical Systems (ICPS 2019), 133-138, IEEE, 2019.
69. Tim Steenvoorden, Nico Naus and Markus Klinik. TopHat: A formal foundation for task-oriented programming. PPDP'19, 2019.
70. Tobias Kappé, Paul Brunet, Jurriaan Rot, Alexandra Silva, Jana Wagemaker and Fabio Zanasi. Kleene Algebra with Observations. CONCUR, LIPIcs, 140, 41:1-41:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
71. J. Tretmans and P. van de Laar. Model-Based Testing with TorXakis - The Mysteries of Dropbox Revisited. V. Strahonja, D. Hertweck and V. Kirini\'c, Central Eur.\ Conf.\ on Information and Intelligent Systems - CECIIS, 2019, 247-258, Faculty of Organization and Informatics, University of Zagreb, Vara\vzdin, Croatia.
72. \'Etienne André, Didier Lime, Mathias Ramparison and Mariëlle Stoelinga. Parametric Analyses of Attack-Fault Trees. 19th International Conference on Application of Concurrency to System Design, ACSD 2019, Aachen, Germany, June 23-28, 2019, 33-42, 2019, 10.1109/ACSD.2019.00008.
73. \'Etienne André, Didier Lime, Mathias Ramparison and Mariëlle Stoelinga. Parametric analyses of attack-fault trees. CoRR, abs/1902.04336, 2019, 1902.04336.
74. Gerco van Heerdt, Joshua Moerman, Matteo Sammartino and Alexandra Silva. A (co) algebraic theory of succinct automata. Journal of Logical and Algebraic Methods in Programming, 105, 112-125, 2019, Elsevier.