Sciweavers

3228 search results - page 342 / 646
» Computationally Sound Proofs
Sort
View
FOCS
2006
IEEE
15 years 10 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner
ACL2
2006
ACM
15 years 10 months ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber
DSN
2005
IEEE
15 years 9 months ago
Assured Reconfiguration of Fail-Stop Systems
Hardware dependability improvements have led to a situation in which it is sometimes unnecessary to employ extensive hardware replication to mask hardware faults. Expanding upon o...
Elisabeth A. Strunk, John C. Knight, M. Anthony Ai...
TLCA
2005
Springer
15 years 9 months ago
Avoiding Equivariance in Alpha-Prolog
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
Christian Urban, James Cheney
GC
2004
Springer
15 years 9 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...