VMCAI 2013
31 papers
- A Constraint Solver Based on Abstract Domains
- A Model-Constructing Satisfiability Calculus
- Abstract Read Permissions: Fractional Permissions without the Fractions
- Abstraction of Syntax
- Abstraction-Guided Synthesis
- All for the Price of Few
- An Abstract Interpretation of DPLL(T)
- Automata as Proofs
- Automatic Inference of Necessary Preconditions
- Causality Checking for Complex System Models
- ClabureDB: Classified Bug-Reports Database
- Complete Abstractions Everywhere
- Compositional Sequentialization of Periodic Programs
- Compositional and Lightweight Dependent Type Inference for ML
- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
- Flow-Sensitive Fault Localization
- Hybrid Automata-Based CEGAR for Rectangular Hybrid Systems
- Knockout Prediction for Reaction Networks with Partial Kinetic Information
- Logico-Numerical Max-Strategy Iteration
- Quantifying Information Leakage of Randomized Protocols
- Reduced Product Combination of Abstract Domains for Shapes
- Reductions for Synthesis Procedures
- Robustness Analysis of Networked Systems
- SMT-Based Array Invariant Generation
- SMT-Based Bisimulation Minimisation of Markov Models
- Sound and Complete Flow Typing with Unions, Intersections and Negations
- State Space Reduction for Sensor Networks Using Two-Level Partial Order Reduction
- Static Analysis of String Encoders and Decoders
- Tool Integration with the Evidential Tool Bus
- Towards Efficient Parameterized Synthesis
- Uncovering Symmetries in Irregular Process Networks