146 search results - page 7 / 30 » Local Reasoning about Programs that Alter Data Structures |
164
click to vote
AFPAC
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
189
click to vote
ICS
2001
Tsinghua U.
15 years 2 months ago
2001
Tsinghua U.
For most parallel and high performance systems, tuning guides provide the users with advices to optimize the execution time of their programs. Execution time may be very sensitive...
TPHOL
2008
IEEE
15 years 4 months ago
2008
IEEE
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
TPHOL
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
108
click to vote
IJCAI
1997
14 years 11 months ago
1997
High-level understanding of data must involve the interplay between substantial prior knowledge with geometric and statistical techniques. Our approach emphasizes the recovery of ...