CAV 2014
57 papers
- A Conference Management System with Verified Document Confidentiality
- A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions
- A Nonlinear Real Arithmetic Fragment
- A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis
- A Tale of Two Solvers: Eager and Lazy Approaches to Bit-Vectors
- AVATAR: The Architecture for First-Order Theorem Provers
- An SMT-Based Approach to Coverability Analysis
- Analyzing and Synthesizing Genomic Logic Functions
- Automatic Atomicity Verification for Clients of Concurrent Data Structures
- Automating Separation Logic with Trees and Data
- Bit-Vector Rewriting with Automatic Rule Generation
- Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization
- CEGAR for Qualitative Analysis of Probabilistic Systems
- Causal Termination of Multi-threaded Programs
- Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR)
- Diamonds Are a Girl's Best Friend: Partial Order Reduction for Timed Automata with Abstractions
- Don't Sit on the Fence - A Static Analysis Approach to Automatic Fence Insertion
- Engineering a Static Verification Tool for GPU Kernels
- Finding Instability in Biological Models
- From Invariant Checking to Invariant Inference Using Randomized Search
- From LTL to Deterministic Automata: A Safraless Compositional Approach
- G4LTL-ST: Automatic Generation of PLC Programs
- GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components
- ICE: A Robust Framework for Learning Invariants
- Interpolating Property Directed Reachability
- Invariant Verification of Nonlinear Hybrid Automata Networks of Cardiac Cells
- LEAP: A Tool for the Parametrized Verification of Concurrent Datatypes
- Lazy Annotation Revisited
- MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications
- Minimizing Running Costs in Consumption Systems
- Monadic Decomposition
- Optimal Guard Synthesis for Memory Safety
- Property-Directed Shape Analysis
- Proving Non-termination Using Max-SMT
- QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
- Reachability Analysis of Hybrid Systems Using Symbolic Orthogonal Projections
- Regression Test Selection for Distributed Software Histories
- Regression-Free Synthesis for Concurrency
- SMACK: Decoupling Source Language Details from Verifier Implementations
- SMT-Based Model Checking for Recursive Programs
- Safraless Synthesis for Epistemic Temporal Specifications
- Shape Analysis via Second-Order Bi-Abduction
- Software Verification in the Google App-Engine Cloud
- Solving Games without Controllable Predecessor
- String Constraints for Verification
- Symbolic Resource Bound Inference for Functional Programs
- Symbolic Visibly Pushdown Automata
- Synthesis of Masking Countermeasures against Side Channel Attacks
- Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
- Termination Analysis by Learning Terminating Programs
- The Spirit of Ghost Code
- The nuXmv Symbolic Model Checker
- Unbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath Abstraction
- Vac - Verifier of Administrative Role-Based Access Control Policies
- Verifying LTL Properties of Hybrid Systems with K-Liveness
- Verifying Relative Error Bounds Using Symbolic Simulation
- Yices 2.2