Building complete abstract interpretations in a linear logic-based setting

DOI10.1007/3-540-49727-7_13MaRDI QIDQ4217930zbMATH OpenFDO

Authors Roberto Giacobazzi, Francesca Scozzari, Francesco Ranzato

Publication date 11 November 1998

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

Full work available at URL http://hdl.handle.net/11577/182287

zbMATH Keywords

abstract computationsabstract domainabstract interpretationsbottom-up semanticscompletenessleast complete extensionlogic programsmodels of linear logicobservation completenessquantales

Mathematics Subject Classification ID

Logic in computer science (03B70) Other algebras related to logic (03G25) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Ordered semigroups and monoids (06F05) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Making abstract interpretations complete
• Observational Completeness on Abstract Interpretation
• Observational completeness on abstract interpretation
• Making abstract models complete
• Comparing Completeness Properties of Static Analyses and Their Logics

Cited in

(10)

• Complete abstractions and subclassical modal logics
• Lifting abstract interpreters to quantified logical domains
• scientific article; zbMATH DE number 7559486 (Why is no real title available?)
• Making abstract interpretations complete
• Comparing Completeness Properties of Static Analyses and Their Logics
• Transforming semantics by abstract interpretation
• Making abstract models complete
• Observational completeness on abstract interpretation
• Logics for extensional, locally complete analysis via domain refinements
• A correctness and incorrectness program logic

This page was built for publication: Building complete abstract interpretations in a linear logic-based setting

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