Tools and Algorithms for the Construction and Analysis of Systems

ion Refinement for Emptiness Checking of Alternating Data Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 Radu Iosif and Xiao Xu Revisiting Enumerative Instantiation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112 Andrew Reynolds, Haniel Barbosa, and Pascal Fontaine A Non-linear Arithmetic Procedure for Control-Command Software Verification. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 Pierre Roux, Mohamed Iguernlala, and Sylvain Conchon Security and Reactive Systems Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 Milan Češka, Vojtěch Havlena, Lukáš Holík, Ondřej Lengál, and Tomáš Vojnar Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 176 Andreas Katis, Grigory Fedyukovich, Huajun Guo, Andrew Gacek, John Backes, Arie Gurfinkel, and Michael W. Whalen RVHyper: A Runtime Verification Tool for Temporal Hyperproperties . . . . . 194 Bernd Finkbeiner, Christopher Hahn, Marvin Stenger, and Leander Tentrup The Refinement Calculus of Reactive Systems Toolset . . . . . . . . . . . . . . . . 201 Iulia Dragomir, Viorel Preoteasa, and Stavros Tripakis Static and Dynamic Program Analysis TESTOR: A Modular Tool for On-the-Fly Conformance Test Case Generation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211 Lina Marsso, Radu Mateescu, and Wendelin Serwe Optimal Dynamic Partial Order Reduction with Observers . . . . . . . . . . . . . . 229 Stavros Aronis, Bengt Jonsson, Magnus Lång, and Konstantinos Sagonas Structurally Defined Conditional Data-Flow Static Analysis . . . . . . . . . . . . . 249 Elena Sherman and Matthew B. Dwyer Geometric Nontermination Arguments . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 Jan Leike and Matthias Heizmann Hybrid and Stochastic Systems Efficient Dynamic Error Reduction for Hybrid Systems Reachability Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287 Stefan Schupp and Erika Ábrahám AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303 Dejan Ničković, Olivier Lebeltel, Oded Maler, Thomas Ferrère, and Dogan Ulus Multi-cost Bounded Reachability in MDP . . . . . . . . . . . . . . . . . . . . . . . . . 320 Arnd Hartmanns, Sebastian Junges, Joost-Pieter Katoen, and Tim Quatmann A Statistical Model Checker for Nondeterminism and Rare Events . . . . . . . . 340 Carlos E. Budde, Pedro R. D’Argenio, Arnd Hartmanns, and Sean Sedwards XVI

[1]  Wil M. P. van der Aalst,et al.  Verification of Workflow Nets , 1997, ICATPN.

[2]  R. Lougee-Heimer,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003 .

[3]  Andrei Voronkov,et al.  Selecting the Selection , 2016, IJCAR.

[4]  Andrei Voronkov,et al.  Playing with AVATAR , 2015, CADE.

[5]  Christoph Weidenbach,et al.  Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[6]  Peter Baumgartner,et al.  Beagle - A Hierarchic Superposition Theorem Prover , 2015, CADE.

[7]  Javier Esparza,et al.  Computing the concurrency threshold of sound free-choice workflow nets , 2018, TACAS.

[8]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[9]  Dirk Fahland,et al.  Instantaneous Soundness Checking of Industrial Business Process Models , 2009, BPM.

[10]  Harald Ganzinger,et al.  Refutational theorem proving for hierarchic first-order theories , 1994, Applicable Algebra in Engineering, Communication and Computing.

[11]  Jiajie Xu,et al.  Resource Allocation vs. Business Process Improvement: How They Impact on Each Other , 2008, BPM.

[12]  Maria Paola Bonacina,et al.  On Deciding Satisfiability by Theorem Proving with Speculative Inferences , 2011, Journal of Automated Reasoning.

[13]  Ernst Althaus,et al.  Superposition Modulo Linear Arithmetic SUP(LA) , 2009, FroCoS.

[14]  Lawrence C. Paulson,et al.  Extending a Resolution Prover for Inequalities on Elementary Functions , 2007, LPAR.

[15]  Mark E. Stickel,et al.  Automated deduction by theory resolution , 1985, Journal of Automated Reasoning.

[16]  Martin Suda,et al.  Set of Support for Theory Reasoning , 2017, IWIL@LPAR.

[17]  Philipp Rümmer,et al.  A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic , 2008, LPAR.

[18]  Javier Esparza,et al.  Polynomial analysis algorithms for free choice Probabilistic Workflow Nets , 2016, Perform. Evaluation.

[19]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[20]  Andrei Voronkov,et al.  First-Order Theorem Proving and Vampire , 2013, CAV.

[21]  Dirk Fahland,et al.  The relationship between workflow graphs and free-choice workflow nets , 2015, Inf. Syst..

[22]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[23]  Peter Baumgartner,et al.  Hierarchic Superposition with Weak Abstraction , 2013, CADE.

[24]  David Detlefs,et al.  Simplify: a theorem prover for program checking , 2005, JACM.

[25]  Karsten Wolf,et al.  Generating Petri Net State Spaces , 2007, ICATPN.

[26]  Wil M. P. van der Aalst,et al.  Fundamentals of control flow in workflows , 2003, Acta Informatica.

[27]  Andrei Voronkov,et al.  New Techniques in Clausal Form Generation , 2016, GCAI.