default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19. VMCAI 2018: Los Angeles, CA, USA
- Isil Dillig, Jens Palsberg:
Verification, Model Checking, and Abstract Interpretation - 19th International Conference, VMCAI 2018, Los Angeles, CA, USA, January 7-9, 2018, Proceedings. Lecture Notes in Computer Science 10747, Springer 2018, ISBN 978-3-319-73720-1 - Benjamin Aminof, Sasha Rubin, Ilina Stoilkovska, Josef Widder, Florian Zuleger:
Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction. 1-24 - Johannes Bader
, Jonathan Aldrich, Éric Tanter:
Gradual Program Verification. 25-46 - Cedric Baumann, Andrei Marian Dan, Yuri Meshman, Torsten Hoefler, Martin T. Vechev:
Automatic Verification of RMA Programs via Abstraction Extrapolation. 47-70 - Fabrizio Biondi, Michael A. Enescu, Annelie Heuser, Axel Legay, Kuldeep S. Meel, Jean Quilbeuf:
Scalable Approximation of Quantitative Information Flow in Programs. 71-93 - Roberto Bruni, Roberto Giacobazzi, Roberta Gori:
Code Obfuscation Against Abstract Model Checking Attacks. 94-115 - Samuele Buro, Isabella Mastroeni:
Abstract Code Injection - A Semantic Approach Based on Abstract Non-Interference. 116-137 - Eric Butler, Emina Torlak, Zoran Popovic:
A Framework for Computer-Aided Design of Educational Domain Models. 138-160 - Manjeet Dahiya, Sorav Bansal:
Automatic Verification of Intermittent Systems. 161-182 - Brijesh Dongol, Radha Jagadeesan, James Riely, Alasdair Armstrong:
On abstraction and compositionality for weak-memory linearisability. 183-204 - Tomás Fiedor, Lukás Holík, Adam Rogalewicz, Moritz Sinn, Tomás Vojnar, Florian Zuleger:
From Shapes to Amortized Complexity. 205-225 - Andreas Humenberger, Maximilian Jaroschek, Laura Kovács:
Invariant Generation for Multi-Path Loops with Polynomial Assignments. 226-246 - Swen Jacobs, Mouhammad Sakr:
Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity. 247-268 - Milod Kazerounian, Niki Vazou, Austin Bourgerie, Jeffrey S. Foster, Emina Torlak:
Refinement Types for Ruby. 269-290 - Julian Kranz, Axel Simon:
Modular Analysis of Executables Using On-Demand Heyting Completion. 291-312 - Yong Li, Andrea Turrini, Lijun Zhang, Sven Schewe:
Learning to Complement Büchi Automata. 313-335 - Lenore D. Zuck, Kenneth L. McMillan, Jordan Torf:
P^5 : Planner-less Proofs of Probabilistic Parameterized Protocols. 336-357 - Mahsa Najafzadeh, Marc Shapiro, Patrick Eugster:
Co-Design and Verification of an Available File System. 358-381 - Hila Peleg, Shachar Itzhaky, Sharon Shoham:
Abstraction-Based Interaction Model for Synthesis. 382-405 - Hila Peleg, Dan Rasin, Eran Yahav:
Generating Tests by Example. 406-429 - Adi Prabawa, Mahmudul Faisal Al Ameen, Benedict Lee, Wei-Ngan Chin:
A Logical System for Modular Information Flow Verification. 430-451 - Francesco Ranzato:
On Constructivity of Galois Connections. 452-473 - Nima Roohi, Mahesh Viswanathan:
Revisiting MITL to Fix Decision Procedures. 474-494 - Tanja Schindler, Dejan Jovanovic:
Selfless Interpolation for Infinite-State Model Checking. 495-515 - Laura Titolo, Marco A. Feliú, Mariano M. Moscato, César A. Muñoz:
An Abstract Interpretation Framework for the Round-Off Error Analysis of Floating-Point Programs. 516-537
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 2026-02-10 22:32 CET 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:
