Finite-tree analysis for constraint logic-based languages (Q817224): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: YAP-Prolog / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CiaoPP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SICStus / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2004.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994418588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Records for logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parser generation and grammar manipulation using prolog's infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving descriptions of possible values of program variables by means of abstract interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type analysis of prolog using type graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Logic of Typed Feature Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semantic basis for the termination analysis of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: cTI: a constraint-based termination inference tool for ISO-Prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theoretical foundations of LPTP (a logic program theorem prover) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced sharing analysis techniques: a comprehensive evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinations of abstract domains for logic programming: Open product and generic pattern construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract interpretation and application to logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Functions for Finite-Tree Dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pair-sharing over rational trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classes of Boolean functions for dependency analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Interpretation Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soundness, idempotence and commutativity of set-sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing is optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On derived dependencies and connected databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static analysis of logic programs for independent and parallelism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quotient of an abstract interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-sharing is redundant for pair-sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing non-redundant sharing by complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2722073 / rank
 
Normal rank

Latest revision as of 11:47, 24 June 2024

scientific article
Language Label Description Also known as
English
Finite-tree analysis for constraint logic-based languages
scientific article

    Statements

    Finite-tree analysis for constraint logic-based languages (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 March 2006
    0 references
    0 references
    static analysis
    0 references
    abstract interpretation
    0 references
    rational unification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references