Sciweavers

191 search results - page 9 / 39
» Second-Order Programs with Preconditions
Sort
View
CAV
2009
Springer
169views Hardware» more  CAV 2009»
14 years 8 months ago
Automatic Verification of Integer Array Programs
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
Filip Konecný, Marius Bozga, Peter Habermeh...
SAS
2004
Springer
14 years 22 days ago
On Logics of Aliasing
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
Marius Bozga, Radu Iosif, Yassine Lakhnech
CAV
2008
Springer
152views Hardware» more  CAV 2008»
13 years 9 months ago
Heap Assumptions on Demand
Termination of a heap-manipulating program generally depends on preconditions that express heap assumptions (i.e., assertions describing reachability, aliasing, separation and shar...
Andreas Podelski, Andrey Rybalchenko, Thomas Wies
ITICSE
2003
ACM
14 years 20 days ago
Studying program correctness by constructing contracts
Because the concept of program correctness is generally taught as an activity independent of the programming process, most introductory computer science (CS) students perceive it ...
Timothy S. Gegg-Harrison, Gary R. Bunce, Rebecca D...
VL
2000
IEEE
136views Visual Languages» more  VL 2000»
13 years 11 months ago
A Data-Flow Visual Approach to Symbolic Computing: Implementing a Production-Rule-Based Programming System through a General-Pur
The main aim of this paper is to investigate how the production-rule-based computational paradigm can be implemented through visual data-flow techniques. We propose a simple yet e...
Mauro Mosconi, Marco Porta