SLAM

swMATH3136MaRDI QIDQ15668FDOQ15668

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Loop summarization using state and transition invariants
• Title not available (Why is that?)
• On the Satisfiability of Modular Arithmetic Formulae
• Computer Aided Verification
• Title not available (Why is that?)
• Title not available (Why is that?)
• EUFORIA: complete software model checking with uninterpreted functions
• A saturation method for the modal \(\mu \)-calculus over pushdown systems
• Formal analysis of hierarchical state machines
• Model Checking Software
• Verification, Model Checking, and Abstract Interpretation
• Static Analysis
• Static Analysis
• Title not available (Why is that?)
• Tools and Algorithms for the Construction and Analysis of Systems
• Solving games via three-valued abstraction refinement
• Whale: an interpolation-based algorithm for inter-procedural verification
• Algorithmic Analysis of Array-Accessing Programs
• Abstraction Refinement for Quantified Array Assertions
• A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes
• Model checking higher-order programs
• Data structures for symbolic multi-valued model-checking
• Computer Aided Verification
• Predicate abstraction for program verification
• Model checking procedural programs
• A model checking-based approach for security policy verification of mobile systems
• An integrated approach to high integrity software verification
• An extension of lazy abstraction with interpolation for programs with arrays
• Automatic decidability and combinability
• An automata-theoretic approach to infinite-state systems
• Context-aware counter abstraction
• Model Checking Software
• Dependent types from counterexamples
• Modular strategies for recursive game graphs
• Generating models of infinite-state communication protocols using regular inference with abstraction
• Behavioral interface specification languages
• A divide-and-conquer approach for analysing overlaid data structures
• A general framework for types in graph rewriting
• Runtime verification based on register automata
• Computer aided verification. 16th international conference, CAV 2004, Boston, MA, USA, July 13--17, 2004. Proceedings.
• Computer Aided Verification
• Toward compositional verification of interruptible OS kernels and device drivers
• Tools and Algorithms for the Construction and Analysis of Systems
• Model Checking Software
• Tools and Algorithms for the Construction and Analysis of Systems
• Compositionality Entails Sequentializability
• Symmetry and Completeness in the Analysis of Parameterized Systems
• Verification and falsification of programs with loops using predicate abstraction
• Model checking RAISE applicative specifications
• Automatic Termination Verification for Higher-Order Functional Programs
• Refinement of Trace Abstraction
• CONCUR 2004 - Concurrency Theory
• On model checking multiple hybrid views
• Fluid updates: beyond strong vs. weak updates
• Refinement-based CFG reconstruction from unstructured programs
• Software Model Checking: Searching for Computations in the Abstract or the Concrete
• Refining abstract interpretations
• Generalized property directed reachability
• Winning Regions of Pushdown Parity Games: A Saturation Method
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• Specification and Verification of Multi-Agent Systems
• Monitoring and recovery for web service applications
• Static Analysis
• Proving Termination of Tree Manipulating Programs
• Tools and Algorithms for the Construction and Analysis of Systems
• Programming Languages and Systems
• Title not available (Why is that?)
• Combining model checking and data-flow analysis
• Counterexample-guided abstraction refinement for symmetric concurrent programs
• Title not available (Why is that?)
• Correctness kernels of abstract interpretations
• Tools and Algorithms for the Construction and Analysis of Systems
• FM 2005: Formal Methods
• A unifying view on SMT-based software verification
• From under-approximations to over-approximations and back
• C-SHORe: a collapsible approach to higher-order verification
• Automatically Refining Abstract Interpretations
• Verification, Model Checking, and Abstract Interpretation
• A Lightweight Approach for Loop Summarization
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation
• Loop Invariants from Counterexamples
• Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
• An introduction to practical formal methods using temporal logic
• Efficient strategies for CEGAR-based model checking
• Establishing local temporal heap safety properties with applications to compile-time memory management
• Verify heaps via unified model checking
• Verifying Reference Counting Implementations
• Splitting via Interpolants
• Programming Languages and Systems
• Taking satisfiability to the next level with Z3 (abstract)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Formal Methods for Components and Objects
• Computation engineering. Applied automata theory and logic.
• Automated formal analysis and verification: an overview
• A semantic framework for the abstract model checking of tccp programs
• Software verification with PDR: an implementation of the state of the art
• Highly dependable concurrent programming using design for verification
• Predicate diagrams for the verification of real-time systems

This page was built for software: SLAM