The following pages link to Ciao (Q24022):
Displaying 50 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)
- Termination of floating-point computations (Q850498) (← 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)
- Abstract interpretation of resolution-based semantics (Q1035705) (← links)
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
- Inferring energy bounds via static program analysis and evolutionary modeling of basic blocks (Q1671140) (← 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)
- Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming (Q2870287) (← links)
- A study on the practicality of poly-controlled partial evaluation (Q2873793) (← links)
- A framework for verification and debugging of resource usage properties: resource usage verification (Q2883083) (← links)
- Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (Q2931277) (← links)
- From Fuzzy to Annotated Semantic Web Languages (Q2970305) (← 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)
- (Q4499250) (← 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)
- (Q4813396) (← links)
- Incremental and Modular Context-sensitive Analysis (Q4957220) (← links)
- Extending Constructive Logic Negation with Types (Q4982631) (← 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)
- SCLP for Trust Propagation in Small-World Networks (Q5302723) (← links)
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates (Q5302883) (← links)
- Functional and Logic Programming (Q5308016) (← links)
- Reduced Certificates for Abstraction-Carrying Code (Q5449599) (← 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)
