Compile-time derivation of variable dependency using abstract interpretation
From MaRDI portal
Recommendations
- Static analysis of logic programs for independent and parallelism
- scientific article; zbMATH DE number 1692904
- A practical framework for theabstract interpretation of logic programs
- Differential methods in logic program analysis
- A methodology for detecting shared variable dependencies in logic programs
Cited in
(36)- On the interaction between sharing and linearity
- Optimized algorithms for incremental analysis of logic programs
- Abstraction-carrying code: a model for mobile code safety
- Resource usage analysis of logic programs via abstract interpretation using sized types
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- Testing your (static analysis) truths
- A mode analysis of logic programs by abstract interpretation
- Certificate size reduction in abstraction-carrying code
- Ordered structures for parallel rule-based computations
- An overview of Ciao and its design philosophy
- A transformational approach to parametric accumulated-cost static profiling
- Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
- A general framework for static profiling of parametric resource usage
- Incremental and modular context-sensitive analysis
- Parallel Logic Programming: A Sequel
- Optimal multibinding unification for sharing and linearity analysis
- Exploiting linearity in sharing analysis of object-oriented programs
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
- A transformational approach to resource analysis with typed-norms inference
- scientific article; zbMATH DE number 1497828 (Why is no real title available?)
- scientific article; zbMATH DE number 1497832 (Why is no real title available?)
- Variability encoding: from compile-time to load-time variability
- Evaluation of the implementation of an abstract interpretation algorithm using tabled CLP*
- Set-sharing is redundant for pair-sharing
- Non-strict independence-based program parallelization using sharing and freeness information
- Deriving descriptions of possible values of program variables by means of abstract interpretation
- Practical run-time checking via unobtrusive property caching
- Negative Ternary Set-Sharing
- scientific article; zbMATH DE number 1692904 (Why is no real title available?)
- The role of linearity in sharing analysis
- Efficient description logic reasoning in Prolog: The DLog system
- Abstract semantic dependency
- Bottom-up abstract interpretation of logic programs
- Three improvements to the top-down solver
- Optimality in goal-dependent analysis of Sharing
- Semantic code browsing
This page was built for publication: Compile-time derivation of variable dependency using abstract interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012713)