ETAPS 2017: 22-29 April 2017, Uppsala, Sweden

ETAPS 2017 Tuesday

Tuesday, April 25, 2017

09:00 – 10:00, Stora Salen, 6th Floor
Invited Talk: The Facebook Infer Static Analyser
Dino Distefano
(Facebook, UK)

Coffee Break
10:00 – 10:30, 3rd and 6th Floor

Games and Automata (FOSSACS)
10:30 – 12:30, Sal B
Session chair: Javier Esparza
Security Policies (POST)
10:30 – 12:30, Sal C
Session chair: Peeter Laud
Synthesis 1 (TACAS)
10:30 – 12:30, Stora Salen, 6th Floor
Session chair: Susanne Graf
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
Orna Kupferman and Tami Tamir
(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

12:30 – 14:00, Sal D, Street Level

Probabilistic Programming (ESOP)
14:00 – 16:00, Sal B
Session chair: Robert Atkey
Automata, Logic, and Formal Languages (FOSSACS)
14:00 – 16:00, Sal C

Session chair: Margus Veanes
Information Leakage (POST)
14:00 – 16:00, K3+K4
Session chair: Willard Rafnsson
Synthesis 2 (TACAS)
14:00 – 16:00, Stora Salen, 6th Floor
Session chair: Jan Kretinski
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
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

16:30 – 18:00, Stora Salen, 6th Floor
Public Lecture: Issues in Ethical Data Management
Serge Abiteboul
(INRIA, France)

ETAPS SC Meeting and Dinner (Business)
18:30 – 23:00, Hotel Villa Anna, Odinslund 3