Add to ORKGTransformational construction of correct pointer algorithms. - In: Perspectives of system informatics : 4th International Andrei Ershov Memorial Conference, PSI 2001, Akademgorodok, Novosibirsk, Russia, July 2 - 6, 2001 ; revised papers / Dines Bjørner ... (eds.). - Berlin u.a. : Sprnger, 2001. - S. 116-130. - (Lecture notes in computer science ; 2244
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
We present a pointer analysis algorithm designed for source-to-source transformations. Existing tech...
The term pointer machine has been used ambiguously in Computer Science literature. In this report we...
Transformational construction of correct pointer algorithms. - In: Perspectives of system informatic...
AbstractWe describe an approach to the derivation of correct algorithms on tree-based pointer struct...
The method presented in [13] by Bernhard Möller to derive pointer algorithms has been shown well-ap...
We show that the well-known unfold/fold transformation strategy also is fruitful for the(formal) der...
We show that the well-known unfold/fold transformation strategy also is fruitful for the (formal) de...
The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer alg...
A fair amount has been written on the subject of reasoning about pointer algorithms. There was a pea...
AbstractThis talk gives an overview of various approaches for verifying the correctness of programs ...
This monograph introduces and surveys the most common modern approaches to pointer analysis, with an...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
We present a pointer analysis algorithm designed for source-to-source transformations. Existing tech...
The term pointer machine has been used ambiguously in Computer Science literature. In this report we...
Transformational construction of correct pointer algorithms. - In: Perspectives of system informatic...
AbstractWe describe an approach to the derivation of correct algorithms on tree-based pointer struct...
The method presented in [13] by Bernhard Möller to derive pointer algorithms has been shown well-ap...
We show that the well-known unfold/fold transformation strategy also is fruitful for the(formal) der...
We show that the well-known unfold/fold transformation strategy also is fruitful for the (formal) de...
The method presented in Calculating with pointer structures by Bernhard Möller to derive pointer alg...
A fair amount has been written on the subject of reasoning about pointer algorithms. There was a pea...
AbstractThis talk gives an overview of various approaches for verifying the correctness of programs ...
This monograph introduces and surveys the most common modern approaches to pointer analysis, with an...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
Pointer analysis is a fundamental static program analysis, with a rich literature and wide applicati...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
We present a pointer analysis algorithm designed for source-to-source transformations. Existing tech...
The term pointer machine has been used ambiguously in Computer Science literature. In this report we...