Mathematical programming based debugging
From MaRDI portal
Recommendations
- Static analysis by abstract interpretation: a mathematical programming approach
- scientific article; zbMATH DE number 1975609
- Hybrid Systems: Computation and Control
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- scientific article; zbMATH DE number 2086611
Cites work
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computer Aided Verification
- Constructive versions of Tarski's fixed point theorems
- On the Convergence of Policy Iteration in Stationary Dynamic Programming
- Optimization of Lyapunov Invariants in Verification of Software Systems
- Polymorphic Fractional Capabilities
- Precise Fixpoint Computation Through Strategy Iteration
- Static Analysis by Policy Iteration on Relational Domains
- Verification, Model Checking, and Abstract Interpretation
Cited in
(6)- Hybrid Systems: Computation and Control
- Mathematical programming: Turing completeness and applications to software analysis
- Analyzing mathematical programs using MProbe
- Cooperative bug isolation. Winning thesis of the 2005 ACM doctoral dissertation competition.
- A procedure to debug computer programs
- Program analysis using quantifier-elimination heuristics (extended abstract)
This page was built for publication: Mathematical programming based debugging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861570)
