1129 search results - page 144 / 226 » Formal Verification of Websites |
100
click to vote
DGO
2008
15 years 3 months ago
2008
In this paper we outline an approach for modeling election processes and then performing rigorous analysis to verify that these process models meet selected behavioral requirement...
160
click to vote
ASIAN
2009
Springer
15 years 3 months ago
2009
Springer
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...
100
click to vote
CCR
2000
15 years 1 months ago
2000
Non-repudiation protocols aim at preventing parties in a communication from falsely denying having taken part in that communication; for example, a non-repudiation protocol for di...
145
click to vote
SIGSOFT
2010
ACM
14 years 12 months ago
2010
ACM
For `mixed-criticality' systems that have both critical and non-critical functions, the greatest leverage on dependability may be at the design level. By designing so that ea...
114
click to vote
DAC
2009
ACM
16 years 3 months ago
2009
ACM
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...