N. Klarlund and M. Schwartzbach. Invariants as data types. Unpublished, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Graphs and Decidable Transductions based on Edge.. - Klarlund, Schwartzbach (1994) (16 citations) (Correct)
....auxiliary edges in the logic of the backbone. The key idea is to distinguish between the bounded number of auxiliary edges that are explicitly manipulated by the transduction and the others, which are represented by a universal quantification in the logic. Our other work In an accompanying paper [6], we outline a typing system for data structures and define a programming language. The typing information is expressed in a logic on the underlying recursive data types. The programming language provides assignment, dereference, allocation, deallocation, and limited forms of iterations based on ....
....for data structures and define a programming language. The typing information is expressed in a logic on the underlying recursive data types. The programming language provides assignment, dereference, allocation, deallocation, and limited forms of iterations based on regular walks. We show in [6] that the operational semantics is captured by transductions and that by the results in this paper the resulting Hoare logic on data structures is decidable. In [5] we also used monadic second order logic to reason about data structures as graphs, but we restricted ourselves to trees with ....
[Article contains additional citation context not shown here]
N. Klarlund and M. Schwartzbach. Invariants as data types. Unpublished, 1993.
Graphs and Decidable Transductions based on Edge Constraints - Klarlund, al. (1994) (16 citations) (Correct)
....auxiliary edges in the logic of the backbone. The key idea is to distinguish between the bounded number of auxiliary edges that are explicitly manipulated by the transduction and the others, which are represented by a universal quantification in the logic. Our other work In an accompanying paper [6], we outline a typing system for data structures and define a programming language. The typing information is 3 expressed in a logic on the underlying recursive data types. The programming language provides assignment, dereference, allocation, deallocation, and limited forms of iterations based ....
....for data structures and define a programming language. The typing information is 3 expressed in a logic on the underlying recursive data types. The programming language provides assignment, dereference, allocation, deallocation, and limited forms of iterations based on regular walks. We show in [6] that the operational semantics is captured by transductions and that by the results in this paper the resulting Hoare logic on data structures is decidable. In [5] we also used monadic second order logic to reason about data structures as graphs, but we restricted ourselves to trees with ....
[Article contains additional citation context not shown here]
N. Klarlund and M. Schwartzbach. Invariants as data types. Unpublished, 1993.
Graphs and Decidable Transductions based on Edge Constraints.. - Klarlund, al. (1994) (16 citations) (Correct)
....auxiliary edges in the logic of the backbone. The key idea is to distinguish between the bounded number of auxiliary edges that are explicitly manipulated by the transduction and the others, which are represented by a universal quantification in the logic. Our other work In an accompanying paper [6], we outline a typing system for data structures and define a programming language. The typing information is expressed in a logic on the underlying recursive data types. The programming language provides assignment, dereference, allocation, deallocation, and limited forms of iterations based on ....
....for data structures and define a programming language. The typing information is expressed in a logic on the underlying recursive data types. The programming language provides assignment, dereference, allocation, deallocation, and limited forms of iterations based on regular walks. We show in [6] that the operational semantics is captured by transductions and that by the results in this paper the resulting Hoare logic on data structures is decidable. In [5] we also used monadic second order logic to reason about data structures as graphs, but we restricted ourselves to trees with ....
[Article contains additional citation context not shown here]
N. Klarlund and M. Schwartzbach. Invariants as data types. Unpublished, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC