Automated verification of refinement laws (Q1037397): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FLOTTER / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026501147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered chaining calculi for first-order theories of transitive relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning algebraically about loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Automated Termination Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Resolution: A Proof Procedure Based on Finite Model Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain Axioms for a Family of Near-Semirings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal Semirings Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning for Hybrid Systems — Two Case Studies — / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning in Kleene Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Automating the Calculus of Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completeness theorem for Kleene algebras and the algebra of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using probabilistic Kleene algebra pKA for protocol verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: IeanCOP: lean connection-based theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition Invariants and Transition Predicate Abstraction for Program Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract abstract reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal Tools for Separation and Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SRASS - A Semantic Relevance Axiom Selection System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5486135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TPTP problem library. CNF release v1. 2. 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating general purpose automated theorem proving systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a refinement algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: System Description: Spass Version 3.0 / rank
 
Normal rank

Latest revision as of 03:56, 2 July 2024

scientific article
Language Label Description Also known as
English
Automated verification of refinement laws
scientific article

    Statements

    Automated verification of refinement laws (English)
    0 references
    0 references
    0 references
    0 references
    16 November 2009
    0 references
    demonic refinement algebras
    0 references
    Kleene algebras
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers