Ciao

swMATH12088MaRDI QIDQ24022FDOQ24022

Author name not available (Why is that?)

Cited In (52)

• A framework for verification and debugging of resource usage properties: resource usage verification
• Kripke semantics for higher-order type theory applied to constraint logic programming languages
• Interval-Based Resource Usage Verification: Formalization and Prototype
• PAN: A portable, parallel Prolog: Its design, realisation and performance.
• Abstraction-carrying code: a model for mobile code safety
• Towards a Type Discipline for Answer Set Programming
• Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP
• Testing your (static analysis) truths
• Efficient Local Unfolding with Ancestor Stacks for Full Prolog
• Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
• Closed-form upper bounds in static cost analysis
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• Extending Constructive Logic Negation with Types
• Termination of floating-point computations
• Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
• Enforcing termination of interprocedural analysis
• A general framework for static profiling of parametric resource usage
• Functional and Logic Programming
• A polymorphic type dependency analysis for logic programs
• Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types
• SCLP for Trust Propagation in Small-World Networks
• A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
• A Transformational Approach to Parametric Accumulated-Cost Static Profiling
• Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
• A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
• Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
• Title not available (Why is that?)
• Inferring energy bounds via static program analysis and evolutionary modeling of basic blocks
• Non-strict independence-based program parallelization using sharing and freeness information
• Practical run-time checking via unobtrusive property caching
• Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
• Cost analysis of object-oriented bytecode programs
• Reduced Certificates for Abstraction-Carrying Code
• Program Development in Computational Logic
• Abstract interpretation of resolution-based semantics
• Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming
• Relational cost analysis in a functional-imperative setting
• From Fuzzy to Annotated Semantic Web Languages
• Incremental and Modular Context-sensitive Analysis
• Derivation of efficient logic programs by specialization and reduction of nondeterminism
• Finite-tree analysis for constraint logic-based languages
• Three improvements to the top-down solver
• A study on the practicality of poly-controlled partial evaluation
• Description and Optimization of Abstract Machines in a Dialect of Prolog
• Semantic code browsing
• Abstract Interpretation with Specialized Definitions

This page was built for software: Ciao