Ciao
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- Non-strict independence-based program parallelization using sharing and freeness information
- From fuzzy to annotated semantic web languages
- scientific article; zbMATH DE number 2090844 (Why is no real title available?)
- 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
- Abstraction-carrying code: a model for mobile code safety
- A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic 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
- Kripke semantics for higher-order type theory applied to constraint logic programming languages
- Abstract interpretation of resolution-based semantics
- COSTA
- CS-Prolog
- Termination of floating-point computations
- PAG
- TCHR
- LPTP
- HYPROLOG
- LOGEN
- ECCE
- DLV-Complex
- DASWAM
- PURRS
- clpfd
- CDAOstore
- Prolog
- wamcc
- B-Prolog
- ATGen
- YAP-Prolog
- Hiord
- TRACER
- PhyloWS
- Mercury
- GENA
- DPPD
- HSF
- CiaoPP
- SICStus
- net.datastructures
- WebPIE
- NP Datalog
- CAT
- OPTYap
- PrologCheck
- XSB
- YapOr
- CoALP
- GHC
- ACE
- DeLorean
- FPROLOG
- FRIL
- SeaHorn
- Goblint
- SWI-Prolog
- VeriMAP
- PARLOG
- RAHFT
- April
- JayHorn
- Cibai
- LPaaS
- Refal
- HaLoop
- TiML
- Yedalog
- SWISH DataLab
- A polymorphic type dependency analysis for logic programs
- SenticNet
- IncA
- 2P-Kt
- ReSpecT
- tuProlog
- TuCSoN
- TuSoW
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
- Closed-form upper bounds in static cost analysis
- Reduced Certificates for Abstraction-Carrying Code
- Inferring energy bounds via static program analysis and evolutionary modeling of basic blocks
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Cost analysis of object-oriented bytecode programs
- Program Development in Computational Logic
- VeriFly
- scientific article; zbMATH DE number 1497828 (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?)
- Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
- 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*
- Testing your (static analysis) truths
- A general framework for static profiling of parametric resource usage
- Extending constructive logic negation with types
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
This page was built for software: Ciao
