5255 search results - page 776 / 1051 » Formal Methods for Privacy |
143
click to vote
CAV
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
143
click to vote
CAV
2007
Springer
16 years 24 days ago
2007
Springer
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
134
click to vote
CAV
2007
Springer
16 years 24 days ago
2007
Springer
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototy...
163
click to vote
CAV
2007
Springer
16 years 24 days ago
2007
Springer
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
193
click to vote
CAV
2007
Springer
16 years 24 days ago
2007
Springer
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...