Automated formal analysis and verification: an overview
From MaRDI portal
Recommendations
Cites work
- A machine program for theorem-proving
- A structural induction theorem for processes
- A theory of timed automata
- Abstract Interpretation Frameworks
- Abstract regular model checking
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Abstracting WS1S systems to verify parameterized networks
- An axiomatic basis for computer programming
- Applications of Craig interpolants in model checking
- Automata-Theoretic Model Checking Revisited
- Automated assume-guarantee reasoning for simulation conformance
- Automatic deductive verification with invisible invariants
- Automatic verification of parameterized networks of processes
- Boolean and Cartesian abstraction for model checking C programs
- Comparison of algorithms for checking emptiness on Büchi automata
- CONCUR 2005 – Concurrency Theory
- Counterexample-guided abstraction refinement
- Efficient algorithms for model checking pushdown systems
- Efficient Runtime Detection and Toleration of Asymmetric Races
- Forest automata for verification of heap manipulation
- Formal Methods for the Design of Real-Time Systems
- Global Data Flow Analysis and Iterative Algorithms
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 4180789 (Why is no real title available?)
- scientific article; zbMATH DE number 3919813 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 3485178 (Why is no real title available?)
- scientific article; zbMATH DE number 1069483 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Induction in compositional model checking
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Introduction to set constraint-based program analysis
- Iterating transducers in the large (extended abstract)
- Lazy abstraction
- Liveness and acceleration in parameterized verification
- Model checking large-scale and parameterized resource allocation systems
- Model checking the full modal mu-calculus for infinite sequential processes
- Model-checking in dense real-time
- Monotone data flow analysis frameworks
- New Developments in WCET Analysis
- On verifying fair lossy channel systems
- Parameterized model checking of ring-based message passing systems
- Principles of program analysis.
- Process rewrite systems.
- Pushdown processes: Games and model-checking
- Reasoning about systems with many processes
- Reasoning about threads communicating via locks
- Reducing model checking of the many to the few
- Regular model checking
- Regular model checking made simple and efficient
- Results on the propositional \(\mu\)-calculus
- SATABS: SAT-based predicate abstraction for ANSI-C
- Software verification with BLAST
- Symbolic compositional verification by learning assumptions
- Symbolic model checking for real-time systems
- Symbolic model checking with rich assertional languages
- Symbolic model checking: \(10^{20}\) states and beyond
- The SLAM toolkit
- Transition predicate abstraction and fair termination
- Unreliable channels are easier to verify than perfect channels
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Using runtime analysis to guide model checking of Java programs
- Verification by network decomposition
- Verification of parametric concurrent systems with prioritised FIFO resource management
- Verifying programs with unreliable channels
- “Sometimes” and “not never” revisited
Cited in
(3)
Describes a project that uses
Uses Software
This page was built for publication: Automated formal analysis and verification: an overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2871577)