Program analysis using quantifier-elimination heuristics (extended abstract)

DOI10.1007/978-3-642-29952-0_15MaRDI QIDQ2898021zbMATH OpenOpenAlexFDO

Authors Deepak Kapur

Publication date 16 July 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29952-0_15

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 2080754
• Hybrid Systems: Computation and Control
• scientific article; zbMATH DE number 2086611
• Model checking: from hardware to software.
• Mathematical programming based debugging

Cited in

(5)

• Detecting races in relay ladder logic programs
• Dual analysis for proving safety and finding bugs
• Relevance heuristics for program analysis
• Elimination Techniques for Program Analysis
• Recent progress in program analysis

This page was built for publication: Program analysis using quantifier-elimination heuristics (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898021)