Pages that link to "Item:Q2568449"
From MaRDI portal
The following pages link to Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor) (Q2568449):
Displaying 41 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)
- 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)
- A Transformational Approach to Parametric Accumulated-Cost Static Profiling (Q2798274) (← links)
- Mathematical programming based debugging (Q2861570) (← links)
- A study on the practicality of poly-controlled partial evaluation (Q2873793) (← links)
- An overview of Ciao and its design philosophy (Q2893101) (← links)
- Certificate size reduction in abstraction-carrying code (Q2909518) (← links)
- A Module System for Domain-Specific Languages (Q2931279) (← links)
- Parallel backtracking with answer memoing for independent and-parallelism (Q3087444) (← links)
- A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics (Q3498435) (← links)
- Towards a Type Discipline for Answer Set Programming (Q3638249) (← 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)
- Lightweight compilation of (C)LP to JavaScript (Q4911147) (← 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)
- A General Framework for Static Cost Analysis of Parallel Logic Programs (Q5097623) (← links)
- Incremental Analysis of Logic Programs with Assertions and Open Predicates (Q5097624) (← links)
- Computing Abstract Distances in Logic Programs (Q5097625) (← links)
- An Integrated Approach to Assertion-Based Random Testing in Prolog (Q5097633) (← links)
- Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP (Q5108525) (← links)
- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs (Q5504598) (← links)
- A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism (Q5504687) (← links)
- Enforcing termination of interprocedural analysis (Q5915716) (← links)
- VeriFly: <i>On-the-fly Assertion Checking via Incrementality</i> (Q6063866) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
- Parallel Logic Programming: A Sequel (Q6063892) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
- Regular path clauses and their application in solving loops (Q6647300) (← links)
