ETAPS 2017
2017 European Joint Conferences on Theory and Practice of Software (ETAPS)

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

Phone Layout
No Pictures
Monday, April 24, 2017
Registration (Business)
08:00 – 08:30, Street Level
Opening
08:30 – 09:00, Stora Salen, 6th Floor
Opening
Joost-Pieter Katoen and Parosh Aziz Abdulla
(RWTH Aachen University, Germany; Uppsala University, Sweden)
Validation, Synthesis, and Optimization for Cyber-Physical Systems (Invited Talk)
09:00 – 10:00, Stora Salen, 6th Floor
Validation, Synthesis, and Optimization for Cyber-Physical Systems (Invited Talk)
Kim Guldstrand Larsen
(Aalborg University, Denmark)
Publisher's Version
Coffee Break
10:00 – 10:30, 3rd and 6th Floor
Coherence Spaces and Higher-Order Computation (FOSSACS)
10:30 – 12:30, Sal B
Information Flow (POST)
10:30 – 12:30, Sal C
Verification Techniques 1 (TACAS)
10:30 – 12:30, Stora Salen, 6th Floor
Coherence Spaces and Uniform Continuity
Kei Matsumoto
(Kyoto University, Japan)
Publisher's Version
Timing-Sensitive Noninterference through Composition
(MPI-SWS, Germany; Carnegie Mellon University, USA)
Publisher's Version Preprint Info
An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP
(CNRS, France; IRISA, France; Inria, France)
Publisher's Version Preprint Info
The Free Exponential Modality of Probabilistic Coherence Spaces
Raphaëlle Crubillé, Thomas Ehrhard, Michele Pagani, and Christine Tasson
(University of Paris Diderot, France)
Publisher's Version
Quantifying Vulnerability of Secret Generation Using Hyper-Distributions
(Federal University of Minas Gerais, Brazil; Carnegie Mellon University, USA; University of Maryland at College Park, USA)
Publisher's Version Preprint 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)
Publisher's Version Preprint
From Qualitative to Quantitative Semantics - By Change of Base
James Laird
(University of Bath, UK)
Publisher's Version
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)
Publisher's Version Preprint
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)
Publisher's Version Preprint Info
Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence
Ryoma Sin'Ya, Kazuyuki Asada, Naoki Kobayashi, and Takeshi Tsukada
(University of Tokyo, Japan)
Publisher's Version
Secure Multi-party Computation: Information Flow of Outputs and Game Theory
Patrick Ah-Fat and Michael Huth
(Imperial College London, UK)
Publisher's Version
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)
Publisher's Version Preprint
Lunch
12:30 – 14:00, Sal D, Street Level
Algebra and Coalgebra (FOSSACS)
14:00 – 16:00, Sal B
Security Protocols (POST)
14:00 – 16:00, Sal C
Verification Techniques 2 (TACAS)
14:00 – 16:00, Stora Salen, 6th Floor
Algebra, Coalgebra, and Minimization in Polynomial Differential Equations
Michele Boreale
(University of Florence, Italy)
Best-Paper Award Nominee
Publisher's Version Preprint Info
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)
Publisher's Version Preprint
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)
Publisher's Version Preprint Info
Equational Theories of Abnormal Termination Based on Kleene Algebra
Konstantinos Mamouras
(University of Pennsylvania, USA)
Publisher's Version
Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
(LORIA, France; CNRS, France; Inria, France; University of Lorraine, France; ETH Zurich, Switzerland)
Publisher's Version Preprint Info
Efficient Certified Resolution Proof Checking
(University of Southern Denmark, Denmark; University of Lisbon, Portugal)
Publisher's Version Preprint
Companions, Codensity and Causality
Damien Pous and Jurriaan Rot
(CNRS, France; ENS Lyon, France; Radboud University Nijmegen, Netherlands)
Publisher's Version Preprint
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)
Best-Paper Award Nominee
Publisher's Version Preprint Info
Precise Widening Operators for Proving Termination by Abstract Interpretation
Nathanaël Courant and Caterina Urban
(ENS, France; ETH Zurich, Switzerland)
Publisher's Version Preprint
Nominal Automata with Name Binding
Lutz Schröder, Dexter Kozen, Stefan Milius, and Thorsten Wißmann
(University of Erlangen-Nuremberg, Germany; Cornell University, USA)
Publisher's Version Preprint
A Survey of Attacks on Ethereum Smart Contracts (SoK)
Nicola Atzei, Massimo Bartoletti, and Tiziana Cimoli
(University of Cagliari, Italy)
Publisher's Version Preprint
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)
Publisher's Version Preprint
Coffee Break
16:00 – 16:30, 3rd and 6th Floor
Secure Composition of Security Protocols (Tutorial 1)
16:30 – 18:00, Stora Salen, 6th Floor
Learning (TACAS)
16:30 – 18:00, Sal B
Secure Composition of Security Protocols (Tutorial 1)
Veronique Cortier
(CNRS, France)
Learning Symbolic Automata
(University of Wisconsin-Madison, USA)
Best-Paper Award Nominee
Publisher's Version Preprint
ML for ML: Learning Cost Semantics by Experiment
Ankush Das and Jan Hoffmann
(Carnegie Mellon University, USA)
Publisher's Version Preprint 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)
Publisher's Version Preprint
Reception
18:30 – 22:00, 6th Floor
Tuesday, April 25, 2017
The Facebook Infer Static Analyser (Invited Talk)
09:00 – 10:00, Stora Salen, 6th Floor
The Facebook Infer Static Analyser (Invited Talk)
Dino Distefano
(Facebook, UK)
Coffee Break
10:00 – 10:30, 3rd and 6th Floor
Games and Automata (FOSSACS)
10:30 – 12:30, Sal B
Security Policies (POST)
10:30 – 12:30, Sal C
Synthesis 1 (TACAS)
10:30 – 12:30, Stora Salen, 6th Floor
On the Existence of Weak Subgame Perfect Equilibria
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, and Jean-François Raskin
(University of Mons, Belgium; Université Libre de Bruxelles, Belgium)
Publisher's Version Preprint
Security Analysis of Cache Replacement Policies
Pablo Cañones, Boris Köpf, and Jan Reineke
(IMDEA Software Institute, Spain; Saarland University, Germany)
Best-Paper Award Nominee
Publisher's Version Preprint
Hierarchical Network Formation Games
(Hebrew University of Jerusalem, Israel; Interdisciplinary Center, Israel)
Publisher's Version Preprint
Optimal Reachability in Divergent Weighted Timed Games
Damien Busatto-Gaston, Benjamin Monmege, and Pierre-Alain Reynier
(Aix-Marseille University, France; LIF, France; CNRS, France)
Publisher's Version
Model Checking Exact Cost for Attack Scenarios
Zaruhi Aslanyan and Flemming Nielson
(DTU, Denmark)
Publisher's Version
Synthesis of Recursive ADT Transformers from Reusable Templates
(Massachusetts Institute of Technology, USA; Purdue University, USA; Northeastern University, USA)
Publisher's Version Preprint
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)
Publisher's Version Preprint
Postulates for Revocation Schemes
(University of Luxembourg, Luxembourg)
Publisher's Version Preprint Info
Counterexample-Guided Model Synthesis
Mathias Preiner, Aina Niemetz, and Armin Biere
(JKU Linz, Austria)
Publisher's Version Preprint Info
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)
Publisher's Version Preprint
Defense in Depth Formulation and Usage in Dynamic Access Control
Ridha Khedri, Owain Jones, and Mohammed Alabbad
(McMaster University, Canada; CMC Microsystems, Canada)
Publisher's Version Preprint
Interpolation-Based GR(1) Assumptions Refinement
Davide G. Cavezza and Dalal Alrajeh
(Imperial College London, UK)
Publisher's Version Preprint Info
Lunch
12:30 – 14:00, Sal D, Street Level
Probabilistic Programming (ESOP)
14:00 – 16:00, Sal B
Automata, Logic, and Formal Languages (FOSSACS)
14:00 – 16:00, Sal C
Information Leakage (POST)
14:00 – 16:00, K3+K4
Synthesis 2 (TACAS)
14:00 – 16:00, Stora Salen, 6th Floor
Commutative Semantics for Probabilistic Programming
(University of Oxford, UK)
Best-Paper Award Nominee
Publisher's Version Preprint
Degree of Sequentiality of Weighted Automata
Laure Daviaud, Ismaël Jecker, , and Didier Villevalois
(University of Warsaw, Poland; Université Libre de Bruxelles, Belgium; Aix-Marseille University, France)
Publisher's Version
Compositional Synthesis of Leakage Resilient Programs
Arthur Blot, Masaki Yamamoto, and Tachio Terauchi
(ENS Lyon, France; Nagoya University, Japan; JAIST, Japan)
Best-Paper Award Nominee
Publisher's Version
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)
Publisher's Version Preprint
Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring
Ryan Culpepper and Andrew Cobb
(Northeastern University, USA)
Best-Paper Award Nominee
Publisher's Version
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)
Publisher's Version
Combining Differential Privacy and Mutual Information for Analyzing Leakages in Workflows
Martin Pettai and Peeter Laud
(Cybernetica, Estonia)
Publisher's Version
Scaling Enumerative Program Synthesis via Divide and Conquer
Rajeev Alur, Arjun Radhakrishna, and Abhishek Udupa
(University of Pennsylvania, USA)
Publisher's Version
Metric Reasoning About λ-Terms: The General Case
Raphaëlle Crubillé and Ugo Dal Lago
(University of Paris Diderot, France; University of Bologna, Italy)
Publisher's Version
Partial Derivatives for Context-Free Languages - From μ-Regular Expressions to Pushdown Automata
Peter Thiemann
(University of Freiburg, Germany)
Publisher's Version
Towards Parallel Boolean Functional Synthesis
S. Akshay, Supratik Chakraborty, Ajith K. John, and Shetal Shah
(IIT Bombay, India; BARC, India)
Publisher's Version Preprint
Probabilistic Termination by Monadic Affine Sized Typing
(University of Bologna, Italy; University of Paris Diderot, France)
Publisher's Version Preprint Info
Dynamic Complexity of the Dyck Reachability
Patricia Bouyer and Vincent Jugé
(CNRS, France; ENS Cachan, France; University of Paris-Saclay, France)
Publisher's Version
Encodings of Bounded Synthesis
Peter Faymonville, Bernd Finkbeiner, Markus N. Rabe, and Leander Tentrup
(Saarland University, Germany; University of California at Berkeley, USA)
Publisher's Version
Coffee Break
16:00 – 16:30, 3rd and 6th Floor
Issues in Ethical Data Management (Public Lecture)
16:30 – 18:00, Stora Salen, 6th Floor
Issues in Ethical Data Management (Public Lecture)
Serge Abiteboul
(INRIA, France)
ETAPS SC Meeting and Dinner (Business)
18:30 – 23:00, Hotel Villa Anna, Odinslund 3
Wednesday, April 26, 2017
Graph Rewriting (ESOP)
09:00 – 10:00, Sal B
Learning and Inference (FASE)
09:00 – 10:00, K3+K4
Proof Theory (FOSSACS)
09:00 – 10:00, Sal C
Tools (TACAS)
09:00 – 10:00, Stora Salen, 6th Floor
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)
Publisher's Version
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)
Publisher's Version Preprint Info
Cyclic Arithmetic Is Equivalent to Peano Arithmetic
Alex Simpson
(University of Ljubljana, Slovenia)
Best-Paper Award Nominee
Publisher's Version
HQSpre - An Effective Preprocessor for QBF and DQBF
Ralf Wimmer, Sven Reimer, Paolo Marin, and Bernd Becker
(University of Freiburg, Germany)
Publisher's Version Preprint
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)
Publisher's Version Preprint
Bordeaux: A Tool for Thinking Outside the Box
Vajih Montaghami and Derek Rayside
(University of Waterloo, Canada)
Publisher's Version
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)
Best-Paper Award Nominee
Publisher's Version
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)
Publisher's Version Preprint
autoCode4: Structural Controller Synthesis
Chih-Hong Cheng, Edward A. Lee, and Harald Ruess
(fortiss, Germany; University of California at Berkeley, USA)
Publisher's Version Video
Coffee Break
10:00 – 10:30, 3rd and 6th Floor
Concurrency (ESOP)
10:30 – 12:30, Sal B
Test Selection (FASE)
10:30 – 12:30, K3+K4
Probability (FOSSACS)
10:30 – 12:30, Sal C
Automata (TACAS)
10:30 – 12:30, Stora Salen, 6th Floor
Abstract Specifications for Concurrent Maps
(Imperial College London, UK)
Publisher's Version Preprint Info
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)
Publisher's Version Preprint
On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context
(Google, USA; University of Oxford, UK)
Publisher's Version Preprint
Lazy Automata Techniques for WS1S
Tomas Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, and Tomás Vojnar
(Brno University of Technology, Czech Republic)
Publisher's Version Preprint Info
Caper - Automatic Verification for Fine-Grained Concurrency
(Aarhus University, Denmark; Imperial College London, UK)
Publisher's Version Preprint Video Info
Selective Bisection Debugging
Ripon Saha and Milos Gligoric
(Fujitsu Labs, USA; University of Texas at Austin, USA)
Publisher's Version
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)
Publisher's Version Preprint
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)
Publisher's Version Preprint
Observed Communication Semantics for Classical Processes
(University of Strathclyde, UK)
Publisher's Version Preprint
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)
Publisher's Version Preprint Info
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)
Publisher's Version Preprint
Index Appearance Record for Transforming Rabin Automata into Parity Automata
Jan Kretínský, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger
(TU Munich, Germany)
Publisher's Version Preprint
Tackling Real-Life Relaxed Concurrency with FSL++
(MPI-SWS, Germany)
Publisher's Version Preprint Info
On Higher-Order Probabilistic Subrecursion
Flavien Breuvart, Ugo Dal Lago, and Agathe Herrou
(Inria, France; University of Bologna, Italy; ENS Lyon, France)
Publisher's Version Preprint
Minimization of Visibly Pushdown Automata Using Partial Max-SAT
(University of Freiburg, Germany)
Publisher's Version Preprint
Lunch
12:30 – 14:00, Sal D, Street Level
Language Design (ESOP)
14:00 – 16:00, Sal B
Semantics and Category Theory (FOSSACS)
14:00 – 16:00, Sal C
Concurrency and Bisimulation (TACAS)
14:00 – 16:00, Stora Salen, 6th Floor
APLicative Programming with Naperian Functors
(University of Oxford, UK)
Publisher's Version Preprint Info
A Light Modality for Recursion
(University of Leicester, UK)
Best-Paper Award Nominee
Publisher's Version Preprint
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)
Publisher's Version Preprint
Disjoint Polymorphism
João Alpuim, Bruno C. d. S. Oliveira, and Zhiyuan Shi
(University of Hong Kong, China)
Publisher's Version
Unifying Guarded and Unguarded Iteration
Sergey Goncharov, Lutz Schröder, Christoph Rauch, and Maciej Piróg
(University of Erlangen-Nuremberg, Germany; KU Leuven, Belgium)
Publisher's Version Preprint
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)
Publisher's Version
Extensible Datasort Refinements
(University of British Columbia, Canada)
Publisher's Version Preprint
Partiality, Revisited - The Partiality Monad as a Quotient Inductive-Inductive Type
(University of Nottingham, UK; University of Gothenburg, Sweden; Chalmers University of Technology, Sweden)
Publisher's Version
Forward Bisimulations for Nondeterministic Symbolic Finite Automata
(University of Wisconsin-Madison, USA; Microsoft Research, USA)
Publisher's Version Preprint
The Essence of Functional Programming on Semantic Data
(University of Koblenz-Landau, Germany; University of Southampton, UK)
Publisher's Version
On the Semantics of Intensionality
(University of Oxford, UK)
Publisher's Version Preprint
Up-To Techniques for Weighted Systems
Filippo Bonchi, Barbara König, and Sebastian Küpper
(ENS Lyon, France; University of Duisburg-Essen, Germany)
Publisher's Version Preprint
Coffee Break
16:00 – 16:30, 3rd and 6th Floor
Verification (ESOP)
16:30 – 18:00, Sal B
Lambda Calculus and Constructive Proof (FOSSACS)
16:30 – 18:00, Sal C
Hybrid Systems (TACAS)
16:30 – 18:00, Stora Salen, 6th Floor
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)
Publisher's Version Preprint
A Lambda-Free Higher-Order Recursive Path Order
, Uwe Waldmann, and Daniel Wand
(Inria, France; LORIA, France; Max Planck Institute for Informatics, Germany)
Publisher's Version Preprint
Rigorous Simulation-Based Analysis of Linear Hybrid Systems
Stanley Bak and Parasara Sridhar Duggirala
(Air Force Research Lab, USA; University of Connecticut, USA)
Publisher's Version Preprint Video Info
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)
Publisher's Version
Automated Constructivization of Proofs
Frédéric Gilbert
(École des Ponts ParisTech, France; Inria, France; CEA LIST, France)
Publisher's Version
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)
Publisher's Version
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)
Publisher's Version
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)
Publisher's Version Preprint
Conference Banquet
19:00 – 22:00, Uppsala Castle
Thursday, April 27, 2017
Natural Language is a Programming Language (Invited Talk)
09:00 – 10:00, Stora Salen, 6th Floor
Natural Language is a Programming Language (Invited Talk)
Michael Ernst
(University of Washington, USA)
Coffee Break
10:00 – 10:30, 3rd and 6th Floor
Automated Verification (ESOP)
10:30 – 12:30, Sal B
Program and System Analysis (FASE)
10:30 – 12:30, K3+K4
Concurrency (FOSSACS)
10:30 – 12:30, Sal C
Security (TACAS)
10:30 – 12:30, Stora Salen, 6th Floor
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)
Publisher's Version Preprint Info
Inference and Evolution of TypeScript Declaration Files
(Aarhus University, Denmark)
Best-Paper Award Nominee
Publisher's Version Preprint Info
A Truly Concurrent Game Model of the Asynchronous π-Calculus
Ken Sakayori and Takeshi Tsukada
(University of Tokyo, Japan)
Publisher's Version
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)
Best-Paper Award Nominee
Publisher's Version
Faster Algorithms for Weighted Recursive State Machines
Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis
(IST Austria, Austria; IIT Bombay, India)
Publisher's Version Preprint
Explicit Connection Actions in Multiparty Session Types
Raymond Hu and Nobuko Yoshida
(Imperial College London, UK)
Publisher's Version
Local Model Checking in a Logic for True Concurrency
(University of Padua, Italy)
Publisher's Version Preprint
Discriminating Traces with Time
Saeid Tizpaz-Niari, Pavol Cerný, Bor-Yuh Evan Chang, Sriram Sankaranarayanan, and Ashutosh Trivedi
(University of Colorado at Boulder, USA)
Publisher's Version Preprint
ML and Extended Branching VASS
Conrad Cotton-Barratt, Andrzej S. Murawski, and C.-H. Luke Ong
(University of Oxford, UK; University of Warwick, UK)
Publisher's Version Preprint
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)
Publisher's Version Preprint Info
The Paths to Choreography Extraction
Luís Cruz-Filipe, Kim S. Larsen, and Fabrizio Montesi
(University of Southern Denmark, Denmark)
Publisher's Version Preprint
Directed Automated Memory Performance Testing
(Saarland University, Germany)
Publisher's Version Preprint Info
Modular Verification of Higher-Order Functional Programs
(University of Tokyo, Japan)
Publisher's Version
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)
Best-Paper Award Nominee
Publisher's Version Preprint Video Info
On the Undecidability of Asynchronous Session Subtyping
Julien Lange and Nobuko Yoshida
(Imperial College London, UK)
Publisher's Version Preprint
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)
Best-Paper Award Nominee
Publisher's Version Preprint
Lunch
12:30 – 14:00, Sal D, Street Level
Theorem Proving (ESOP)
14:00 – 16:00, Sal B
Graph Modelling and Transformation (FASE)
14:00 – 16:00, Sal C
Competition on Software Verification (SV-COMP) (TACAS)
14:00 – 16:00, Stora Salen, 6th Floor
Comprehending Isabelle/HOL's Consistency
Ondřej Kunčar and Andrei Popescu
(TU Munich, Germany; Middlesex University, UK)
Publisher's Version Preprint
StaticGen: Static Generation of UML Sequence Diagrams
Chris Alvin, Brian Peterson, and Supratik Mukhopadhyay
(Bradley University, USA; Louisiana State University, USA)
Publisher's Version
Software Verification with Validation of Results (Report on SV-COMP 2017)
(LMU Munich, Germany)
Publisher's Version Preprint Info
Friends with Benefits - Implementing Corecursion in Foundational Proof Assistants
(Inria, France; LORIA, France; Max Planck Institute for Informatics, Germany; École Polytechnique, France; ETH Zurich, Switzerland; Middlesex University, UK)
Publisher's Version Preprint Info
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)
Publisher's Version
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)
Publisher's Version Preprint
Generalizing Inference Systems by Coaxioms
Davide Ancona, Francesco Dagnino, and Elena Zucca
(University of Genoa, Italy)
Publisher's Version Preprint Info
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)
Publisher's Version
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)
Publisher's Version
Verified Characteristic Formulae for CakeML
(ENS Lyon, France; Chalmers University of Technology, Sweden; Data61 at CSIRO, Australia)
Publisher's Version Preprint
Symbolic Model Generation for Graph Properties
Sven Schneider, Leen Lambers, and Fernando Orejas
(HPI, Germany; Universitat Politècnica de Catalunya, Spain)
Publisher's Version
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)
Publisher's Version Preprint
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)
Publisher's Version Preprint 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)
Publisher's Version
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)
Publisher's Version
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)
Publisher's Version
Symbiotic 4: Beyond Reachability (Competition Contribution)
Marek Chalupa, Martina Vitovská, Martin Jonáš, Jiri Slaby, and Jan Strejcek
(Masaryk University, Czech Republic)
Publisher's Version Preprint
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)
Publisher's Version
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)
Publisher's Version
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)
Publisher's Version
VeriAbs: Verification by Abstraction (Competition Contribution)
Bharti Chimdyalwar, Priyanka Darke, Avriti Chauhan, Punit Shah, Shrawan Kumar, and R. Venkatesh
(Tata Consultancy Services, India)
Publisher's Version
Coffee Break
16:00 – 16:30, 3rd and 6th Floor
Compositional Testing (Tutorial)
16:30 – 18:00, Stora Salen, 6th Floor
Run-Time Verification and Logic (TACAS)
16:30 – 18:00, Sal B
Compositional Testing (Tutorial)
Ken McMillan
(Microsoft Research, USA)
Rewriting-Based Runtime Verification of Alternation-Free HyperLTL
Noel Brett, Umair Siddique, and Borzoo Bonakdarpour
(McMaster University, Canada)
Publisher's Version
Almost Event-Rate Independent Monitoring of Metric Temporal Logic
David A. Basin, Bhargav Nagaraja Bhatt, and Dmitriy Traytel
(ETH Zurich, Switzerland)
Publisher's Version Preprint
Optimal Translation of LTL to Limit Deterministic Automata
Dileep Kini and Mahesh Viswanathan
(University of Illinois at Urbana-Champaign, USA)
Publisher's Version Preprint Info
Friday, April 28, 2017
Fundamental Algorithmic Problems and Challenges in Dynamical and Cyber-Physical Systems (Invited Talk)
09:00 – 10:00, Stora Salen, 6th Floor
Fundamental Algorithmic Problems and Challenges in Dynamical and Cyber-Physical Systems (Invited Talk)
Joel Ouaknine
(University of Oxford, UK)
Coffee Break
10:00 – 10:30, 3rd and 6th Floor
Separation Logic (ESOP)
10:30 – 12:30, Sal B
Model Transformations (FASE)
10:30 – 12:30, Sal C
Quantitative Systems 1 (TACAS)
10:30 – 12:30, Stora Salen, 6th Floor
A Higher-Order Logic for Concurrent Termination-Preserving Refinement
Joseph Tassarotti, Ralf Jung, and Robert Harper
(Carnegie Mellon University, USA; MPI-SWS, Germany)
Publisher's Version Preprint
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)
Publisher's Version Preprint
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)
Publisher's Version Preprint
Temporary Read-Only Permissions for Separation Logic
(Inria, France)
Publisher's Version Preprint Info
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)
Publisher's Version Preprint
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)
Publisher's Version
The Essence of Higher-Order Concurrent Separation Logic
(Delft University of Technology, Netherlands; MPI-SWS, Germany; Aarhus University, Denmark)
Publisher's Version Preprint
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)
Publisher's Version Info
Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults
(IST Austria, Austria; IIT Bombay, India; Mälardalen University, Sweden)
Publisher's Version Preprint Info
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)
Publisher's Version Preprint
A Deductive Approach for Fault Localization in ATL Model Transformations
(AtlanMod, France)
Best-Paper Award Nominee
Publisher's Version Preprint Video Info
Long-Run Rewards for Markov Automata
(Saarland University, Germany; University of Freiburg, Germany)
Publisher's Version Preprint Info
Lunch
12:30 – 14:00, Sal D, Street Level
Session Types (ESOP)
14:00 – 16:00, Sal B
Configuration and Synthesis (FASE)
14:00 – 16:00, Sal C
SAT and SMT (TACAS)
14:00 – 16:00, Stora Salen, 6th Floor
Context-Free Session Type Inference
(University of Turin, Italy)
Best-Paper Award Nominee
Publisher's Version Preprint Info
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)
Publisher's Version 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)
Publisher's Version Info
Linearity, Control Effects, and Behavioural Types
Luis Caires and Jorge A. Pérez
(Nova University of Lisbon, Portugal; University of Groningen, Netherlands)
Publisher's Version
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)
Publisher's Version
Congruence Closure with Free Variables
(LORIA, France; Inria, France; University of Lorraine, France; University of Iowa, USA)
Publisher's Version Preprint
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)
Publisher's Version
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)
Publisher's Version Preprint Info
On Optimization Modulo Theories, MaxSMT and Sorting Networks
Roberto Sebastiani and Patrick Trentin
(University of Trento, Italy)
Publisher's Version Preprint Info
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)
Publisher's Version Preprint
Slicing from Formal Sematics: Chisel
Adrián Riesco, Irina Mariuca Asavoae, and Mihail Asavoae
(Complutense University of Madrid, Spain; Inria, France)
Publisher's Version Preprint 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)
Publisher's Version
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)
Publisher's Version Preprint Video Info
Coffee Break
16:00 – 16:30, 3rd and 6th Floor
Type Theory (ESOP)
16:30 – 18:00, Sal B
Software Product Lines (FASE)
16:30 – 18:00, Sal C
Quantitative Systems 2 (TACAS)
16:30 – 18:00, Stora Salen, 6th Floor
A Classical Sequent Calculus with Dependent Types
Étienne Miquey
(Inria, France; IRIF, France; University of Paris Diderot, France; University of the Republic, Uruguay)
Publisher's Version
Family-Based Model Checking with mCRL2
(ISTI-CNR, Italy; Eindhoven University of Technology, Netherlands)
Publisher's Version
Maximizing the Conditional Expected Reward for Reaching the Goal
Christel Baier, Joachim Klein, Sascha Klüppelholz, and Sascha Wunderlich
(TU Dresden, Germany)
Publisher's Version Preprint
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)
Publisher's Version
Variability-Specific Abstraction Refinement for Family-Based Model Checking
(IT University of Copenhagen, Denmark)
Publisher's Version Preprint
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)
Publisher's Version Preprint
Programs Using Syntax with First-Class Binders
Francisco Ferreira and Brigitte Pientka
(McGill University, Canada)
Publisher's Version
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)
Publisher's Version
FlyFast: A Mean Field Model Checker
Diego Latella, Michele Loreti, and Mieke Massink
(ISTI-CNR, Italy; University of Florence, Italy)
Publisher's Version
ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations
(Microsoft Research, UK; IMT School for Advanced Studies Lucca, Italy)
Publisher's Version Preprint Info

Time stamp: 2018-12-10T05:57:22+01:00