Sciweavers

219 search results - page 26 / 44
» Formal Verification of the Ricart-Agrawala Algorithm
Sort
View
DAC
2009
ACM
14 years 8 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
DAC
2003
ACM
14 years 8 months ago
Automatic trace analysis for logic of constraints
Verification of system designs continues to be a major challenge today. Simulation remains the primary tool for making sure that implementations perform as they should. We present...
Xi Chen, Harry Hsieh, Felice Balarin, Yosinori Wat...
ASIAN
2009
Springer
334views Algorithms» more  ASIAN 2009»
13 years 8 months ago
A Dolev-Yao Model for Zero Knowledge
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh
DAC
2010
ACM
13 years 10 months ago
Scalable specification mining for verification and diagnosis
Effective system verification requires good specifications. The lack of sufficient specifications can lead to misses of critical bugs, design re-spins, and time-to-market slips. I...
Wenchao Li, Alessandro Forin, Sanjit A. Seshia
FORTE
2010
13 years 8 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri