Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
From MaRDI portal
Publication:2568449
Recommendations
Cited in
(47)- Non-strict independence-based program parallelization using sharing and freeness information
- A polymorphic type dependency analysis for logic programs
- PAN: A portable, parallel Prolog: Its design, realisation and performance.
- Testing your (static analysis) truths
- Closed-form upper bounds in static cost analysis
- A transformational approach to parametric accumulated-cost static profiling
- Mathematical programming based debugging
- A study on the practicality of poly-controlled partial evaluation
- An overview of Ciao and its design philosophy
- Certificate size reduction in abstraction-carrying code
- A module system for domain-specific languages
- Parallel backtracking with answer memoing for independent and-parallelism
- A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics
- Abstract Interpretation with Specialized Definitions
- Towards a Type Discipline for Answer Set Programming
- scientific article; zbMATH DE number 1975609 (Why is no real title available?)
- Semantic code browsing
- A general framework for static profiling of parametric resource usage
- Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
- scientific article; zbMATH DE number 2086611 (Why is no real title available?)
- scientific article; zbMATH DE number 2090844 (Why is no real title available?)
- Lightweight compilation of (C)LP to JavaScript
- Incremental and modular context-sensitive analysis
- scientific article; zbMATH DE number 7453190 (Why is no real title available?)
- Relational cost analysis in a functional-imperative setting
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
- Three improvements to the top-down solver
- A general framework for static cost analysis of parallel logic programs
- Incremental analysis of logic programs with assertions and open predicates
- Computing abstract distances in logic programs
- An integrated approach to assertion-based random testing in Prolog
- Evaluation of the implementation of an abstract interpretation algorithm using tabled CLP*
- Integrated and automated abstract interpretation, verification and testing of C/C++ modules
- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
- A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
- VeriFly: On-the-fly Assertion Checking via Incrementality
- Fifty Years of Prolog and Beyond
- Parallel Logic Programming: A Sequel
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- Multivariant assertion-based guidance in abstract interpretation
- Regular path clauses and their application in solving loops
- Kripke semantics for higher-order type theory applied to constraint logic programming languages
- Catamorphic abstractions for constrained Horn clause satisfiability
- Cost analysis of object-oriented bytecode programs
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
- Finite-tree analysis for constraint logic-based languages
- Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
This page was built for publication: Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568449)
