Abstract is missing.
- Witnessing Secure CompilationKedar S. Namjoshi, Lucas M. Tabajara. 1-22 [doi]
- BackFlow: Backward Context-Sensitive Flow Reconstruction of Taint Analysis ResultsPietro Ferrara, Luca Olivieri, Fausto Spoto. 23-43 [doi]
- Fixing Code that Explodes Under Symbolic EvaluationSorawee Porncharoenwase, James Bornholt, Emina Torlak. 44-67 [doi]
- The Correctness of a Code Generator for a Functional LanguageNathanaël Courant, Antoine Séré, Natarajan Shankar. 68-89 [doi]
- Leveraging Compiler Intermediate Representation for Multi- and Cross-Language VerificationJack J. Garzella, Marek S. Baranowski, Shaobo He, Zvonimir Rakamaric. 90-111 [doi]
- Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank ReductionOren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham. 112-135 [doi]
- A Systematic Approach to Abstract Interpretation of Program TransformationsSven Keidel, Sebastian Erdweg. 136-157 [doi]
- Sharing Ghost Variables in a Collection of Abstract DomainsMarc Chevalier, Jérôme Feret. 158-179 [doi]
- Harnessing Static Analysis to Help Learn Pseudo-Inverses of String Manipulating Procedures for Automatic Test GenerationOren Ish-Shalom, Shachar Itzhaky, Roman Manevich, Noam Rinetzky. 180-201 [doi]
- Synthesizing Environment Invariants for Modular Hardware VerificationHongce Zhang, Weikun Yang, Grigory Fedyukovich, Aarti Gupta, Sharad Malik. 202-225 [doi]
- Systematic Classification of Attackers via Bounded Model CheckingEric Rothstein Morris, Sun Jun, Sudipta Chattopadhyay. 226-247 [doi]
- Cheap CTL Compassion in NuSMVDaniel Hausmann, Tadeusz Litak, Christoph Rauch, Matthias Zinner. 248-269 [doi]
- A Cooperative Parallelization Approach for Property-Directed k-InductionMartin Blicha, Antti E. J. Hyvärinen, Matteo Marescotti, Natasha Sharygina. 270-292 [doi]
- Generalized Property-Directed Reachability for Hybrid SystemsKohei Suenaga, Takuya Ishizawa. 293-313 [doi]
- Language Inclusion for Finite Prime Event StructuresAndreas Fellner, Thorsten Tarrach, Georg Weissenbacher. 314-336 [doi]
- Promptness and Bounded Fairness in Concurrent and Parameterized SystemsSwen Jacobs, Mouhammad Sakr, Martin Zimmermann 0002. 337-359 [doi]
- Solving $\mathrm {LIA} ^\star $ Using ApproximationsMaxwell Levatich, Nikolaj Bjørner, Ruzica Piskac, Sharon Shoham. 360-378 [doi]
- Formalizing and Checking Multilevel ConsistencyAhmed Bouajjani, Constantin Enea, Madhavan Mukund, Gautham Shenoy R., S. P. Suresh. 379-400 [doi]
- Practical Abstractions for Automated Verification of Shared-Memory ConcurrencyWytse Oortwijn, Dilian Gurov, Marieke Huisman. 401-425 [doi]
- How to Win First-Order Safety GamesHelmut Seidl, Christian Müller 0008, Bernd Finkbeiner. 426-448 [doi]
- Improving Parity Game Solvers with JustificationsRuben Lapauw, Maurice Bruynooghe, Marc Denecker. 449-470 [doi]