An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The s-semantics approach: Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of observables for logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositionality properties of SLD-derivations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive versions of Tarski's fixed point theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systematic design of program transformation frameworks by abstract interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A galois connection calculus for abstract interpretation / 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: Nondeterminism and infinite computations in constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite failures and partial computations in concurrent logic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Declarative modeling of the operational behavior of logic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model-theoretic reconstruction of the operational semantics of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error diagnosis in logic programming an adaptation of E.Y. Shapiro's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observable behaviors and equivalences of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resultant semantics for prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a declarative semantics for infinite objects in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite failure is and-compositional / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closures and fairness in the semantics of programming logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A denotational framework for data flow analysis / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:29, 5 June 2024

scientific article
Language Label Description Also known as
English
An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
scientific article

    Statements

    An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (English)
    0 references
    0 references
    21 January 2003
    0 references
    0 references
    SLD-derivations
    0 references
    Semantics
    0 references
    Compositionality
    0 references
    Finite failure
    0 references
    Abstract interpretation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references