Sciweavers

1140 search results - page 12 / 228
» Progress on Certifying Algorithms
Sort
View
PPOPP
2012
ACM
14 years 16 days ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
115
Voted
TPHOL
2003
IEEE
15 years 10 months ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
CIKM
2009
Springer
15 years 11 months ago
Progressive skyline query evaluation and maintenance in wireless sensor networks
Skyline query has been received much attention due to its wide application backgrounds for multi-preference and decision making. In this paper we consider skyline query evaluation...
Baichen Chen, Weifa Liang, Jeffrey Xu Yu
WG
2007
Springer
15 years 11 months ago
Proper Helly Circular-Arc Graphs
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz S...
SPIN
2009
Springer
15 years 11 months ago
Improving Non-Progress Cycle Checks
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
David Faragó, Peter H. Schmitt