Combinations of abstract domains for logic programming: Open product and generic pattern construction
From MaRDI portal
Publication:1581061
DOI10.1016/S0167-6423(99)00045-3zbMath0957.68023MaRDI QIDQ1581061
Agostino Cortesi, Pascal Van Hentenryck, Baudouin Le Charlier
Publication date: 14 September 2000
Published in: Science of Computer Programming (Search for Journal in Brave)
Related Items (9)
Program verification with interacting analysis plugins ⋮ Refining and compressing abstract domains ⋮ On model checking multiple hybrid views ⋮ A Novel Derivation Framework For Definite Logic Program ⋮ Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations ⋮ Widening and narrowing operators for abstract interpretation ⋮ Applications of polyhedral computations to the analysis and verification of hardware and software systems ⋮ Set-sharing is redundant for pair-sharing ⋮ Finite-tree analysis for constraint logic-based languages
Uses Software
This page was built for publication: Combinations of abstract domains for logic programming: Open product and generic pattern construction
