On the public citation graph
An Assertion Language for Constraint Logic Programs
0 signed · 100 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/10720327_16openalex-snapshot
Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs
inferredcites →https://doi.org/10.1007/3-540-16492-8openalex-snapshot
Third International Conference on Logic Programming
inferredcites →https://doi.org/10.1007/3-540-49481-2_43openalex-snapshot
A Framework for Assertion-based Debugging in Constraint Logic Programming
inferredcites →https://doi.org/10.1007/3-540-61055-3openalex-snapshot
Programming Languages and Systems — ESOP '96
inferredcites →https://doi.org/10.1007/3-540-61055-3_32openalex-snapshot
Global analysis of standard Prolog programs
inferredcites →https://doi.org/10.1007/978-3-642-60085-2_7openalex-snapshot
Using Global Analysis, Partial Specifications, and an Extensible Assertion Language for Program Validation and Debugging
inferredcites →https://doi.org/10.1016/0743-1066(91)80002-uopenalex-snapshot
A type system for logic programs
inferredcites →https://doi.org/10.1016/0743-1066(92)90035-2openalex-snapshot
Compile-time derivation of variable dependency using abstract interpretation
inferredcites →https://doi.org/10.1016/0743-1066(94)90026-4openalex-snapshot
The s-semantics approach: Theory and applications
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1016/s0743-1066(96)00068-4openalex-snapshot
The execution algorithm of mercury, an efficient purely declarative logic programming language
inferredcites →https://doi.org/10.1109/2.108055openalex-snapshot
High-performance logic programming with the Aquarius Prolog compiler
inferredcites →https://doi.org/10.1109/acsc.2000.824398openalex-snapshot
A three-valued declarative debugging scheme
inferredcites →https://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferredcites →https://doi.org/10.1145/158511.158685openalex-snapshot
The 3 R's of optimizing constraint logic programs
inferredcites →https://doi.org/10.1145/232706.232734openalex-snapshot
Global analysis of constraint logic programs
inferredcites →https://doi.org/10.1145/263699.263744openalex-snapshot
Types as abstract interpretations
inferredcites →https://doi.org/10.7551/mitpress/1192.001.0001openalex-snapshot
Algorithmic Program Debugging
inferredcites →https://doi.org/10.7551/mitpress/4304.003.0011openalex-snapshot
Program Analysis, Debugging, and Optimization Using the Ciao System Preprocessor
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11506676_10openalex-snapshot
Efficient Local Unfolding with Ancestor Stacks for Full Prolog
inferred← citeshttps://doi.org/10.1007/11506676_2openalex-snapshot
Determinacy Analysis for Logic Programs Using Mode and Type Information
inferred← citeshttps://doi.org/10.1007/11680093_11openalex-snapshot
Experiments in Context-Sensitive Analysis of Modular Programs
inferred← citeshttps://doi.org/10.1007/11680093_8openalex-snapshot
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
inferred← citeshttps://doi.org/10.1007/11737414_11openalex-snapshot
A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems
inferred← citeshttps://doi.org/10.1007/11916277_27openalex-snapshot
Context-Sensitive Multivariant Assertion Checking in Modular Programs
inferred← citeshttps://doi.org/10.1007/3-540-36607-5_1openalex-snapshot
Abstract Verification and Debugging of Constraint Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-44898-5_8openalex-snapshot
Program Development Using Abstract Interpretation (And the Ciao System Preprocessor)
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_7openalex-snapshot
Program Debugging and Validation Using Semantic Approximations and Partial Specifications
inferred← citeshttps://doi.org/10.1007/978-3-030-13838-7_11openalex-snapshot
Multivariant Assertion-Based Guidance in Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-030-45260-5openalex-snapshot
Logic-Based Program Synthesis and Transformation
inferred← citeshttps://doi.org/10.1007/978-3-030-45260-5_3openalex-snapshot
Incremental Analysis of Logic Programs with Assertions and Open Predicates
inferred← citeshttps://doi.org/10.1007/978-3-030-45260-5_4openalex-snapshot
Computing Abstract Distances in Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_2openalex-snapshot
Cost Analysis of Smart Contracts Via Parametric Resource Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_14openalex-snapshot
Testing Your (Static Analysis) Truths
inferred← citeshttps://doi.org/10.1007/978-3-031-35254-6_2openalex-snapshot
Types, Modes and so Much More – The Prolog Way
inferred← citeshttps://doi.org/10.1007/978-3-031-45784-5_6openalex-snapshot
A Rule-Based Approach for Designing and Composing Abstract Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_22openalex-snapshot
Forward versus Backward Verification of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24836-1_7openalex-snapshot
Improved Compilation of Prolog to C Using Moded Types and Determinism Information
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_6openalex-snapshot
Analysing Logic Programs by Reasoning Backwards
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_8openalex-snapshot
A Generic Framework for Context-Sensitive Analysis of Modular Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_31openalex-snapshot
Abstract Interpretation-Based Mobile Code Certification
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_3openalex-snapshot
Some Techniques for Automated, Resource-Aware Distributed and Mobile Computing in a Multi-paradigm Programming System
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_25openalex-snapshot
Abstraction-Carrying Code
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_14openalex-snapshot
An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy
inferred← citeshttps://doi.org/10.1007/978-3-540-69611-7_8openalex-snapshot
Verification of Java Bytecode Using Analysis and Transformation of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_7openalex-snapshot
Towards Description and Optimization of Abstract Machines in an Extension of Prolog
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_23openalex-snapshot
Automatic Binding-Related Error Diagnosis in Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-02846-5_25openalex-snapshot
Integrating Software Testing and Run-Time Checking in an Assertion Verification Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-20775-4_5openalex-snapshot
Lazy and Enforceable Assertions for Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-27694-1_4openalex-snapshot
Contracts and Specifications for Functional Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-32495-6_4openalex-snapshot
Interval-Based Resource Usage Verification: Formalization and Prototype
inferred← citeshttps://doi.org/10.1007/s00354-008-0039-7openalex-snapshot
Abstraction-Carrying Code: a Model for Mobile Code Safety
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.032openalex-snapshot
An Abstract Interpretation-based Approach to Mobile Code Safety
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.060openalex-snapshot
An Efficient, Parametric Fixpoint Algorithm for Analysis of Java Bytecode
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.022openalex-snapshot
Extending Constructive Logic Negation with Types
inferred← citeshttps://doi.org/10.1016/j.scico.2005.02.006openalex-snapshot
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
inferred← citeshttps://doi.org/10.1016/j.scico.2017.12.006openalex-snapshot
Some trade-offs in reducing the overhead of assertion run-time checks via static analysis
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00153-7openalex-snapshot
Logic programs as specifications in the inductive verification of logic programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80637-1openalex-snapshot
Some Issues in Analysis and Specialization of Modular Ciao-Prolog Programs
inferred← citeshttps://doi.org/10.1017/s1471068404002017openalex-snapshot
cTI: a constraint-based termination inference tool for ISO-Prolog
inferred← citeshttps://doi.org/10.1017/s1471068406002742openalex-snapshot
A three-valued semantics for logic programmers
inferred← citeshttps://doi.org/10.1017/s1471068409990263openalex-snapshot
Efficient local unfolding with ancestor stacks
inferred← citeshttps://doi.org/10.1017/s1471068411000457openalex-snapshot
An overview of Ciao and its design philosophy
inferred← citeshttps://doi.org/10.1017/s1471068414000672openalex-snapshot
Description and Optimization of Abstract Machines in a Dialect of Prolog
inferred← citeshttps://doi.org/10.1017/s1471068415000344openalex-snapshot
Practical run-time checking via unobtrusive property caching
inferred← citeshttps://doi.org/10.1017/s1471068418000042openalex-snapshot
Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
inferred← citeshttps://doi.org/10.1017/s1471068421000430openalex-snapshot
VeriFly: On-the-fly Assertion Checking via Incrementality
inferred← citeshttps://doi.org/10.1017/s1471068422000102openalex-snapshot
Fifty Years of Prolog and Beyond
inferred← citeshttps://doi.org/10.1017/s1471068425100069openalex-snapshot
Checkification: A Practical Approach for Testing Static Analysis Truths
inferred← citeshttps://doi.org/10.1017/s147106842510015xopenalex-snapshot
Hiord $^{{\kern2pt}\sharp}$ : An Approach to the Specification and Verification of Higher-Order (C)LP Programs
inferred← citeshttps://doi.org/10.1017/s1471068426100672openalex-snapshot
Exploiting Multiple Abstract Call Patterns for Optimizing Run-Time Checks
inferred← citeshttps://doi.org/10.1109/icsmc.2004.1399773openalex-snapshot
Experiments in abstract interpretation-based code certification for pervasive systems
inferred← citeshttps://doi.org/10.1145/1069774.1069775openalex-snapshot
Abstraction carrying code and resource-awareness
inferred← citeshttps://doi.org/10.1145/1176760.1176794openalex-snapshot
High-level languages for small devices
inferred← citeshttps://doi.org/10.1145/1328408.1328418openalex-snapshot
A practical type analysis for verification of modular prolog programs
inferred← citeshttps://doi.org/10.1145/2003476.2003496openalex-snapshot
CLP projection for constraint handling rules
inferred← citeshttps://doi.org/10.1145/2643135.2643148openalex-snapshot
Assertion-based Debugging of Higher-Order (C)LP Programs
inferred← citeshttps://doi.org/10.1145/2967973.2968597openalex-snapshot
Reducing the overhead of assertion run-time checks via static analysis
inferred← citeshttps://doi.org/10.1145/3236950.3236970openalex-snapshot
Static Performance Guarantees for Programs with Runtime Checks
inferred← citeshttps://doi.org/10.1145/777388.777393openalex-snapshot
Abstract specialization and its applications
inferred← citeshttps://doi.org/10.1145/966049.777393openalex-snapshot
Abstract specialization and its applications
inferred← citeshttps://doi.org/10.20868/upm.thesis.329openalex-snapshot
Poly-controlled partial evaluation and its application to resource-aware program specialization
inferred← citeshttps://doi.org/10.20868/upm.thesis.52114openalex-snapshot
A multi-language and multi-platform framework for resource consumption analysis and its application to energy-efficient software development
inferred← citeshttps://doi.org/10.20868/upm.thesis.52401openalex-snapshot
Improving Run-time Checking in Dynamic Programming Languages
inferred← citeshttps://doi.org/10.20868/upm.thesis.66526openalex-snapshot
A General Framework for Static Resource Analysis and Profiling of (Parallel) Programs and an Application to Runtime Checking
inferred← citeshttps://doi.org/10.20868/upm.thesis.9886openalex-snapshot
Un marco unificado para análisis de recursos y tiempo de ejecución, validación dinámica y pruebas unitarias = a Unified Framework for Resource and Execution Time Analysis, Run-Time Checking and Unit-Testing
inferred← citeshttps://doi.org/10.4204/eptcs.306.8openalex-snapshot
Prolog Coding Guidelines: Status and Tool Support
inferred← citeshttps://doi.org/10.4204/eptcs.338.13openalex-snapshot
Proceedings of the 6th Workshop on Formal Integrated Development Environment
inferred← citeshttps://doi.org/10.4204/eptcs.385openalex-snapshot
EPTCS 385-Proceedings 39th International Conference on Logic Programming
inferred← citeshttps://doi.org/10.4204/eptcs.385.0openalex-snapshot
Proceedings 39th International Conference on Logic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1404.4246openalex-snapshot
An Approach to Assertion-based Debugging of Higher-Order (C)LP Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1512.09369openalex-snapshot
Towards Energy Consumption Verification via Static Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2106.07045openalex-snapshot
VeriFly: On-the-fly Assertion Checking via Incrementality
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0508004openalex-snapshot
A three-valued semantics for logic programmers
inferred← citeshttps://doi.org/10.5555/1760267.1760278openalex-snapshot
Program development using abstract interpretation (and the ciao system preprocessor)
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.