Deciding program properties via complete abstractions on bounded domains
From MaRDI portal
(Redirected from Publication:6164426)
Recommendations
Cites work
- A survey of verification techniques for parallel programs
- Analyzing program analyses
- Classes of Recursively Enumerable Sets and Their Decision Problems
- scientific article; zbMATH DE number 1701764 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 2161330 (Why is no real title available?)
- Making abstract interpretations complete
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Principles of abstract interpretation
- Sometime = always + recursion always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
- Systematic design of program transformation frameworks by abstract interpretation
Cited in
(3)
This page was built for publication: Deciding program properties via complete abstractions on bounded domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164426)