279 search results - page 8 / 56 » Invariant Patterns for Program Reasoning |
NFM
2011
13 years 2 months ago
2011
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
PSSE
2004
Springer
14 years 24 days ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
IVC
2000
13 years 7 months ago
2000
Regular structures, flat and non-flat, are perceived as regular in a wide range of viewing angles and under varying illumination. In this papers, we exploit this simple observatio...
GW
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. We describe a numerical method for scale invariant detection of gesture patterns in continuous 2D motions. The algorithm is fast due to our rejection-based reasoning achi...