Sciweavers

29 search results - page 3 / 6
» Using First-Order Theorem Provers in the Jahob Data Structur...
Sort
View
CADE
2007
Springer
16 years 4 months ago
System Description: E-KRHyper
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-b...
Björn Pelzer, Christoph Wernhard
FMSD
2002
114views more  FMSD 2002»
15 years 3 months ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa
KBSE
1998
IEEE
15 years 8 months ago
Planning Equational Verification in CCS
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
Raul Monroy, Alan Bundy, Ian Green
149
Voted
ICTAC
2010
Springer
15 years 2 months ago
Formal Modelling of Separation Kernel Components
Abstract. Separation kernels are key components in embedded applications. Their small size and widespread use in high-integrity environments make them good targets for formal model...
Andrius Velykis, Leo Freitas
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 4 months ago
Automatic Verification of Parametric Specifications with Complex Topologies
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifica...
Johannes Faber, Carsten Ihlemann, Swen Jacobs, Vio...