Abstract is missing.
- A Model-Constructing Satisfiability CalculusLeonardo Mendonça de Moura, Dejan Jovanovic. 1-12 [doi]
- Automata as ProofsAndreas Podelski. 13-14 [doi]
- Complete Abstractions EverywhereFrancesco Ranzato. 15-26 [doi]
- Abstraction-Guided SynthesisEran Yahav. 27 [doi]
- SMT-Based Bisimulation Minimisation of Markov ModelsChristian Dehnert, Joost-Pieter Katoen, David Parker. 28-47 [doi]
- Hybrid Automata-Based CEGAR for Rectangular Hybrid SystemsPavithra Prabhakar, Parasara Sridhar Duggirala, Sayan Mitra, Mahesh Viswanathan. 48-67 [doi]
- Quantifying Information Leakage of Randomized ProtocolsFabrizio Biondi, Axel Legay, Pasquale Malacaria, Andrzej Wasowski. 68-87 [doi]
- Reductions for Synthesis ProceduresSwen Jacobs, Viktor Kuncak, Philippe Suter. 88-107 [doi]
- Towards Efficient Parameterized SynthesisAyrat Khalimov, Swen Jacobs, Roderick Bloem. 108-127 [doi]
- Automatic Inference of Necessary PreconditionsPatrick Cousot, Radhia Cousot, Manuel Fähndrich, Francesco Logozzo. 128-148 [doi]
- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis ToolsYassamine Seladji, Olivier Bouissou. 149-168 [doi]
- SMT-Based Array Invariant GenerationDaniel Larraz, Enric Rodríguez-Carbonell, Albert Rubio. 169-188 [doi]
- Flow-Sensitive Fault LocalizationJürgen Christ, Evren Ermis, Martin Schäf, Thomas Wies. 189-208 [doi]
- Static Analysis of String Encoders and DecodersLoris D'Antoni, Margus Veanes. 209-228 [doi]
- Robustness Analysis of Networked SystemsRoopsha Samanta, Jyotirmoy V. Deshmukh, Swarat Chaudhuri. 229-247 [doi]
- Causality Checking for Complex System ModelsFlorian Leitner-Fischer, Stefan Leue. 248-267 [doi]
- ClabureDB: Classified Bug-Reports DatabaseJiri Slaby, Jan Strejcek, Marek Trtík. 268-274 [doi]
- Tool Integration with the Evidential Tool BusSimon Cruanes, Grégoire Hamon, Sam Owre, Natarajan Shankar. 275-294 [doi]
- Compositional and Lightweight Dependent Type Inference for MLHe Zhu, Suresh Jagannathan. 295-314 [doi]
- Abstract Read Permissions: Fractional Permissions without the FractionsStefan Heule, K. Rustan M. Leino, Peter Müller, Alexander J. Summers. 315-334 [doi]
- Sound and Complete Flow Typing with Unions, Intersections and NegationsDavid J. Pearce. 335-354 [doi]
- Knockout Prediction for Reaction Networks with Partial Kinetic InformationMathias John, Mirabelle Nebut, Joachim Niehren. 355-374 [doi]
- Reduced Product Combination of Abstract Domains for ShapesAntoine Toubhans, Bor-Yuh Evan Chang, Xavier Rival. 375-395 [doi]
- Abstraction of SyntaxVijay D'Silva, Daniel Kroening. 396-413 [doi]
- Logico-Numerical Max-Strategy IterationPeter Schrammel, Pavle Subotic. 414-433 [doi]
- A Constraint Solver Based on Abstract DomainsMarie Pelleau, Antoine Miné, Charlotte Truchet, Frédéric Benhamou. 434-454 [doi]
- An Abstract Interpretation of DPLL(T)Martin Brain, Vijay D'Silva, Leopold Haller, Alberto Griggio, Daniel Kroening. 455-475 [doi]
- All for the Price of FewParosh Aziz Abdulla, Frédéric Haziza, Lukás Holík. 476-495 [doi]
- Uncovering Symmetries in Irregular Process NetworksKedar S. Namjoshi, Richard J. Trefler. 496-514 [doi]
- State Space Reduction for Sensor Networks Using Two-Level Partial Order ReductionManchun Zheng, David Sanán, Jun Sun 0001, Yang Liu, Jin Song Dong, Yu Gu 0001. 515-535 [doi]
- Compositional Sequentialization of Periodic ProgramsSagar Chaki, Arie Gurfinkel, Soonho Kong, Ofer Strichman. 536-554 [doi]