5084 search results - page 47 / 1017 » Proving Possibility Properties |
152
click to vote
CAV
2005
Springer
15 years 10 months ago
2005
Springer
Automaton-based static program analysis has proved to be an effective tool for bug finding. Current tools generally re-analyze a program from scratch in response to a change in t...
126
Voted
ESA
2004
Springer
15 years 10 months ago
2004
Springer
This paper considers the convergence problem in autonomous mobile robot systems. A natural algorithm for the problem requires the robots to move towards their center of gravity. Th...
132
Voted
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
151
click to vote
CCS
2008
ACM
15 years 7 months ago
2008
ACM
Proving that particular methods within a code base are functionally pure--deterministic and side-effect free--would aid verification of security properties including function inve...
141
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...