Using induction and rewriting to verify and complete parameterized specifications (Q672051): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NQTHM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing structural induction. II: Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated deduction -- CADE-12. 12th international conference, Nancy, France, June 26 -- July 1, 1994. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit induction in conditional theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Mathematical Induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing ground reducibility and inductively complete positions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rippling: A heuristic for guiding inductive proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong restriction of the inductive completion procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract data types and software validation / 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: Linearizing term rewriting systems using test sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs by induction in equational theories with constructors / 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: On sufficient-completeness and related properties of term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the ground (co-)reducibility property in term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3034806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3345752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameter-preserving data type specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805961 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(96)80708-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4246703498 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Using induction and rewriting to verify and complete parameterized specifications
scientific article

    Statements

    Using induction and rewriting to verify and complete parameterized specifications (English)
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    Theorem proving
    0 references
    Sufficient completeness
    0 references
    Implicit induction
    0 references
    Parameterized conditional specifications
    0 references
    Term rewriting systems
    0 references
    specification and validation of software
    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
    0 references