SAS 2013
25 papers
- Abstract Interpretation over Non-lattice Abstract Domains
- Abstract Semantic Differencing for Numerical Programs
- Automatic Synthesis of Deterministic Concurrency
- Automatic Verification of Erlang-Style Concurrency
- Byte-Precise Verification of Low-Level List Manipulation
- Concise Analysis Using Implication Algebras for Task-Local Memory Optimisation
- Contextual Locking for Dynamic Pushdown Networks
- Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra
- Formal Verification of a C Value Analysis Based on Abstract Interpretation
- From Concrete Examples to Heap Manipulating Programs
- Interpolation-Based Verification of Floating-Point Programs with Abstract CDCL
- Local Shape Analysis for Overlaid Data Structures
- Localizing Widening and Narrowing
- On Solving Universally Quantified Horn Clauses
- Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation
- Predicate Abstraction for Relaxed Memory Models
- Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists
- Static Analysis by Abstract Interpretation of Numerical Programs and Systems, and FLUCTUAT
- Static Analysis in the Continuously Changing World
- Static Provenance Verification for Message Passing Programs
- Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic Processing
- Symbolic Automata for Static Specification Mining
- The Abstract Domain of Segmented Ranking Functions
- Verification as Learning Geometric Concepts
- Witnessing Program Transformations