Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th CAV 2016: Toronto, ON, Canada
- Swarat Chaudhuri, Azadeh Farzan:
Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I. Lecture Notes in Computer Science 9779, Springer 2016, ISBN 978-3-319-41527-7
Probabilistic Systems
- Krishnendu Chatterjee, Hongfei Fu
, Amir Kafshdar Goharshady:
Termination Analysis of Probabilistic Programs Through Positivstellensatz's. 3-22 - Christel Baier, Stefan Kiefer, Joachim Klein, Sascha Klüppelholz, David Müller, James Worrell:
Markov Chains and Unambiguous Büchi Automata. 23-42 - Gilles Barthe, Thomas Espitau, Luis María Ferrer Fioriti, Justin Hsu:
Synthesizing Probabilistic Invariants via Doob's Decomposition. 43-61 - Timon Gehr, Sasa Misailovic, Martin T. Vechev:
PSI: Exact Symbolic Inference for Probabilistic Programs. 62-83 - Van Chan Ngo, Axel Legay, Vania Joloboff:
PSCV: A Runtime Verification Tool for Probabilistic SystemC Models. 84-91
Synthesis I
- Chih-Hong Cheng, Yassine Hamza, Harald Ruess:
Structural Synthesis for GXW Specifications. 95-117 - Bernd Finkbeiner, Felix Klein:
Bounded Cycle Synthesis. 118-135 - Tobias Klenze, Sam Bayless, Alan J. Hu:
Fast, Flexible, and Minimal CTL Synthesis via SMT. 136-156 - Roderick Bloem, Nicolas Braud-Santoni, Swen Jacobs:
Synthesis of Self-Stabilising and Byzantine-Resilient Distributed Systems. 157-176
Constraint Solving I
- Maximiliano Cristiá, Gianfranco Rossi:
A Decision Procedure for Sets, Binary Relations and Partial Functions. 179-198 - Aina Niemetz, Mathias Preiner, Armin Biere:
Precise and Complete Propagation Based Local Search for Satisfiability Modulo Theories. 199-217 - Minh-Thai Trinh, Duc-Hiep Chu, Joxan Jaffar:
Progressive Reasoning over Recursively-Defined Strings. 218-240 - Hung-En Wang, Tzung-Lin Tsai, Chun-Han Lin, Fang Yu, Jie-Hong R. Jiang:
String Analysis via Automata Manipulation with Logic Circuit Representation. 241-260 - Bishoksan Kafle, John P. Gallagher, José F. Morales:
Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. 261-268
Model Checking I
- Jakub Daniel, Alessandro Cimatti, Alberto Griggio, Stefano Tonetta, Sergio Mover:
Infinite-State Liveness-to-Safety via Implicit Abstraction and Well-Founded Relations. 271-291 - Michael Dooley, Fabio Somenzi:
Proving Parameterized Systems Safe by Generalizing Clausal Proofs of Small Instances. 292-309 - Fei He, Shu Mao, Bow-Yaw Wang:
Learning-Based Assume-Guarantee Regression Verification. 310-328 - Karam Abd Elkader, Orna Grumberg, Corina S. Pasareanu, Sharon Shoham:
Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement. 329-351 - Temesghen Kahsai, Philipp Rümmer, Huascar Sanchez, Martin Schäf:
JayHorn: A Framework for Verifying Java programs. 352-358
Program Analysis
- K. Rustan M. Leino, Clément Pit-Claudel:
Trigger Selection Strategies to Stabilize Program Verifiers. 361-381 - Quang Loc Le, Jun Sun, Wei-Ngan Chin:
Satisfiability Modulo Heap-Based Programs. 382-404 - Peter Müller, Malte Schwerhoff, Alexander J. Summers:
Automatic Verification of Iterated Separating Conjunctions Using Symbolic Execution. 405-425 - Roman Manevich, Boris Dogadov, Noam Rinetzky:
From Shape Analysis to Termination Analysis in Linear Time. 426-446 - Dwight Guth, Chris Hathhorn, Manasvi Saxena, Grigore Rosu:
RV-Match: Practical Semantics-Based Program Analysis. 447-453
Timed and Hybrid Systems
- Bai Xue, Zhikun She, Arvind Easwaran:
Under-Approximating Backward Reachable Sets by Polytopes. 457-476 - Parasara Sridhar Duggirala, Mahesh Viswanathan:
Parsimonious, Simulation Based Verification of Linear Systems. 477-494 - Pavithra Prabhakar, Miriam Garcia Soto:
Counterexample Guided Abstraction Refinement for Stability Analysis. 495-512 - Patricia Bouyer, Maximilien Colange, Nicolas Markey:
Symbolic Optimal Reachability in Weighted Timed Automata. 513-530 - Chuchu Fan, Bolun Qi, Sayan Mitra, Mahesh Viswanathan, Parasara Sridhar Duggirala:
Automatic Reachability Analysis for Nonlinear Hybrid Models with C2E2. 531-538
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-29 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
