Program verification with interacting analysis plugins
From MaRDI portal
Recommendations
Cites work
- Abstract interpretation and application to logic programs
- Automated Deduction – CADE-20
- Automated Deduction – CADE-20
- Combinations of abstract domains for logic programming: Open product and generic pattern construction
- Computer Aided Verification
- Computer Science Logic
- Constructive versions of Tarski's fixed point theorems
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 1614700 (Why is no real title available?)
- scientific article; zbMATH DE number 1670555 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 1324833 (Why is no real title available?)
- scientific article; zbMATH DE number 1744961 (Why is no real title available?)
- scientific article; zbMATH DE number 2102703 (Why is no real title available?)
- Languages that Capture Complexity Classes
- Lazy abstraction
- Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic
- Simplify: a theorem prover for program checking
- Static Analysis
- Static Analysis
- Symbolic model checking: \(10^{20}\) states and beyond
- Verification of Java programs with interacting analysis plugins
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
Cited in
(5)
This page was built for publication: Program verification with interacting analysis plugins
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642983)