Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs (Q5403086): Difference between revisions

From MaRDI portal
Changed an 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-54624-2_31 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2125379699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods for Open Object-Based Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hidden agenda / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of proof scores in CafeOBJ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and verification of real-time systems based on equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructor-Based Inductive Theorem Prover / 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: An attack on the Needham-Schroeder public-key authentication protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using encryption for authentication in large networks of computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of public key protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational abstractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Safety Properties of Rewrite Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Logical Model Checking of Infinite-State Systems Using Narrowing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular Coinduction: A Proof Theoretical Foundation / rank
 
Normal rank

Latest revision as of 12:05, 7 July 2024

scientific article; zbMATH DE number 6273818
Language Label Description Also known as
English
Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs
scientific article; zbMATH DE number 6273818

    Statements

    Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs (English)
    0 references
    0 references
    0 references
    25 March 2014
    0 references
    (bounded) model checking
    0 references
    proof score
    0 references
    rewrite theory specification
    0 references
    search
    0 references
    theorem proving
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers