Sciweavers

15777 search results - page 2548 / 3156
» Software Engineering
Sort
View
FSTTCS
2007
Springer
16 years 1 months ago
Undirected Graphs of Entanglement 2
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
FSTTCS
2007
Springer
16 years 1 months ago
Triangulations of Line Segment Sets in the Plane
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
Mathieu Brévilliers, Nicolas Chevallier, Do...
FSTTCS
2007
Springer
16 years 1 months ago
Safely Composing Security Protocols
Security protocols are small programs that are executed in hostile environments. Many results and tools have been developed to formally analyze the security of a protocol. However ...
Véronique Cortier, Jérémie De...
FSTTCS
2007
Springer
16 years 1 months ago
Non-mitotic Sets
We study the question of the existence of non-mitotic sets in NP. We show under various hypotheses that • 1-tt-mitoticity and m-mitoticity differ on NP. • 1-tt-reducibility a...
Christian Glaßer, Alan L. Selman, Stephen D....
FSTTCS
2007
Springer
16 years 1 months ago
A Formal Investigation of
The diff3 algorithm is widely considered the gold standard for merging uncoordinated changes to list-structured data such as text files. Surprisingly, its fundamental properties h...
Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce
« Prev « First page 2548 / 3156 Last » Next »