Cited in
(83)- VeriFly
- Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
- Evaluation of the implementation of an abstract interpretation algorithm using tabled CLP*
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
- Converting One Type-Based Abstract Domain to Another
- Three improvements to the top-down solver
- scientific article; zbMATH DE number 7453190 (Why is no real title available?)
- scientific article; zbMATH DE number 1497832 (Why is no real title available?)
- scientific article; zbMATH DE number 1497834 (Why is no real title available?)
- scientific article; zbMATH DE number 1497843 (Why is no real title available?)
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
- Non-strict independence-based program parallelization using sharing and freeness information
- Context-Sensitive Multivariant Assertion Checking in Modular Programs
- Testing your (static analysis) truths
- A general framework for static profiling of parametric resource usage
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog
- PAN: A portable, parallel Prolog: Its design, realisation and performance.
- Relational cost analysis in a functional-imperative setting
- Certificate size reduction in abstraction-carrying code
- Abstraction-carrying code: a model for mobile code safety
- Functional and Logic Programming
- A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
- Abstract Interpretation with Specialized Definitions
- Interval-based resource usage verification: formalization and prototype
- 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
- Kripke semantics for higher-order type theory applied to constraint logic programming languages
- COSTA
- CS-Prolog
- PAG
- TCHR
- LPTP
- LOGEN
- ECCE
- DLV-Complex
- DASWAM
- PURRS
- wamcc
- YAP-Prolog
- Hiord
- Towards a Type Discipline for Answer Set Programming
- A framework for verification and debugging of resource usage properties: resource usage verification
- Mercury
- GENA
- DPPD
- HSF
- Ciao
- SICStus
- net.datastructures
- CAT
- OPTYap
- XSB
- CoALP
- GHC
- ACE
- Practical run-time checking via unobtrusive property caching
- SeaHorn
- Goblint
- BoogiePL
- VeriMAP
- PARLOG
- RAHFT
- JayHorn
- Cibai
- Refal
- TiML
- A polymorphic type dependency analysis for logic programs
- IncA
- Incremental and modular context-sensitive analysis
- Description and optimization of abstract machines in a dialect of Prolog
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
- A transformational approach to parametric accumulated-cost static profiling
- A study on the practicality of poly-controlled partial evaluation
- Closed-form upper bounds in static cost analysis
- Reduced Certificates for Abstraction-Carrying Code
- Determinacy Analysis for Logic Programs Using Mode and Type Information
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Cost analysis of object-oriented bytecode programs
- Semantic code browsing
- Resource usage analysis of logic programs via abstract interpretation using sized types
- Program Development in Computational Logic
This page was built for software: CiaoPP
