On the verification of finite failure (Q2575838): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2005.06.001 / 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.jcss.2005.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982588979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about prolog programs: From modes through types to assertions / 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: Q4506391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract diagnosis / 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: Systematic design of program transformation frameworks by 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: Inductive assertion method for logic pograms / 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: An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. / 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: Q4217939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of success patterns in logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first-order language for expressing sharing and type properties of logic programs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2005.06.001 / rank
 
Normal rank

Latest revision as of 08:15, 19 December 2024

scientific article
Language Label Description Also known as
English
On the verification of finite failure
scientific article

    Statements

    On the verification of finite failure (English)
    0 references
    0 references
    0 references
    7 December 2005
    0 references
    Abstract interpretation
    0 references
    Logic programming
    0 references
    Program verification
    0 references
    Finite failure
    0 references

    Identifiers