Compile-time derivation of variable dependency using abstract interpretation
From MaRDI portal
Publication:4012713
DOI10.1016/0743-1066(92)90035-2zbMath0776.68032OpenAlexW1965377774MaRDI QIDQ4012713
Manuel V. Hermenegildo, Kalyan Muthukumar
Publication date: 27 September 1992
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: http://oa.upm.es/14291/
AND-parallel executionabstract domain-independent fixpoint algorithmabstract interpretation-based global analysis of logic programsterm-dependence informationvariable-sharing information
Related Items
An overview of Ciao and its design philosophy, The role of linearity in sharing analysis, Certificate size reduction in abstraction-carrying code, Optimality in goal-dependent analysis of Sharing, Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types, Three improvements to the top-down solver, Parallel Logic Programming: A Sequel, Analysis and Transformation of Constrained Horn Clauses for Program Verification, Practical run-time checking via unobtrusive property caching, Semantic code browsing, A general framework for static profiling of parametric resource usage, Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP, Unnamed Item, Unnamed Item, Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption, Abstraction-carrying code: a model for mobile code safety, Optimal multibinding unification for sharing and linearity analysis, Ordered structures for parallel rule-based computations, A Transformational Approach to Parametric Accumulated-Cost Static Profiling, A Transformational Approach to Resource Analysis with Typed-norms Inference, Incremental and Modular Context-sensitive Analysis, Exploiting linearity in sharing analysis of object-oriented programs, Efficient description logic reasoning in Prolog: The DLog system, On the interaction between sharing and linearity, Non-strict independence-based program parallelization using sharing and freeness information, A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs, Negative Ternary Set-Sharing, Bottom-up abstract interpretation of logic programs, Set-sharing is redundant for pair-sharing, Optimized algorithms for incremental analysis of logic programs, Testing your (static analysis) truths
