Sciweavers

ICALP
2010
Springer
13 years 8 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
ICALP
2010
Springer
13 years 8 months ago
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
Mikolaj Bojanczyk, Pawel Parys
ICALP
2010
Springer
13 years 8 months ago
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Allan Borodin, Brendan Lucier
ICALP
2010
Springer
13 years 8 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
ICALP
2010
Springer
13 years 8 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...
ATAL
2006
Springer
13 years 8 months ago
On proactivity and maintenance goals
Goals are an important concept in intelligent agent systems, and can take a variety of forms. One such form is maintenance goals, which, unlike achievement goals, define states th...
Simon Duff, James Harland, John Thangarajah
ASPLOS
2006
ACM
13 years 8 months ago
Tradeoffs in fine-grained heap memory protection
Different uses of memory protection schemes have different needs in terms of granularity. For example, heap security can benefit from chunk separation (by using protected "pa...
Jianli Shen, Guru Venkataramani, Milos Prvulovic
APLAS
2005
ACM
13 years 8 months ago
A Parametric Model for the Analysis of Mobile Ambients
In this paper we propose a new parametric abstract finite model of Mobile Ambients able to express several properties on processes. The model can be used for the analysis of these...
Dino Distefano
APLAS
2005
ACM
13 years 8 months ago
Loop Invariants on Demand
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
K. Rustan M. Leino, Francesco Logozzo
IFIP
2010
Springer
13 years 8 months ago
The Network Data Handling War: MySQL vs. NfDump
Abstract. Network monitoring plays a crucial role in any network management environment. Especially nowadays, with network speed and load constantly increasing, more and more data ...
Rick Hofstede, Anna Sperotto, Tiago Fioreze, Aiko ...