Ciao

swMATH12088MaRDI QIDQ24022FDOQ24022

Author name not available (Why is that?)

Official website: http://ciao-lang.org/

Cited In (only showing first 100 items - show all)

• Kripke semantics for higher-order type theory applied to constraint logic programming languages
• PAN: A portable, parallel Prolog: Its design, realisation and performance.
• Resource usage analysis of logic programs via abstract interpretation using sized types
• Abstraction-carrying code: a model for mobile code safety
• Testing your (static analysis) truths
• Efficient Local Unfolding with Ancestor Stacks for Full Prolog
• Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
• Closed-form upper bounds in static cost analysis
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• Termination of floating-point computations
• Functional and Logic Programming
• A polymorphic type dependency analysis for logic programs
• A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
• Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
• A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
• Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
• ACIDE
• DLV-Complex
• DASWAM
• PURRS
• clpfd
• CDAOstore
• Prolog
• wamcc
• B-Prolog
• ATGen
• YAP-Prolog
• Hiord
• TRACER
• Title not available (Why is that?)
• PhyloWS
• Mercury
• GENA
• DPPD
• HSF
• CiaoPP
• SICStus
• net.datastructures
• WebPIE
• NP Datalog
• CAT
• OPTYap
• PrologCheck
• XSB
• YapOr
• CoALP
• Inferring energy bounds via static program analysis and evolutionary modeling of basic blocks
• GHC
• ACE
• DeLorean
• FPROLOG
• FRIL
• SeaHorn
• Goblint
• SWI-Prolog
• VeriMAP
• PARLOG
• RAHFT
• April
• JayHorn
• Cibai
• LPaaS
• Refal
• HaLoop
• TiML
• Yedalog
• SWISH DataLab
• Non-strict independence-based program parallelization using sharing and freeness information
• Practical run-time checking via unobtrusive property caching
• SenticNet
• IncA
• 2P-Kt
• ReSpecT
• tuProlog
• TuCSoN
• TuSoW
• From fuzzy to annotated semantic web languages
• Cost analysis of object-oriented bytecode programs
• Reduced Certificates for Abstraction-Carrying Code
• Program Development in Computational Logic
• Abstract interpretation of resolution-based semantics
• Relational cost analysis in a functional-imperative setting
• Derivation of efficient logic programs by specialization and reduction of nondeterminism
• Finite-tree analysis for constraint logic-based languages
• eThor
• A framework for verification and debugging of resource usage properties: resource usage verification
• VeriFly
• Towards a Type Discipline for Answer Set Programming
• A transformational approach to parametric accumulated-cost static profiling
• Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
• A general framework for static profiling of parametric resource usage
• Incremental and modular context-sensitive analysis
• SCLP for Trust Propagation in Small-World Networks
• Description and optimization of abstract machines in a dialect of Prolog
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates

This page was built for software: Ciao