Relevance heuristics for program analysis

DOI10.1145/1328438.1328440MaRDI QIDQ3189861zbMATH OpenOpenAlexFDO

Authors K. L. McMillan

Publication date 12 September 2014

Published in Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1328438.1328440

zbMATH Keywords

abstract interpretationCraig interpolationmodel checking

Mathematics Subject Classification ID

Logic in computer science (03B70) Interpolation, preservation, definability (03C40) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Back to the future, revisiting precise program verification using SMT solvers
• Program analysis using quantifier-elimination heuristics (extended abstract)
• Program verification with interacting analysis plugins
• Propositional Interpolation and Abstract Interpretation
• Program Verification with Separation Logic

This page was built for publication: Relevance heuristics for program analysis

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