CiaoPP

swMATH12089MaRDI QIDQ24023

No author found.

Related Items (46)

Verifying Catamorphism-Based Contracts using Constrained Horn Clauses ⋮ Interval-Based Resource Usage Verification: Formalization and Prototype ⋮ Certificate size reduction in abstraction-carrying code ⋮ Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates ⋮ Converting One Type-Based Abstract Domain to Another ⋮ Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types ⋮ Three improvements to the top-down solver ⋮ Practical run-time checking via unobtrusive property caching ⋮ Description and Optimization of Abstract Machines in a Dialect of Prolog ⋮ 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 ⋮ Closed-form upper bounds in static cost analysis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Context-Sensitive Multivariant Assertion Checking in Modular Programs ⋮ Program Development in Computational Logic ⋮ 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 ⋮ Kripke semantics for higher-order type theory applied to constraint logic programming languages ⋮ A polymorphic type dependency analysis for logic programs ⋮ Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses ⋮ Enforcing termination of interprocedural analysis ⋮ Reduced Certificates for Abstraction-Carrying Code ⋮ A Transformational Approach to Parametric Accumulated-Cost Static Profiling ⋮ Abstract Interpretation with Specialized Definitions ⋮ Incremental and Modular Context-sensitive Analysis ⋮ Determinacy Analysis for Logic Programs Using Mode and Type Information ⋮ Efficient Local Unfolding with Ancestor Stacks for Full Prolog ⋮ Towards a Type Discipline for Answer Set Programming ⋮ Cost analysis of object-oriented bytecode programs ⋮ A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification ⋮ Non-strict independence-based program parallelization using sharing and freeness information ⋮ Functional and Logic Programming ⋮ Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor) ⋮ Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs ⋮ A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs ⋮ A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism ⋮ Relational cost analysis in a functional-imperative setting ⋮ PAN: A portable, parallel Prolog: Its design, realisation and performance. ⋮ A Study on the Practicality of Poly-Controlled Partial Evaluation ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism ⋮ Finite-tree analysis for constraint logic-based languages ⋮ Testing your (static analysis) truths

This page was built for software: CiaoPP