Sciweavers

13383 search results - page 134 / 2677
» Abstractions from proofs
Sort
View
FM
2006
Springer
153views Formal Methods» more  FM 2006»
15 years 9 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
174
Voted
PLDI
2006
ACM
16 years 2 days ago
Termination proofs for systems code
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
Byron Cook, Andreas Podelski, Andrey Rybalchenko
DAGSTUHL
2007
15 years 7 months ago
Anonymity-Proof Voting Rules
A (randomized, anonymous) voting rule maps any multiset of total orders (aka. votes) over a fixed set of alternatives to a probability distribution over these alternatives. A voti...
Vincent Conitzer
CORR
2002
Springer
108views Education» more  CORR 2002»
15 years 6 months ago
Vote Elicitation: Complexity and Strategy-Proofness
Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has receive...
Vincent Conitzer, Tuomas Sandholm
MFCS
2010
Springer
15 years 4 months ago
Proof Systems and Transformation Games
We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
Yoram Bachrach, Michael Zuckerman, Michael Wooldri...