Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCID30th CAV 2018: Oxford, UK
- Hana Chockler, Georg Weissenbacher:
Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part I. Lecture Notes in Computer Science 10981, Springer 2018, ISBN 978-3-319-96144-6
Invited Papers
- Tommaso Dreossi, Somesh Jha, Sanjit A. Seshia:
Semantic Adversarial Deep Learning. 3-26 - Eran Yahav:
From Programs to Interpretable Deep Models and Back. 27-37 - Byron Cook:
Formal Reasoning About the Security of Amazon Web Services. 38-47
Tutorials
- Ilya Grishchenko, Matteo Maffei, Clara Schneidewind:
Foundations and Tools for the Static Analysis of Ethereum Smart Contracts. 51-78 - Bernhard Kragl
, Shaz Qadeer:
Layered Concurrent Programs. 79-102
Model Checking
- Yuki Satake, Hiroshi Unno:
Propositional Dynamic Logic for Higher-Order Functional Programs. 105-123 - Grigory Fedyukovich, Yueling Zhang, Aarti Gupta:
Syntax-Guided Termination Analysis. 124-143 - Bernd Finkbeiner, Christopher Hahn, Hazem Torfah:
Model Checking Quantitative Hyperproperties. 144-163 - Lauren Pick, Grigory Fedyukovich, Aarti Gupta:
Exploiting Synchrony and Symmetry in Relational Verification. 164-182 - Lucas C. Cordeiro, Pascal Kesseli, Daniel Kroening, Peter Schrammel, Marek Trtík:
JBMC: A Bounded Model Checking Tool for Verifying Java Bytecode. 183-190 - Kenneth L. McMillan:
Eager Abstraction for Symbolic Model Checking. 191-208
Program Analysis Using Polyhedra
- Gagandeep Singh, Markus Püschel, Martin T. Vechev:
Fast Numerical Program Analysis with Reinforcement Learning. 211-229 - Anna Becchi, Enea Zaffanella:
A Direct Encoding for NNC Polyhedra. 230-248
Synthesis
- S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah:
What's Hard About Boolean Functional Synthesis? 251-269 - Alessandro Abate, Cristina David, Pascal Kesseli, Daniel Kroening, Elizabeth Polgreen:
Counterexample Guided Inductive Synthesis Modulo Theories. 270-288 - Bernd Finkbeiner, Christopher Hahn, Philip Lukert, Marvin Stenger, Leander Tentrup:
Synthesizing Reactive Systems from Hyperproperties. 289-306 - Daniel J. Fremont, Sanjit A. Seshia:
Reactive Control Improvisation. 307-326 - Aws Albarghouthi, Justin Hsu:
Constraint-Based Synthesis of Coupling Proofs. 327-346 - Chuchu Fan, Umang Mathur, Sayan Mitra, Mahesh Viswanathan:
Controller Synthesis Made Real: Reach-Avoid Specifications and Linear Dynamics. 347-366 - Suguman Bansal, Kedar S. Namjoshi, Yaniv Sa'ar:
Synthesis of Asynchronous Reactive Programs from Temporal Specifications. 367-385 - Qinheping Hu, Loris D'Antoni:
Syntax-Guided Synthesis with Quantitative Syntactic Objectives. 386-403
Learning
- Xinyu Wang, Greg Anderson, Isil Dillig, Kenneth L. McMillan:
Learning Abstractions for Program Synthesis. 407-426 - George Argyros, Loris D'Antoni:
The Learnability of Symbolic Automata. 427-445
Runtime Verification, Hybrid and Timed Systems
- Hui Kong, Ezio Bartocci, Thomas A. Henzinger:
Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes. 449-467 - Goran Frehse, Mirco Giacobbe, Thomas A. Henzinger:
Space-Time Interpolants. 468-486 - Michael Emmi, Constantin Enea:
Monitoring Weak Consistency. 487-506 - Yijun Feng, Joost-Pieter Katoen, Haokun Li, Bican Xia, Naijun Zhan:
Monitoring CTMCs by Multi-clock Timed Automata. 507-526 - Frederik M. Bønneland, Peter Gjøl Jensen, Kim Guldstrand Larsen, Marco Muñiz, Jirí Srba:
Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems. 527-546 - Ezio Bartocci, Roderick Bloem, Dejan Nickovic, Franz Röck:
A Counting Semantics for Monitoring LTL Specifications over Finite Traces. 547-564
Tools
- Jan Kretínský, Tobias Meggendorfer, Salomon Sickert, Christopher Ziegler:
Rabinizer 4: From LTL to Your Favourite Deterministic Automaton. 567-577 - Philipp J. Meyer, Salomon Sickert, Michael Luttenberger:
Strix: Explicit Reactive Synthesis Strikes Back! 578-586 - Aina Niemetz, Mathias Preiner, Clifford Wolf, Armin Biere:
Btor2 , BtorMC and Boolector 3.0. 587-595 - Marco Eilers, Peter Müller:
Nagini: A Static Verifier for Python. 596-603 - Michael Blondin, Javier Esparza, Stefan Jaax:
Peregrine: A Tool for the Analysis of Population Protocols. 604-611 - Milan Ceska, Jirí Matyás, Vojtech Mrazek, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
ADAC: Automated Design of Approximate Circuits. 612-620
Probabilistic Systems
- Edon Kelmendi, Julia Krämer, Jan Kretínský, Maximilian Weininger:
Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm. 623-642 - Tim Quatmann, Joost-Pieter Katoen:
Sound Value Iteration. 643-661 - Weichao Zhou, Wenchao Li:
Safety-Aware Apprenticeship Learning. 662-680 - Qiyi Tang, Franck van Breugel:
Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains. 681-699
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 2020-10-28 22:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
