The following pages link to CiaoPP (Q24023):
Displayed 46 items.
- Kripke semantics for higher-order type theory applied to constraint logic programming languages (Q683712) (← links)
- Cost analysis of object-oriented bytecode programs (Q764297) (← links)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
- Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
- Abstraction-carrying code: a model for mobile code safety (Q949170) (← links)
- Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses (Q980470) (← links)
- Non-strict independence-based program parallelization using sharing and freeness information (Q1035704) (← links)
- A polymorphic type dependency analysis for logic programs (Q1758668) (← links)
- PAN: A portable, parallel Prolog: Its design, realisation and performance. (Q1862650) (← links)
- Testing your (static analysis) truths (Q2119122) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor) (Q2568449) (← links)
- A Transformational Approach to Parametric Accumulated-Cost Static Profiling (Q2798274) (← links)
- A Study on the Practicality of Poly-Controlled Partial Evaluation (Q2873793) (← links)
- (Q2883083) (← links)
- Certificate size reduction in abstraction-carrying code (Q2909518) (← links)
- Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (Q2931277) (← links)
- Interval-Based Resource Usage Verification: Formalization and Prototype (Q3167526) (← links)
- Abstract Interpretation with Specialized Definitions (Q3613381) (← links)
- Towards a Type Discipline for Answer Set Programming (Q3638249) (← links)
- (Q4499255) (← links)
- (Q4499257) (← links)
- (Q4499271) (← links)
- Practical run-time checking via unobtrusive property caching (Q4593012) (← links)
- Description and Optimization of Abstract Machines in a Dialect of Prolog (Q4593018) (← links)
- Semantic code browsing (Q4593054) (← links)
- A general framework for static profiling of parametric resource usage (Q4593063) (← links)
- Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption (Q4644354) (← links)
- Incremental and Modular Context-sensitive Analysis (Q4957220) (← links)
- (Q5020649) (← links)
- Relational cost analysis in a functional-imperative setting (Q5020903) (← links)
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (Q5038461) (← links)
- Three improvements to the top-down solver (Q5084314) (← links)
- Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP (Q5108525) (← links)
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates (Q5302883) (← links)
- Converting One Type-Based Abstract Domain to Another (Q5302885) (← links)
- Functional and Logic Programming (Q5308016) (← links)
- Context-Sensitive Multivariant Assertion Checking in Modular Programs (Q5387906) (← links)
- Reduced Certificates for Abstraction-Carrying Code (Q5449599) (← links)
- Determinacy Analysis for Logic Programs Using Mode and Type Information (Q5458791) (← links)
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog (Q5458800) (← links)
- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs (Q5504598) (← links)
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs (Q5504599) (← links)
- A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism (Q5504687) (← links)
- Program Development in Computational Logic (Q5712549) (← links)
- Enforcing termination of interprocedural analysis (Q5915716) (← links)