Sciweavers

641 search results - page 27 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
CORR
2008
Springer
70views Education» more  CORR 2008»
15 years 2 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
KBSE
1998
IEEE
15 years 6 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
123
Voted
BIRTHDAY
2007
Springer
15 years 6 months ago
Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms
Abstract. The Operational Transformation (OT) approach is a technique for supporting optimistic replication in collaborative and mobile systems. It allows the users to concurrently...
Abdessamad Imine, Michaël Rusinowitch
103
Voted
AAAI
1997
15 years 3 months ago
Ordered Semantic Hyper Linking
In this paper, we present a novel first order theorem proving strategy - ordered semantic hyper linking. Ordered semantic hyper linking (OSHL) is an instance-based refutational th...
David A. Plaisted, Yunshan Zhu
94
Voted
WDAG
2007
Springer
63views Algorithms» more  WDAG 2007»
15 years 8 months ago
A Formal Analysis of the Deferred Update Technique
The deferred update technique is a widely used approach for building replicated database systems. Its fame stems from the fact that read-only transactions can execute locally to a...
Rodrigo Schmidt, Fernando Pedone