Logics for extensional, locally complete analysis via domain refinements

DOI10.1007/978-3-031-30044-8_1MaRDI QIDQ6535224zbMATH OpenFDO

Authors Flavio Ascari, Roberto Bruni, Roberta Gori

Publication date 24 November 2023

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-30044-8_1

zbMATH Keywords

abstract domain refinementabstract interpretationcompleteness in abstract interpretationextensionalityHoare logic

Mathematics Subject Classification ID

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

Recommendations

• Analyzing program analyses
• Comparing Completeness Properties of Static Analyses and Their Logics
• Complete abstractions everywhere
• scientific article; zbMATH DE number 1222407

Cites work

• Abstract interpretation
• Analyzing program analyses
• scientific article; zbMATH DE number 1670775 (Why is no real title available?)
• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• Lazy abstraction
• Lazy Abstraction with Interpolants
• Local reasoning about the presence of bugs: incorrectness separation logic
• Making abstract interpretations complete
• Principles of abstract interpretation
• Systematic design of program transformation frameworks by abstract interpretation
• The octagon abstract domain

Cited in

(4)

• Locality and Applications to Subsumption Testing in EL and Some of its Extensions
• scientific article; zbMATH DE number 5592264 (Why is no real title available?)
• Local completeness logic on Kleene algebra with tests
• Broadening the applicability of local completeness analysis with intensional and extensional guarantees

This page was built for publication: Logics for extensional, locally complete analysis via domain refinements

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