Tools and Algorithms for the Construction and Analysis of Systems

1. Front Matter

   Pages I-XXIV

   PDF

2. Invited Talk

   1. Front Matter

      Pages 1-1

      PDF

   2. Validation, Synthesis and Optimization for Cyber-Physical Systems

      • Kim Guldstrand Larsen

      Pages 3-20

3. Verification Techniques I

   1. Front Matter

      Pages 21-21

      PDF

   2. An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP

      • Ocan Sankur, Jean-Pierre Talpin

      Pages 23-40

   3. Combining String Abstract Domains for JavaScript Analysis: An Evaluation

      • Roberto Amadini, Alexander Jordan, Graeme Gange, François Gauthier, Peter Schachte, Harald Søndergaard et al.

      Pages 41-57

   4. Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF

      • Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, Roberto Sebastiani

      Pages 58-75

   5. Bounded Quantifier Instantiation for Checking Inductive Invariants

      • Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham

      Pages 76-95

4. Verification Techniques II

   1. Front Matter

      Pages 97-97

      PDF

   2. Proving Termination Through Conditional Termination

      • Cristina Borralleras, Marc Brockschmidt, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio

      Pages 99-117

   3. Efficient Certified Resolution Proof Checking

      • Luís Cruz-Filipe, Joao Marques-Silva, Peter Schneider-Kamp

      Pages 118-135

   4. Precise Widening Operators for Proving Termination by Abstract Interpretation

      • Nathanaël Courant, Caterina Urban

      Pages 136-152

   5. Automatic Verification of Finite Precision Implementations of Linear Controllers

      • Junkil Park, Miroslav Pajic, Oleg Sokolsky, Insup Lee

      Pages 153-169

5. Learning

   1. Front Matter

      Pages 171-171

      PDF

   2. Learning Symbolic Automata

      • Samuel Drews, Loris D’Antoni

      Pages 173-189

   3. ML for ML: Learning Cost Semantics by Experiment

      • Ankush Das, Jan Hoffmann

      Pages 190-207

   4. A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees

      • Yong Li, Yu-Fang Chen, Lijun Zhang, Depeng Liu

      Pages 208-226

6. Synthesis I

   1. Front Matter

      Pages 227-227

      PDF

   2. Hierarchical Network Formation Games

      • Orna Kupferman, Tami Tamir

      Pages 229-246

   3. Synthesis of Recursive ADT Transformations from Reusable Templates

      • Jeevana Priya Inala, Nadia Polikarpova, Xiaokang Qiu, Benjamin S. Lerner, Armando Solar-Lezama

      Pages 247-263

The two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017.

The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP. 

• temporal logic
• artificial intelligence
• computer programming languages
• computer software selection and evaluation
• distributed computer systems
• formal logic
• model checking
• Markov decision processes
• program compilers
• semantics
• software engineering
• specifications
• static analysis
• temporal logic
• verification
• algorithm analysis and problem complexity

• Inria, Rennes Cedex, France

  Axel Legay

• University of Limerick and Lero - The Irish Software Research Center, Limerick, Ireland

  Tiziana Margaria

Policies and ethics