Checking Sufficient Completeness by Inductive Theorem Proving (Q6487296): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simultaneous checking of completeness and ground confluence for algebraic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-driven automated induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification and proof in membership equational logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination Modulo Combinations of Equational Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ground confluence of order-sorted conditional specifications modulo axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Folding variant narrowing and optimal variant termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic specification of abstract data types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Completeness of Context-Sensitive Order-Sorted Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic proofs by induction in theories without constructors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient-completeness, ground-reducibility and their complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit representation of terms defined by counter examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms and normal theories in conditional rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ground Convergence and Completeness of Conditional Equational Program Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional rewriting logic as a unified model of concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variant-Based Satisfiability in Initial Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational formulas and pattern operations in initial order-sorted algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof method for local sufficient completeness of term rewriting systems / rank
 
Normal rank

Latest revision as of 11:46, 3 December 2024

scientific article; zbMATH DE number 7628081
Language Label Description Also known as
English
Checking Sufficient Completeness by Inductive Theorem Proving
scientific article; zbMATH DE number 7628081

    Statements

    Checking Sufficient Completeness by Inductive Theorem Proving (English)
    0 references
    0 references
    7 December 2022
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers