142 search results - page 18 / 29 » Proving Termination by Invariance Relations |
CSFW
1999
IEEE
14 years 3 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
VISUALIZATION
1991
IEEE
14 years 2 months ago
1991
IEEE
We describe a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three dimensional vector field, v, to produce a single, relativel...
SAS
2007
Springer
14 years 5 months ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
FOSSACS
2006
Springer
14 years 2 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
TOG
2008
13 years 10 months ago
2008
Object motion during camera exposure often leads to noticeable blurring artifacts. Proper elimination of this blur is challenging because the blur kernel is unknown, varies over t...