ETAPS 2017
2017 European Joint Conferences on Theory and Practice of Software (ETAPS)
Powered by
Conference Publishing Consulting

2017 European Joint Conferences on Theory and Practice of Software (ETAPS), April 22–29, 2017, Uppsala, Sweden

ETAPS 2017 – Proceedings

Contents - Abstracts - Authors
Online Calendar - iCal File


Probabilistic Programming

Commutative Semantics for Probabilistic Programming
Sam Staton
(University of Oxford, UK)

Article Search
Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring
Ryan Culpepper and Andrew Cobb
(Northeastern University, USA)

Article Search
Metric Reasoning About λ-Terms: The General Case
Raphaëlle Crubillé and Ugo Dal Lago
(University of Paris Diderot, France; University of Bologna, Italy)

Article Search
Probabilistic Termination by Monadic Affine Sized Typing
Ugo Dal Lago and Charles Grellois
(University of Bologna, Italy; University of Paris Diderot, France)

Article Search Info

Graph Rewriting

Confluence of Graph Rewriting with Interfaces
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, and Fabio Zanasi
(ENS Lyon, France; University of Pisa, Italy; Radboud University Nijmegen, Netherlands; University of Southampton, UK; University College London, UK)

Article Search
Incremental Update for Graph Rewriting
Pierre Boutillier, Thomas Ehrhard, and Jean Krivine
(Harvard Medical School, USA; University of Paris Diderot, France; CNRS, France; amp, France)

Article Search


Abstract Specifications for Concurrent Maps
Shale Xiong, Pedro da Rocha Pinto, Gian Ntzik, and Philippa Gardner
(Imperial College London, UK)

Article Search Info
Caper - Automatic Verification for Fine-Grained Concurrency
Thomas Dinsdale-Young, Pedro da Rocha Pinto, Kristoffer Just Andersen, and Lars Birkedal
(Aarhus University, Denmark; Imperial College London, UK)

Article Search Video Info
Observed Communication Semantics for Classical Processes
Robert Atkey
(University of Strathclyde, UK)

Article Search
Tackling Real-Life Relaxed Concurrency with FSL++
Marko Doko and Viktor Vafeiadis
(MPI-SWS, Germany)

Article Search Info

Language Design

APLicative Programming with Naperian Functors
Jeremy Gibbons
(University of Oxford, UK)

Article Search Info
Disjoint Polymorphism
João Alpuim, Bruno C. d. S. Oliveira, and Zhiyuan Shi
(University of Hong Kong, China)

Article Search
Extensible Datasort Refinements
Joshua Dunfield
(University of British Columbia, Canada)

Article Search
The Essence of Functional Programming on Semantic Data
Martin Leinberger, Ralf Lämmel, and Steffen Staab
(University of Koblenz-Landau, Germany; University of Southampton, UK)

Article Search


Is Your Software on Dope? Formal Analysis of Surreptitiously "enhanced" Programs
Pedro R. D'Argenio, Gilles Barthe, Sebastian Biewer, Bernd Finkbeiner, and Holger Hermanns
(Universidad Nacional de Córdoba, Argentina; CONICET, Argentina; Saarland University, Germany; IMDEA Software Institute, Spain)

Article Search
Modular Verification of Procedure Equivalence in the Presence of Memory Allocation
Tim Wood, Sophia Drossopolou, Shuvendu K. Lahiri, and Susan Eisenbach
(Imperial College London, UK; Microsoft Research, USA)

Article Search
Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency
Ahmed Bouajjani, Michael Emmi, Constantin Enea, Burcu Kulahcioglu Ozkan, and Serdar Tasiran
(University of Paris Diderot, France; Nokia Bell Labs, USA; Koç University, Turkey)

Article Search

Automated Verification

Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization
Hao Tang, Di Wang, Yingfei Xiong, Lingming Zhang, Xiaoyin Wang, and Lu Zhang
(Peking University, China; University of Texas at Dallas, USA; University of Texas at San Antonio, USA)

Article Search Info
Faster Algorithms for Weighted Recursive State Machines
Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis
(IST Austria, Austria; IIT Bombay, India)

Article Search
ML and Extended Branching VASS
Conrad Cotton-Barratt, Andrzej S. Murawski, and C.-H. Luke Ong
(University of Oxford, UK; University of Warwick, UK)

Article Search
Modular Verification of Higher-Order Functional Programs
Ryosuke Sato and Naoki Kobayashi
(University of Tokyo, Japan)

Article Search

Theorem Proving

Comprehending Isabelle/HOL's Consistency
Ondřej Kunčar and Andrei Popescu
(TU Munich, Germany; Middlesex University, UK)

Article Search
Friends with Benefits - Implementing Corecursion in Foundational Proof Assistants
Jasmin Christian Blanchette, Aymeric Bouzy, Andreas Lochbihler, Andrei Popescu, and Dmitriy Traytel
(Inria, France; LORIA, France; Max Planck Institute for Informatics, Germany; École Polytechnique, France; ETH Zurich, Switzerland; Middlesex University, UK)

Article Search Info
Generalizing Inference Systems by Coaxioms
Davide Ancona, Francesco Dagnino, and Elena Zucca
(University of Genoa, Italy)

Article Search Info
Verified Characteristic Formulae for CakeML
Armaël Guéneau, Magnus O. Myreen, Ramana Kumar, and Michael Norrish
(ENS Lyon, France; Chalmers University of Technology, Sweden; Data61 at CSIRO, Australia)

Article Search

Separation Logic

A Higher-Order Logic for Concurrent Termination-Preserving Refinement
Joseph Tassarotti, Ralf Jung, and Robert Harper
(Carnegie Mellon University, USA; MPI-SWS, Germany)

Article Search
Temporary Read-Only Permissions for Separation Logic
Arthur Charguéraud and François Pottier
(Inria, France)

Article Search Info
The Essence of Higher-Order Concurrent Separation Logic
Robbert Krebbers, Ralf Jung, Aleš Bizjak, Jacques-Henri Jourdan, Derek Dreyer, and Lars Birkedal
(Delft University of Technology, Netherlands; MPI-SWS, Germany; Aarhus University, Denmark)

Article Search
Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic
Christina Jansen, Jens Katelaan, Christoph Matheja, Thomas Noll, and Florian Zuleger
(RWTH Aachen University, Germany; Vienna University of Technology, Austria)

Article Search

Session Types

Context-Free Session Type Inference
Luca Padovani
(University of Turin, Italy)

Article Search Info
Linearity, Control Effects, and Behavioural Types
Luis Caires and Jorge A. Pérez
(Nova University of Lisbon, Portugal; University of Groningen, Netherlands)

Article Search
Proving Linearizability Using Partial Orders
Artem Khyzha, Mike Dodds, Alexey Gotsman, and Matthew J. Parkinson
(IMDEA Software Institute, Spain; University of York, UK; Microsoft Research, UK)

Article Search
The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming
Cynthia Kop and Jakob Grue Simonsen
(University of Copenhagen, Denmark)

Article Search

Type Theory

A Classical Sequent Calculus with Dependent Types
Étienne Miquey
(Inria, France; IRIF, France; University of Paris Diderot, France; University of the Republic, Uruguay)

Article Search
Lincx: A Linear Logical Framework with First-Class Contexts
Aina Linn Georges, Agata Murawska, Shawn Otis, and Brigitte Pientka
(McGill University, Canada; IT University of Copenhagen, Denmark)

Article Search
Programs Using Syntax with First-Class Binders
Francisco Ferreira and Brigitte Pientka
(McGill University, Canada)

Article Search


Learning and Inference

Should We Learn Probabilistic Models for Model Checking? A New Approach and An Empirical Study
Jingyi Wang, Jun Sun, Qixia Yuan, and Jun Pang
(Singapore University of Technology and Design, Singapore; University of Luxembourg, Luxembourg)

Article Search Info
Bordeaux: A Tool for Thinking Outside the Box
Vajih Montaghami and Derek Rayside
(University of Waterloo, Canada)

Article Search

Test Selection

Bucketing Failing Tests via Symbolic Analysis
Van-Thuan Pham, Sakaar Khurana, Subhajit Roy, and Abhik Roychoudhury
(National University of Singapore, Singapore; IIT Kanpur, India; Microsoft, India)

Article Search
Selective Bisection Debugging
Ripon Saha and Milos Gligoric
(Fujitsu Labs, USA; University of Texas at Austin, USA)

Article Search
On the Effectiveness of Bug Predictors with Procedural Systems: A Quantitative Study
Cristiano Werner Araújo, Ingrid Nunes, and Daltro José Nunes
(Federal University of Rio Grande do Sul, Brazil)

Article Search Info

Program and System Analysis

Inference and Evolution of TypeScript Declaration Files
Erik Krogh Kristensen and Anders Møller
(Aarhus University, Denmark)

Article Search Info
Explicit Connection Actions in Multiparty Session Types
Raymond Hu and Nobuko Yoshida
(Imperial College London, UK)

Article Search
Change and Delay Contracts for Hybrid System Component Verification
Andreas Müller, Stefan Mitsch, Werner Retschitzegger, Wieland Schwinger, and André Platzer
(JKU Linz, Austria; Carnegie Mellon University, USA)

Article Search Info
Precise Version Control of Trees with Line-Based Version Control Systems
Dimitar Asenov, Balz Guenat, Peter Müller, and Martin Otth
(ETH Zurich, Switzerland; Ergon Informatik, Switzerland)

Article Search Video Info

Graph Modelling and Transformation

StaticGen: Static Generation of UML Sequence Diagrams
Chris Alvin, Brian Peterson, and Supratik Mukhopadhyay
(Bradley University, USA; Louisiana State University, USA)

Article Search
Inter-model Consistency Checking Using Triple Graph Grammars and Linear Optimization Techniques
Erhan Leblebici, Anthony Anjorin, and Andy Schürr
(TU Darmstadt, Germany; University of Paderborn, Germany)

Article Search
GTS Families for the Flexible Composition of Graph Transformation Systems
Steffen Zschaler and Francisco Durán
(King's College London, UK; University of Málaga, Spain)

Article Search
Symbolic Model Generation for Graph Properties
Sven Schneider, Leen Lambers, and Fernando Orejas
(HPI, Germany; Universitat Politècnica de Catalunya, Spain)

Article Search

Model Transformations

Traceability Mappings as a Fundamental Instrument in Model Transformations
Zinovy Diskin, Abel Gómez, and Jordi Cabot
(McMaster University, Canada; University of Waterloo, Canada; Open University of Catalonia, Spain; ICREA, Spain)

Article Search
Reusing Model Transformations Through Typing Requirement Models
Juan de Lara, Juri Di Rocco, Davide Di Ruscio, Esther Guerra, Ludovico Iovino, Alfonso Pierantonio, and Jesús Sánchez Cuadrado
(Autonomous University of Madrid, Spain; University of L'Aquila, Italy; Gran Sasso Science Institute, Italy)

Article Search
Change-Preserving Model Repair
Gabriele Taentzer, Manuel Ohrndorf, Yngve Lamo, and Adrian Rutle
(University of Marburg, Germany; University of Siegen, Germany; Western Norway University of Applied Sciences, Norway)

Article Search Info
A Deductive Approach for Fault Localization in ATL Model Transformations
Zheng Cheng and Massimo Tisi
(AtlanMod, France)

Article Search Video Info

Configuration and Synthesis

OpenSAW: Open Security Analysis Workbench
Noomene Ben Henda, Björn Johansson, Patrik Lantz, Karl Norrman, Pasi Saarinen, and Oskar Segersvärd
(Ericsson Research, Sweden; KTH, Sweden)

Article Search Info
Visual Configuration of Mobile Privacy Policies
Abdulbaki Aydin, David Piorkowski, Omer Tripp, Pietro Ferrara, and Marco Pistoia
(University of California at Santa Barbara, USA; IBM Research, USA; Google, USA; Julia, Italy)

Article Search
Automated Workarounds from Java Program Specifications Based on SAT Solving
Marcelo Uva, Pablo Ponzio, Germán Regis, Nazareno Aguirre, and Marcelo F. Frias
(Universidad Nacional de Río Cuarto, Argentina; CONICET, Argentina; Buenos Aires Institute of Technology, Argentina)

Article Search Info
Slicing from Formal Sematics: Chisel
Adrián Riesco, Irina Mariuca Asavoae, and Mihail Asavoae
(Complutense University of Madrid, Spain; Inria, France)

Article Search Info
EasyInterface: A Toolkit for Rapid Development of GUIs for Research Prototype Tools
Jesús Doménech, Samir Genaim, Einar Broch Johnsen, and Rudolf Schlatte
(Complutense University of Madrid, Spain; University of Oslo, Norway)

Article Search Video Info

Software Product Lines

Family-Based Model Checking with mCRL2
Maurice H. ter Beek, Erik P. de Vink, and Tim A. C. Willemse
(ISTI-CNR, Italy; Eindhoven University of Technology, Netherlands)

Article Search
Variability-Specific Abstraction Refinement for Family-Based Model Checking
Aleksandar S. Dimovski and Andrzej Wąsowski
(IT University of Copenhagen, Denmark)

Article Search
A Unified and Formal Programming Model for Deltas and Traits
Ferruccio Damiani, Reiner Hähnle, Eduard Kamburjan, and Michael Lienhardt
(University of Turin, Italy; TU Darmstadt, Germany)

Article Search


Coherence Spaces and Higher-Order Computation

Coherence Spaces and Uniform Continuity
Kei Matsumoto
(Kyoto University, Japan)

Article Search
The Free Exponential Modality of Probabilistic Coherence Spaces
Raphaëlle Crubillé, Thomas Ehrhard, Michele Pagani, and Christine Tasson
(University of Paris Diderot, France)

Article Search
From Qualitative to Quantitative Semantics - By Change of Base
James Laird
(University of Bath, UK)

Article Search
Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence
Ryoma Sin'Ya, Kazuyuki Asada, Naoki Kobayashi, and Takeshi Tsukada
(University of Tokyo, Japan)

Article Search

Algebra and Coalgebra

Algebra, Coalgebra, and Minimization in Polynomial Differential Equations
Michele Boreale
(University of Florence, Italy)

Article Search Info
Equational Theories of Abnormal Termination Based on Kleene Algebra
Konstantinos Mamouras
(University of Pennsylvania, USA)

Article Search
Companions, Codensity and Causality
Damien Pous and Jurriaan Rot
(CNRS, France; ENS Lyon, France; Radboud University Nijmegen, Netherlands)

Article Search
Nominal Automata with Name Binding
Lutz Schröder, Dexter Kozen, Stefan Milius, and Thorsten Wißmann
(University of Erlangen-Nuremberg, Germany; Cornell University, USA)

Article Search

Games and Automata

On the Existence of Weak Subgame Perfect Equilibria
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, and Jean-Francois Raskin
(University of Mons, Belgium; Université Libre de Bruxelles, Belgium)

Article Search
Optimal Reachability in Divergent Weighted Timed Games
Damien Busatto-Gaston, Benjamin Monmege, and Pierre-Alain Reynier
(Aix-Marseille University, France; LIF, France; CNRS, France)

Article Search
Bounding Average-Energy Games
Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, and Martin Zimmermann
(CNRS, France; ENS Cachan, France; University of Paris-Saclay, France; IRISA, France; Inria, France; University of Rennes, France; Université Libre de Bruxelles, Belgium; Saarland University, Germany)

Article Search
Logics of Repeating Values on Data Trees and Branching Counter Systems
Sergio Abriola, Diego Figueira, and Santiago Figueira
(University of Buenos Aires, Argentina; CNRS, France)

Article Search

Automata, Logic, and Formal Languages

Degree of Sequentiality of Weighted Automata
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, and Didier Villevalois
(University of Warsaw, Poland; Université Libre de Bruxelles, Belgium; Aix-Marseille University, France)

Article Search
Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan
(University of Missouri, USA; University of Illinois at Chicago, USA; University of Illinois at Urbana-Champaign, USA)

Article Search
Partial Derivatives for Context-Free Languages - From μ-Regular Expressions to Pushdown Automata
Peter Thiemann
(University of Freiburg, Germany)

Article Search
Dynamic Complexity of the Dyck Reachability
Patricia Bouyer and Vincent Jugé
(CNRS, France; ENS Cachan, France; University of Paris-Saclay, France)

Article Search

Proof Theory

Cyclic Arithmetic Is Equivalent to Peano Arithmetic
Alex Simpson
(University of Ljubljana, Slovenia)

Article Search
Classical System of Martin-Löf's Inductive Definitions Is Not Equivalent to Cyclic Proof System
Stefano Berardi and Makoto Tatsuta
(University of Turin, Italy; National Institute of Informatics, Japan)

Article Search


On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context
Gaoang Bian and Alessandro Abate
(Google, USA; University of Oxford, UK)

Article Search
Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables
Vincent Danos, Tobias Heindel, Ilias Garnier, and Jakob Grue Simonsen
(ENS, France; CNRS, France; University of Copenhagen, Denmark; University of Edinburgh, UK)

Article Search
Pointless Learning
Florence Clerc, Vincent Danos, Fredrik Dahlqvist, and Ilias Garnier
(McGill University, Canada; ENS, France; CNRS, France; University College London, UK; University of Edinburgh, UK)

Article Search
On Higher-Order Probabilistic Subrecursion
Flavien Breuvart, Ugo Dal Lago, and Agathe Herrou
(Inria, France; University of Bologna, Italy; ENS Lyon, France)

Article Search


A Truly Concurrent Game Model of the Asynchronous π-Calculus
Ken Sakayori and Takeshi Tsukada
(University of Tokyo, Japan)

Article Search
Local Model Checking in a Logic for True Concurrency
Paolo Baldan and Tommaso Padoan
(University of Padua, Italy)

Article Search
The Paths to Choreography Extraction
Luís Cruz-Filipe, Kim S. Larsen, and Fabrizio Montesi
(University of Southern Denmark, Denmark)

Article Search
On the Undecidability of Asynchronous Session Subtyping
Julien Lange and Nobuko Yoshida
(Imperial College London, UK)

Article Search

Lambda Calculus and Constructive Proof

A Lambda-Free Higher-Order Recursive Path Order
Jasmin Christian Blanchette, Uwe Waldmann, and Daniel Wand
(Inria, France; LORIA, France; Max Planck Institute for Informatics, Germany)

Article Search
Automated Constructivization of Proofs
Frédéric Gilbert
(École des Ponts ParisTech, France; Inria, France; CEA LIST, France)

Article Search

Semantics and Category Theory

A Light Modality for Recursion
Paula Severi
(University of Leicester, UK)

Article Search
Unifying Guarded and Unguarded Iteration
Sergey Goncharov, Lutz Schröder, Christoph Rauch, and Maciej Piróg
(University of Erlangen-Nuremberg, Germany; KU Leuven, Belgium)

Article Search
Partiality, Revisited - The Partiality Monad as a Quotient Inductive-Inductive Type
Thorsten Altenkirch, Nils Anders Danielsson, and Nicolai Kraus
(University of Nottingham, UK; University of Gothenburg, Sweden; Chalmers University of Technology, Sweden)

Article Search
On the Semantics of Intensionality
G. A. Kavvos
(University of Oxford, UK)

Article Search


Information Flow

Timing-Sensitive Noninterference through Composition
Willard Rafnsson, Limin Jia, and Lujo Bauer
(MPI-SWS, Germany; Carnegie Mellon University, USA)

Article Search Info
Quantifying Vulnerability of Secret Generation Using Hyper-Distributions
Mário S. Alvim, Piotr Mardziel, and Michael W. Hicks
(Federal University of Minas Gerais, Brazil; Carnegie Mellon University, USA; University of Maryland at College Park, USA)

Article Search Info
A Principled Approach to Tracking Information Flow in the Presence of Libraries
Daniel Hedin, Alexander Sjösten, Frank Piessens, and Andrei Sabelfeld
(Mälardalen University, Sweden; Chalmers University of Technology, Sweden; KU Leuven, Belgium)

Article Search
Secure Multi-party Computation: Information Flow of Outputs and Game Theory
Patrick Ah-Fat and Michael Huth
(Imperial College London, UK)

Article Search

Security Protocols

Automated Verification of Dynamic Root of Trust Protocols
Sergiu Bursuc, Christian Johansen, and Shiwei Xu
(University of Bristol, UK; University of Oslo, Norway; Wuhan Digital and Engineering Institute, China)

Article Search
Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
Jannik Dreier, Charles Duménil, Steve Kremer, and Ralf Sasse
(LORIA, France; CNRS, France; Inria, France; University of Lorraine, France; ETH Zurich, Switzerland)

Article Search Info
On Communication Models When Verifying Equivalence Properties
Kushal Babel, Vincent Cheval, and Steve Kremer
(IIT Bombay, India; Inria, France; LORIA, France; CNRS, France; University of Lorraine, France)

Article Search Info
A Survey of Attacks on Ethereum Smart Contracts (SoK)
Nicola Atzei, Massimo Bartoletti, and Tiziana Cimoli
(University of Cagliari, Italy)

Article Search

Security Policies

Security Analysis of Cache Replacement Policies
Pablo Cañones, Boris Köpf, and Jan Reineke
(IMDEA Software Institute, Spain; Saarland University, Germany)

Article Search
Model Checking Exact Cost for Attack Scenarios
Zaruhi Aslanyan and Flemming Nielson
(DTU, Denmark)

Article Search
Postulates for Revocation Schemes
Marcos Cramer and Giovanni Casini
(University of Luxembourg, Luxembourg)

Article Search Info
Defense in Depth Formulation and Usage in Dynamic Access Control
Ridha Khedri, Owain Jones, and Mohammed Alabbad
(McMaster University, Canada; CMC Microsystems, Canada)

Article Search

Information Leakage

Compositional Synthesis of Leakage Resilient Programs
Arthur Blot, Masaki Yamamoto, and Tachio Terauchi
(ENS Lyon, France; Nagoya University, Japan; JAIST, Japan)

Article Search
Combining Differential Privacy and Mutual Information for Analyzing Leakages in Workflows
Martin Pettai and Peeter Laud
(Cybernetica, Estonia)

Article Search


Validation, Synthesis, and Optimization for Cyber-Physical Systems (Invited Talk)

Validation, Synthesis, and Optimization for Cyber-Physical Systems (Invited Talk)
Kim Guldstrand Larsen
(Aalborg University, Denmark)

Article Search

Verification Techniques 1

An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP
Ocan Sankur and Jean-Pierre Talpin
(CNRS, France; IRISA, France; Inria, France)

Article Search Info
Combining String Abstract Domains for JavaScript Analysis: An Evaluation
Roberto Amadini, Alexander Jordan, Graeme Gange, François Gauthier, Peter Schachte, Harald Søndergaard, Peter J. Stuckey, and Chenyi Zhang
(University of Melbourne, Australia; Oracle Labs, Australia; Oracle, Australia; University of Queensland, Australia)

Article Search
Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF
Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, and Roberto Sebastiani
(Fondazione Bruno Kessler, Italy; University of Trento, Italy)

Article Search Info
Bounded Quantifier Instantiation for Checking Inductive Invariants
Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, and Sharon Shoham
(Tel Aviv University, Israel; University of Massachusetts at Amherst, USA)

Article Search

Verification Techniques 2

Proving Termination Through Conditional Termination
Cristina Borralleras, Marc Brockschmidt, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, and Albert Rubio
(Universitat de Vic, Spain; Microsoft Research, UK; Universitat Politècnica de Catalunya, Spain)

Article Search Info
Efficient Certified Resolution Proof Checking
Luís Cruz-Filipe, Joao Marques-Silva, and Peter Schneider-Kamp
(University of Southern Denmark, Denmark; University of Lisbon, Portugal)

Article Search
Precise Widening Operators for Proving Termination by Abstract Interpretation
Nathanaël Courant and Caterina Urban
(ENS, France; ETH Zurich, Switzerland)

Article Search
Automatic Verification of Finite Precision Implementations of Linear Controllers
Junkil Park, Miroslav Pajic, Oleg Sokolsky, and Insup Lee
(University of Pennsylvania, USA; Duke University, USA)

Article Search


Learning Symbolic Automata
Samuel Drews and Loris D'Antoni
(University of Wisconsin-Madison, USA)

Article Search
ML for ML: Learning Cost Semantics by Experiment
Ankush Das and Jan Hoffmann
(Carnegie Mellon University, USA)

Article Search Info
A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
Yong Li, Yu-Fang Chen, Lijun Zhang, and Depeng Liu
(Institute of Software at Chinese Academy of Sciences, China; Academia Sinica, Taiwan)

Article Search

Synthesis 1

Hierarchical Network Formation Games
Orna Kupferman and Tami Tamir
(Hebrew University of Jerusalem, Israel; Interdisciplinary Center, Israel)

Article Search
Synthesis of Recursive ADT Transformers from Reusable Templates
Jeevana Priya Inala, Nadia Polikarpova, Xiaokang Qiu, Benjamin S. Lerner, and Armando Solar-Lezama
(Massachusetts Institute of Technology, USA; Purdue University, USA; Northeastern University, USA)

Article Search
Counterexample-Guided Model Synthesis
Mathias Preiner, Aina Niemetz, and Armin Biere
(JKU Linz, Austria)

Article Search Info
Interpolation-Based GR(1) Assumptions Refinement
Davide G. Cavezza and Dalal Alrajeh
(Imperial College London, UK)

Article Search Info

Synthesis 2

Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation
ThanhVu Nguyen, Westley Weimer, Deepak Kapur, and Stephanie Forrest
(University of Nebraska-Lincoln, USA; University of Virginia, USA; University of New Mexico, USA)

Article Search
Scaling Enumerative Program Synthesis via Divide and Conquer
Rajeev Alur, Arjun Radhakrishna, and Abhishek Udupa
(University of Pennsylvania, USA)

Article Search
Towards Parallel Boolean Functional Synthesis
S. Akshay, Supratik Chakraborty, Ajith K. John, and Shetal Shah
(IIT Bombay, India; BARC, India)

Article Search
Encodings of Bounded Synthesis
Peter Faymonville, Bernd Finkbeiner, Markus N. Rabe, and Leander Tentrup
(Saarland University, Germany; University of California at Berkeley, USA)

Article Search


HQSpre - An Effective Preprocessor for QBF and DQBF
Ralf Wimmer, Sven Reimer, Paolo Marin, and Bernd Becker
(University of Freiburg, Germany)

Article Search
RPP: Automatic Proof of Relational Properties by Self-composition
Lionel Blatter, Nikolai Kosmatov, Pascale Le Gall, and Virgile Prevosto
(CEA LIST, France; CentraleSupélec, France)

Article Search
autoCode4: Structural Controller Synthesis
Chih-Hong Cheng, Edward A. Lee, and Harald Ruess
(fortiss, Germany; University of California at Berkeley, USA)

Article Search Video


Lazy Automata Techniques for WS1S
Tomas Fiedor, Lukas Holik, Petr Janku, Ondrej Lengal, and Tomas Vojnar
(Brno University of Technology, Czech Republic)

Article Search Info
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
Javier Esparza, Jan Kretínský, Jean-François Raskin, and Salomon Sickert
(TU Munich, Germany; Université Libre de Bruxelles, Belgium)

Article Search
Index Appearance Record for Transforming Rabin Automata into Parity Automata
Jan Kretínský, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger
(TU Munich, Germany)

Article Search
Minimization of Visibly Pushdown Automata Using Partial Max-SAT
Matthias Heizmann, Christian Schilling, and Daniel Tischner
(University of Freiburg, Germany)

Article Search

Concurrency and Bisimulation

CSimpl: A Rely-Guarantee-Based Framework for Verifying Concurrent Programs
David Sanán, Yongwang Zhao, Zhe Hou, Fuyuan Zhang, Alwen Tiu, and Yang Liu
(Nanyang Technological University, Singapore; Beihang University, China; Australian National University, Australia)

Article Search
Fair Termination for Parameterized Probabilistic Concurrent Systems
Ondrej Lengál, Anthony Widjaja Lin, Rupak Majumdar, and Phillip Rümmer
(Brno University of Technology, Czech Republic; Yale-NUS College, Singapore; MPI-SWS, Germany; Uppsala University, Sweden)

Article Search
Forward Bisimulations for Nondeterministic Symbolic Finite Automata
Loris D'Antoni and Margus Veanes
(University of Wisconsin-Madison, USA; Microsoft Research, USA)

Article Search
Up-To Techniques for Weighted Systems
Filippo Bonchi, Barbara König, and Sebastian Küpper
(ENS Lyon, France; University of Duisburg-Essen, Germany)

Article Search

Hybrid Systems

Rigorous Simulation-Based Analysis of Linear Hybrid Systems
Stanley Bak and Parasara Sridhar Duggirala
(Air Force Research Lab, USA; University of Connecticut, USA)

Article Search Video Info
HARE: A Hybrid Abstraction Refinement Engine for Verifying Non-linear Hybrid Automata
Nima Roohi, Pavithra Prabhakar, and Mahesh Viswanathan
(University of Illinois at Urbana-Champaign, USA; Kansas State University, USA)

Article Search
Counterexample-Guided Refinement of Template Polyhedra
Sergiy Bogomolov, Goran Frehse, Mirco Giacobbe, and Thomas A. Henzinger
(Australian National University, Australia; University of Grenoble, France; VERIMAG, France; IST Austria, Austria)

Article Search


Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions
Valentin Wüstholz, Oswaldo Olivo, Marijn J. H. Heule, and Isil Dillig
(University of Texas at Austin, USA)

Article Search
Discriminating Traces with Time
Saeid Tizpaz-Niari, Pavol Cerný, Bor-Yuh Evan Chang, Sriram Sankaranarayanan, and Ashutosh Trivedi
(University of Colorado at Boulder, USA)

Article Search
Directed Automated Memory Performance Testing
Sudipta Chattopadhyay
(Saarland University, Germany)

Article Search Info
Context-Bounded Analysis for POWER
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, and Tuan Phong Ngo
(Uppsala University, Sweden; University of Paris Diderot, France)

Article Search

Run-Time Verification and Logic

Rewriting-Based Runtime Verification of Alternation-Free HyperLTL
Noel Brett, Umair Siddique, and Borzoo Bonakdarpour
(McMaster University, Canada)

Article Search
Almost Event-Rate Independent Monitoring of Metric Temporal Logic
David A. Basin, Bhargav Nagaraja Bhatt, and Dmitriy Traytel
(ETH Zurich, Switzerland)

Article Search
Optimal Translation of LTL to Limit Deterministic Automata
Dileep Kini and Mahesh Viswanathan
(University of Illinois at Urbana-Champaign, USA)

Article Search Info

Quantitative Systems 1

Sequential Convex Programming for the Efficient Verification of Parametric MDPs
Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ivan Papusha, Hasan A. Poonawala, and Ufuk Topcu
(University of Texas at Austin, USA; RWTH Aachen University, Germany)

Article Search
JANI: Quantitative Model and Tool Interaction
Carlos E. Budde, Christian Dehnert, Ernst Moritz Hahn, Arnd Hartmanns, Sebastian Junges, and Andrea Turrini
(Universidad Nacional de Córdoba, Argentina; RWTH Aachen University, Germany; Institute of Software at Chinese Academy of Sciences, China; University of Twente, Netherlands)

Article Search
Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults
Guy Avni, Shubham Goel, Thomas A. Henzinger, and Guillermo Rodríguez-Navas
(IST Austria, Austria; IIT Bombay, India; Mälardalen University, Sweden)

Article Search Info
Long-Run Rewards for Markov Automata
Yuliya Butkova, Ralf Wimmer, and Holger Hermanns
(Saarland University, Germany; University of Freiburg, Germany)

Article Search Info


HiFrog: SMT-based Function Summarization for Software Verification
Leonardo Alt, Sepideh Asadi, Hana Chockler, Karine Even Mendoza, Grigory Fedyukovich, Antti E. J. Hyvärinen, and Natasha Sharygina
(University of Lugano, Switzerland; King's College London, UK; University of Washington, USA)

Article Search Info
Congruence Closure with Free Variables
Haniel Barbosa, Pascal Fontaine, and Andrew Reynolds
(LORIA, France; Inria, France; University of Lorraine, France; University of Iowa, USA)

Article Search
On Optimization Modulo Theories, MaxSMT and Sorting Networks
Roberto Sebastiani and Patrick Trentin
(University of Trento, Italy)

Article Search Info
The Automatic Detection of Token Structures and Invariants Using SAT Checking
Pedro R. G. Antonino, Thomas Gibson-Robinson, and A. W. Roscoe
(Federal University of Pernambuco, Brazil; University of Oxford, UK)

Article Search

Quantitative Systems 2

Maximizing the Conditional Expected Reward for Reaching the Goal
Christel Baier, Joachim Klein, Sascha Klüppelholz, and Sascha Wunderlich
(TU Dresden, Germany)

Article Search
ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans
Anna Lukina, Lukas Esterle, Christian Hirsch, Ezio Bartocci, Junxing Yang, Ashish Tiwari, Scott A. Smolka, and Radu Grosu
(Vienna University of Technology, Austria; Stony Brook University, USA; SRI International, USA)

Article Search
FlyFast: A Mean Field Model Checker
Diego Latella, Michele Loreti, and Mieke Massink
(ISTI-CNR, Italy; University of Florence, Italy)

Article Search
ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations
Luca Cardelli, Mirco Tribastone, Max Tschaikowski, and Andrea Vandin
(Microsoft Research, UK; IMT School for Advanced Studies Lucca, Italy)

Article Search Info

Competition on Software Verification (SV-COMP)

Software Verification with Validation of Results (Report on SV-COMP 2017)
Dirk Beyer
(LMU Munich, Germany)

Article Search Info
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs (Competition Contribution)
Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, and Jürgen Giesl
(RWTH Aachen University, Germany)

Article Search
CPA-BAM-BnB: Block-Abstraction Memoization and Region-Based Memory Models for Predicate Abstractions (Competition Contribution)
Pavel Andrianov, Karlheinz Friedberger, Mikhail U. Mandrykin, Vadim S. Mutilin, and Anton Volkov
(ISP RAS, Russia; University of Passau, Germany)

Article Search
DepthK: A k-Induction Verifier Based on Invariant Inference for C Programs (Competition Contribution)
Williame Rocha, Herbert Rocha, Hussama Ismail, Lucas C. Cordeiro, and Bernd Fischer
(Federal University of Amazonas, Brazil; Federal University of Roraima, Brazil; University of Oxford, UK; Stellenbosch University, South Africa)

Article Search
Forester: From Heap Shapes to Automata Predicates (Competition Contribution)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, and Tomás Vojnar
(Brno University of Technology, Czech Republic)

Article Search Info
HipTNT+: A Termination and Non-termination Analyzer by Second-Order Abduction (Competition Contribution)
Ton Chanh Le, Quang-Trung Ta, and Wei-Ngan Chin
(National University of Singapore, Singapore)

Article Search
Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation (Competition Contribution)
Truc L. Nguyen, Omar Inverso, Bernd Fischer, Salvatore La Torre, and Gennaro Parlato
(University of Southampton, UK; Stellenbosch University, South Africa; University of Salerno, Italy)

Article Search
Skink: Static Analysis of Programs in LLVM Intermediate Representation (Competition Contribution)
Franck Cassez, Anthony M. Sloane, Matthew Roberts, Matthew Pigram, Pongsak Suvanpong, and Pablo González de Aledo Marugán
(Macquarie University, Australia; University of Cantabria, Spain)

Article Search
Symbiotic 4: Beyond Reachability (Competition Contribution)
Marek Chalupa, Martina Vitovská, Martin Jonáš, Jiri Slaby, and Jan Strejcek
(Masaryk University, Czech Republic)

Article Search
Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution)
Jan Mrázek, Martin Jonáš, Vladimír Štill, Henrich Lauko, and Jiří Barnat
(Masaryk University, Czech Republic)

Article Search
Ultimate Automizer with an On-Demand Construction of Floyd-Hoare Automata (Competition Contribution)
Matthias Heizmann, Yu-Wen Chen, Daniel Dietsch, Marius Greitschus, Alexander Nutz, Betim Musa, Claus Schätzle, Christian Schilling, Frank Schüssele, and Andreas Podelski
(University of Freiburg, Germany)

Article Search
Ultimate Taipan: Trace Abstraction and Abstract Interpretation (Competition Contribution)
Marius Greitschus, Daniel Dietsch, Matthias Heizmann, Alexander Nutz, Claus Schätzle, Christian Schilling, Frank Schüssele, and Andreas Podelski
(University of Freiburg, Germany)

Article Search
VeriAbs: Verification by Abstraction (Competition Contribution)
Bharti Chimdyalwar, Priyanka Darke, Avriti Chauhan, Punit Shah, Shrawan Kumar, and R. Venkatesh
(Tata Consultancy Services, India)

Article Search

proc time: 2.82