Computing Abstract Distances in Logic Programs

DOI10.1007/978-3-030-45260-5_4zbMath1502.68060arXiv1907.13263OpenAlexW3018710771MaRDI QIDQ5097625

Ignacio Casso, Pedro Lopez-Garcia, Manuel V. Hermenegildo, Roberto Giacobazzi, Jose Francisco Morales

Publication date: 25 August 2022

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.13263

zbMATH Keywords

distancescomplete latticesstatic analysislogic programmingmetricsabstract interpretationprogram semantics

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

Completeness of string analysis for dynamic languages ⋮ Testing your (static analysis) truths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Foundations of inductive logic programming
• Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
• Horn Clause Solvers for Program Verification
• SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
• Analysis of Linear Hybrid Systems in CLP
• Efficient run-time type checking of typed logic programs
• Semantic code browsing
• Comparison of abstract interpretations
• A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
• A practical framework for theabstract interpretation of logic programs
• Measures in Boolean Algebras

This page was built for publication: Computing Abstract Distances in Logic Programs