Sciweavers

5084 search results - page 317 / 1017
» Proving Possibility Properties
Sort
View
267
Voted
PODC
2009
ACM
16 years 8 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
206
Voted
FOCS
2009
IEEE
16 years 2 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
186
Voted
EUROCRYPT
2003
Springer
16 years 20 days ago
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications
ded abstract of this paper appears in Advances in Cryptology – EUROCRYPT ’03, Lecture Notes in Computer Science Vol. 2656, E. Biham ed., Springer-Verlag, 2003. This is the full...
Mihir Bellare, Tadayoshi Kohno
226
Voted
LICS
1991
IEEE
15 years 11 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
KBSE
2005
IEEE
16 years 1 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander