Sciweavers

426 search results - page 79 / 86
» Specification, Abduction, and Proof
Sort
View
POPL
2001
ACM
14 years 10 months ago
Mobile values, new names, and secure communication
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
Cédric Fournet, Martín Abadi
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ICALP
2009
Springer
14 years 10 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
SIGMOD
2005
ACM
127views Database» more  SIGMOD 2005»
14 years 10 months ago
Fossilized Index: The Linchpin of Trustworthy Non-Alterable Electronic Records
As critical records are increasingly stored in electronic form, which tends to make for easy destruction and clandestine modification, it is imperative that they be properly manag...
Qingbo Zhu, Windsor W. Hsu
VMCAI
2010
Springer
14 years 7 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...