View to Theatiner Church. Photo: Helmut Seidl

SAS 2014

21st International Static Analysis Symposium

8:50-10:00 Welcome and Invited Talk (Chair: Helmut Seidl)

Dynamic Program Verification
Patrice Godefroid (Microsoft Research, Redmond, USA)

Coffee break

10:30-12:00 Domains (Chair: Xavier Rival)

An Abstract Domain to Infer Octagonal Constraints with Absolute Value
Liqian Chen, Jiangchao Liu, Antoine Miné, Deepak Kapur, and Ji Wang
Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations
Khalil Ghorbal, Andrew Sogokon, and André Platzer
A Decision Tree Abstract Domain for Proving Conditional Termination
Caterina Urban and Antoine Miné

Lunch break

13:30-15:00 Verification (Chair: Luke Ong)

Verifying Recursive Programs using Intraprocedural Analyzers
Yu-Fang Chen, Chiao Hsieh, Ming-Hsien Tsai, Bow-Yaw Wang, and Farn Wang
On Program Equivalence with Reductions
Guillaume Iooss, Christophe Alias, and Sanjay Rajopadhye
Block Me If You Can! (Context-Sensitive Parameterized Verification)
Parosh Aziz Abdulla, Lukas Holik, and Frédéric Haziza

Coffee break

15:30-17:00 Pointers & Heaps (Chair: Alan Mycroft)

Sparse Dataflow Analysis with Pointers and Reachability
Magnus Madsen and Anders Møller
Region-based Selective Flow-Sensitive Pointer Analysis
Sen Ye, Yulei Sui, and Jingling Xue
An Abstract Domain Combinator for Separately Conjoining Memory Abstractions
Antoine Toubhans, Bor-Yuh Evan Chang, and Xavier Rival

9:00-10:00 Invited Talk (Chair: Markus Müller-Olm)

Higher-Order Model Checking: From Theory to Practice
Luke Ong (University of Oxford, UK)

Coffee break

10:30-12:00 Concurrency (Chair: Patrice Godefroid)

Reactivity of Cooperative Systems
Louis Mandel and Cédric Pasteur
Synthesis of Memory Fences via Refinement Propagation
Yuri Meshman, Andrei Marian Dan, Martin Vechev, and Eran Yahav
Peak Cost Analysis of Distributed Systems
Elvira Albert, Jesús Correas Fernández, and Guillermo Román-Díez

Lunch break

13:30-14:30 Miscellaneous (Chair: Tomáš Vojnar)

A Progress Bar for Static Analyzers
Woosuk Lee, Hakjoo Oh, and Kwangkeun Yi
Cost-aware Automatic Program Repair
Roopsha Samanta, Oswaldo Olivo, and E. Allen Emerson

16:15 Guided tour at Lenbachhaus (how to get there)

9:00-10:00 Invited Talk (Chair: Anders Møller)

Fully Automated Shape Analysis Based on Forest Automata with Data Constraints
Tomáš Vojnar (Brno University of Technology, Czech Republic)

Coffee break

10:30-12:00 Heaps & Objects (Chair: Gregor Snelting)

SawjaCard: a Static Analysis Tool for Certifying Java Card Applications
Frédéric Besson, Thomas Jensen, and Pierre Vittet
Automatic Analysis of Open Objects in Dynamic Language Programs
Arlen Cox, Bor-Yuh Evan Chang, and Xavier Rival
Cyclic Abduction of Inductively Defined Safety and Termination Preconditions
James Brotherston and Nikos Gorogiannis

Lunch break

13:30-15:00 Fixpoints (Chair: Axel Simon)

Speeding up Logico-numerical Strategy Iteration
David Monniaux and Peter Schrammel
Backward Analysis via Over-Approximate Abstraction and Under-Approximate Subtraction
Alexey Bakhirkin, Josh Berdine, and Nir Piterman
Expectation Invariants for Probabilistic Program Loops as Fixed Points
Aleksandar Chakarov and Sriram Sankaranarayanan

Back to main page.