Sciweavers

134 search results - page 7 / 27
» Open Problems from CCCG 2006
Sort
View
OSDI
2006
ACM
14 years 7 months ago
From Uncertainty to Belief: Inferring the Specification Within
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...
Ted Kremenek, Paul Twohey, Godmar Back, Andrew Y. ...
FM
2006
Springer
127views Formal Methods» more  FM 2006»
13 years 11 months ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
13 years 11 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi
EUROCRYPT
2006
Springer
13 years 11 months ago
Oblivious Transfer Is Symmetric
We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious tran...
Stefan Wolf, Jürg Wullschleger
IJCGA
2002
73views more  IJCGA 2002»
13 years 7 months ago
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
Alexander Wolff, Michael Thon, Yin-Feng Xu