Sciweavers

13383 search results - page 312 / 2677
» Abstractions from proofs
Sort
View
BIRTHDAY
2007
Springer
15 years 10 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
AMAST
2006
Springer
15 years 10 months ago
State Space Representation for Verification of Open Systems
Abstract. When designing an open system, there might be no implementation available for certain components at verification time. For such systems, verification has to be based on a...
Irem Aktug, Dilian Gurov
FMCAD
2004
Springer
15 years 10 months ago
A Simple Method for Parameterized Verification of Cache Coherence Protocols
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
Ching-Tsun Chou, Phanindra K. Mannava, Seungjoon P...
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
15 years 10 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
COMMA
2006
15 years 8 months ago
The Carneades Argumentation Framework - Using Presumptions and Exceptions to Model Critical Questions
Abstract. In 2005, Gordon and Walton presented initial ideas for a computational model of defeasible argument [12, 26], which builds on and elaborates Walton's theory of argum...
Thomas F. Gordon, Douglas Walton