Computer aided verification : 28th International conference, CAV 2016, Toronto, ON, USA, July 17-23, 2016 : proceedings. Swarat Chaudhuri, Azadeh Farzan(eds.). Part I /
"The two-volume set LNCS 9779 and LNCS 9780 constitutes the refereed proceedings of the 28th International Conference on Computer Aided Verification, CAV 2016, held in Toronto, ON, USA, in July 2016.The total of 46 full and 12 short papers presented in the proceedings was carefully reviewed...
Saved in:
| Corporate Author: | |
|---|---|
| Other Authors: | , |
| Format: | Ebook |
| Language: | English |
| Published: |
Switzerland :
Springer,
2016.
|
| Series: | Lecture notes in computer science ;
9779. LNCS sublibrary. Theoretical computer science and general issues |
| Subjects: | |
| Online Access: | Springer eBooks |
Table of Contents:
- Probabilistic Systems:
- Termination Analysis of Probabilistic Programs Through Positivstellensatz’s / Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady
- Markov Chains and Unambiguous Büchi Automata / Christel Baier, Stefan Kiefer, Joachim Klein, Sascha Klüppelholz, David Müller, James Worrell
- Synthesizing Probabilistic Invariants via Doob’s Decomposition / Gilles Barthe, Thomas Espitau, Luis María Ferrer Fioriti, Justin Hsu
- PSI: Exact Symbolic Inference for Probabilistic Programs / Timon Gehr, Sasa Misailovic, Martin Vechev
- PSCV: A Runtime Verification Tool for Probabilistic SystemC Models / Van Chan Ngo, Axel Legay, Vania Joloboff
- Synthesis I:
- Structural Synthesis for GXW Specifications / Chih-Hong Cheng, Yassine Hamza, Harald Ruess
- Bounded Cycle Synthesis / Bernd Finkbeiner, Felix Klein
- Fast, Flexible, and Minimal CTL Synthesis via SMT / Tobias Klenze, Sam Bayless, Alan J. Hu
- Synthesis of Self-Stabilising and Byzantine-Resilient Distributed Systems / Roderick Bloem, Nicolas Braud-Santoni, Swen Jacobs
- Constraint Solving I:
- A Decision Procedure for Sets, Binary Relations and Partial Functions / Maximiliano Cristiá, Gianfranco Rossi
- Precise and Complete Propagation Based Local Search for Satisfiability Modulo Theories / Aina Niemetz, Mathias Preiner, Armin Biere
- Progressive Reasoning over Recursively-Defined Strings / Minh-Thai Trinh, Duc-Hiep Chu, Joxan Jaffar
- String Analysis via Automata Manipulation with Logic Circuit Representation / Hung-En Wang, Tzung-Lin Tsai, Chun-Han Lin, Fang Yu, Jie-Hong R. Jiang
- Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata / Bishoksan Kafle, John P. Gallagher, José F. Morales
- Model Checking I:
- Infinite-State Liveness-to-Safety via Implicit Abstraction and Well-Founded Relations / Jakub Daniel, Alessandro Cimatti, Alberto Griggio, Stefano Tonetta, Sergio Mover
- Proving Parameterized Systems Safe by Generalizing Clausal Proofs of Small Instances / Michael Dooley, Fabio Somenzi
- Learning-Based Assume-Guarantee Regression Verification / Fei He, Shu Mao, Bow-Yaw Wang
- Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement / Karam Abd Elkader, Orna Grumberg, Corina S. Păsăreanu, Sharon Shoham
- JayHorn: A Framework for Verifying Java programs / Temesghen Kahsai, Philipp Rümmer, Huascar Sanchez, Martin Schäf
- Program Analysis:
- Trigger Selection Strategies to Stabilize Program Verifiers / K. R. M. Leino, Clément Pit-Claudel
- Satisfiability Modulo Heap-Based Programs / Quang Loc Le, Jun Sun, Wei-Ngan Chin
- Automatic Verification of Iterated Separating Conjunctions Using Symbolic Execution / Peter Müller, Malte Schwerhoff, Alexander J. Summers
- From Shape Analysis to Termination Analysis in Linear Time / Roman Manevich, Boris Dogadov, Noam Rinetzky
- RV-Match: Practical Semantics-Based Program Analysis / Dwight Guth, Chris Hathhorn, Manasvi Saxena, Grigore Roşu
- Timed and Hybrid Systems:
- Under-Approximating Backward Reachable Sets by Polytopes / Bai Xue, Zhikun She, Arvind Easwaran
- Parsimonious, Simulation Based Verification of Linear Systems / Parasara Sridhar Duggirala, Mahesh Viswanathan
- Counterexample Guided Abstraction Refinement for Stability Analysis / Pavithra Prabhakar, Miriam García Soto
- Symbolic Optimal Reachability in Weighted Timed Automata / Patricia Bouyer, Maximilien Colange, Nicolas Markey
- Automatic Reachability Analysis for Nonlinear Hybrid Models with C2E2 / Chuchu Fan, Bolun Qi, Sayan Mitra, Mahesh Viswanathan, Parasara Sridhar Duggirala.