Making abstract models complete

DOI10.1017/S0960129514000358zbMath1361.68065MaRDI QIDQ5741575

Roberto Giacobazzi, Isabella Mastroeni

Publication date: 28 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Completeness of string analysis for dynamic languages

Cites Work

• Unnamed Item
• Unnamed Item
• Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions
• Constructive versions of Tarski's fixed point theorems
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• The closure operators of a lattice
• A semantics-based approach to malware detection
• Counterexample-guided abstraction refinement for symbolic model checking
• Transforming Abstract Interpretations by Abstract Interpretation
• Fixpoint-Guided Abstraction Refinements
• Refining and compressing abstract domains
• Abstract Interpretation Frameworks
• Making abstract interpretations complete

This page was built for publication: Making abstract models complete