Searching for "Refinement and Theorem Proving." – sorted by Relevance.
-
A Parametrized Index Theorem For The Algebraic K-Theory Euler Class
- and refine their theorem, and prove a converse stating that the Riemann--Roch condition is equivalent
- Cited by 2 (0 self) – Add To MetaCart
-
A PARAMETRIZED INDEX THEOREM FOR THE ALGEBRAIC K-THEORY EULER CLASS
- and refine their theorem, and prove a converse stating that the Riemann–Roch condition is equivalent
- Add To MetaCart
-
Formal Refinement and Model Checking of an Echo Cancellation Unit
- combines theorem proving-based refinement with model checking for state based real-time systems. Our
- Add To MetaCart
-
The challenge of hardware-software co-verification
- of completion. There is still the question of what kind of refinement theorem to prove and, more generally
- Cited by 1 (0 self) – Add To MetaCart
-
Object Organisation in Software Environments for Formal Methods
- refinement and theorem-proving as two major sub-tasks. We first analyse each of them in its own right
- Add To MetaCart
-
Environment Support for Software Consistency
- and theorem proving. In this section we demonstrate, via an example proof, the effects of applying consistency
- Cited by 5 (5 self) – Add To MetaCart
-
System Description: E-KRHyper
- into the atom r(c). Optionally two refinements of theorem proving methods based on model generation are employed
- Cited by 2 (1 self) – Add To MetaCart
-
A Mechanized Refinement Proof for a Garbage Collector
- ; Concurrency; Program Verification; State Transition Systems; Refinement; Theorem Proving; PVS. Abstract. We
- Cited by 6 (0 self) – Add To MetaCart
-
Refinement Maps for Efficient Verification of Processor Models
- based on WEB-refinement were carried out using the ACL2 theorem proving system [6, 7]. The advantage
- Cited by 10 (5 self) – Add To MetaCart

