5084 search results - page 23 / 1017 » Proving Possibility Properties |
IPPS
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
ATVA
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
QSIC
2005
IEEE
14 years 3 months ago
2005
IEEE
Many programs need to access data in a relational database. This is usually done by means of queries written in SQL. Although the language SQL is declarative, certain runtime erro...
FMOODS
2003
13 years 11 months ago
2003
A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several ca...
WDAG
2005
Springer
14 years 3 months ago
2005
Springer
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...