Sciweavers

798 search results - page 126 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
ANCS
2005
ACM
14 years 1 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
IGPL
2008
124views more  IGPL 2008»
13 years 7 months ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli
CRYPTO
2000
Springer
128views Cryptology» more  CRYPTO 2000»
13 years 12 months ago
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
We investigate the all-or-nothing encryption paradigm which was introduced by Rivest as a new mode of operation for block ciphers. The paradigm involves composing an all-or-nothing...
Anand Desai
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
13 years 9 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
HASE
2008
IEEE
14 years 2 months ago
Localizing Program Errors via Slicing and Reasoning
Model-based program debugging exploits discrepancies between the program behavior anticipated by a programmer and the program’s actual behavior when executed on a set of inputs....
Fei Pu, Yan Zhang