Pages that link to "Item:Q2893101"
From MaRDI portal
The following pages link to An overview of Ciao and its design philosophy (Q2893101):
Displaying 44 items.
- A sharing-based approach to supporting adaptation in service compositions (Q488324) (← links)
- ATLAS: automated amortised complexity analysis of self-adjusting data structures (Q832253) (← links)
- Testing your (static analysis) truths (Q2119122) (← links)
- \textsc{Tor}: modular search with hookable disjunction (Q2441515) (← links)
- A Transformational Approach to Parametric Accumulated-Cost Static Profiling (Q2798274) (← links)
- Incremental Tabling in Support of Knowledge Representation and Reasoning (Q2931264) (← links)
- Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (Q2931277) (← links)
- Horn Clause Solvers for Program Verification (Q2947164) (← links)
- Pre-indexed Terms for Prolog (Q2949716) (← links)
- Constraint Answer Set Programming without Grounding (Q4559798) (← links)
- An iterative approach to precondition inference using constrained Horn clauses (Q4559813) (← links)
- Top-down and Bottom-up Evaluation Procedurally Integrated (Q4559824) (← links)
- Tabling as a library with delimited control (Q4592987) (← links)
- Concolic testing in logic programming (Q4593010) (← 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)
- Tree dimension in verification of constrained Horn clauses (Q4644355) (← links)
- Description, Implementation, and Evaluation of a Generic Design for Tabled CLP (Q4957184) (← links)
- A Transformational Approach to Resource Analysis with Typed-norms Inference (Q4957197) (← links)
- Incremental and Modular Context-sensitive Analysis (Q4957220) (← links)
- (Q5015369) (← links)
- (Q5020543) (← links)
- (Q5020962) (← links)
- From Logic to Functional Logic Programs (Q5038460) (← links)
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (Q5038461) (← links)
- Making ProB Compatible with SWI-Prolog (Q5038477) (← links)
- Three improvements to the top-down solver (Q5084314) (← 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)
- Failure tabled constraint logic programming by interpolation (Q5398297) (← links)
- A practical analysis of non-termination in large logic programs (Q5398306) (← links)
- Singular and plural functions for functional logic programming (Q5410261) (← links)
- Type-based analysis of logarithmic amortised complexity (Q5875895) (← links)
- Enforcing termination of interprocedural analysis (Q5915716) (← links)
- Transformation-Enabled Precondition Inference (Q6063861) (← links)
- VeriFly: <i>On-the-fly Assertion Checking via Incrementality</i> (Q6063866) (← links)
- Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming (Q6063873) (← 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)
- An empirically supported approach to the treatment of imprecision in vague reasoning (Q6178739) (← links)
