Sciweavers

923 search results - page 80 / 185
» Proving the value of formal methods
Sort
View
ISOLA
2004
Springer
15 years 11 months ago
On model checking multiple hybrid views
We study consistency, satisfiability, and validity problems for collectively model checking a set of views endowed with labelled transitions, hybrid constraints on states, and ato...
Michael Huth, Altaf Hussain
IPL
2006
118views more  IPL 2006»
15 years 6 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
SIAMCOMP
2011
14 years 9 months ago
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives
The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative versi...
Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisa...
CAV
2005
Springer
122views Hardware» more  CAV 2005»
15 years 11 months ago
Interpolant-Based Transition Relation Approximation
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...
Ranjit Jhala, Kenneth L. McMillan
NAACL
2007
15 years 7 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger