N. Klarlund and M. Schwartzbach. Graph types. In ACM Symposium on Principles of Programming Languages, New York, NY, January 1993. ACM Press.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....PALE [41] and Roles [32] specify the shape of a local object graph in more detail than ours. TVLA can verify properties such as when the input to the program is a list (or tree) the output is also a list (or tree) PALE can verify all the data structures that can be expressed as graph types [31]. Roles support compositional interprocedural analysis and verify similar properties. In contrast to these systems that take exponential time for veri cation, ownership types provide a lightweight and practical way to constrain aliasing. Our type system is similar to proposals for parametric ....

N. Klarlund and M. I. Schwartzbach. Graph types. In January 1993.

....PALE [41] and Roles [32] specify the shape of a local object graph in more detail than ours. TVLA can verify properties such as when the input to the program is a list (or tree) the output is also a list (or tree) PALE can verify all the data structures that can be expressed as graph types [31]. Roles support compositional interprocedural analysis and verify similar properties. In contrast to these systems that take exponential time for verification, ownership types provide a lightweight and practical way to constrain aliasing. Our type system is similar to proposals for parametric ....

N. Klarlund and M. I. Schwartzbach. Graph types. In January 1993.

....Engine [34] The pointer assertion logic engine (PALE) is another framework for checking data structure invariants in programs can contain pre and post conditions as well as loop invariants. PALE can verify a large class of data structures, namely all those that can be expressed as graph types [25]. Graph types consist of data structures that must be represented by a spanning tree backbone, with possibly additional pointers that do not add extra information. Graph types include data structures like doubly linked lists, trees with parent pointers, and threaded trees. Role Analysis [27] ....

N. Klarlund and M. I. Schwartzbach. Graph types. In January 1993.

....graph families to be described. The first order terms of the logic denote nodes. The second order terms denote sets of nodes. Nodes and edges are related by built in predicates. The M2L G formalism is very well suited for describing properties of some common data structures, see our earlier paper [5]. Some authors consider logics that comprise quantification over edges. For these logics, a fundamental result is that a family of graphs allows a decidable M2L if and only if the family is specified by a hyperedge replacement grammar [2] Such grammars constitute a natural generalization of ....

....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 auxiliary edges that are functionally determined by the backbone in terms of regular walks. 2 Rooted Graphs A graph alphabet consists of a finite set of node labels ....

[Article contains additional citation context not shown here]

N. Klarlund and M. Schwartzbach. Graph types. In Proc. 20th Symp. on Princ. of Prog. Lang., pages 196--205. ACM, 1993.

....Engine [34] The pointer assertion logic engine (PALE) is another framework for checking data structure invariants in programs can contain pre and post conditions as well as loop invariants. PALE can verify a large class of data structures, namely all those that can be expressed as graph types [25]. Graph types consist of data structures that must be represented by a spanning tree backbone, with possibly additional pointers that do not add extra information. Graph types include data structures like doubly linked lists, trees with parent pointers, and threaded trees. Role Analysis [27] ....

N. Klarlund and M. I. Schwartzbach. Graph types. In January 1993.

....Centre of the Danish National Research Foundation. of the logic denote nodes. The second order terms denote sets of nodes. Nodes and edges are related by built in predicates. The M2L G formalism is very well suited for describing properties of some common data structures, see our earlier paper [5]. Some authors consider logics that comprise quantification over edges. For these logics, a fundamental result is that a family of graphs allows a decidable M2L if and only if the family is specified by a hyperedgereplacement grammar [2] Such grammars constitute a natural generalization of ....

....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 auxiliary edges that are functionally determined by the backbone in terms of regular walks. 2 Rooted Graphs A graph alphabet consists of a finite set of node labels ....

[Article contains additional citation context not shown here]

N. Klarlund and M. Schwartzbach. Graph types. In Proc. 20th Symp. on Princ. of Prog. Lang., pages 196--205. ACM, 1993.

....programs. While TVLA is primarily intraprocedural, Role Analysis [19] supports compositional interprocedural analysis and verifies similar properties. The pointer assertion logic engine (PALE) 25] can verify a large class of data structures, namely all those that can be expressed as graph types [18]. Graph types consist of data structures that can be represented by a spanning tree backbone, with possibly additional pointers that do not add extra information. Graph types include data structures like doubly linked lists, trees with parent pointers, and threaded trees. While static analysis of ....

N. Klarlund and M. I. Schwartzbach. Graph types. In Proc. 20th Annual ACM Symposium on the Principles of Programming Languages (POPL), Jan. 1993.

....variable. Path languages define binary relations on nodes of a graph: a pair of nodes is in the relation if you can walk from the first to the second, following the directions in a string from the language. Routing languages, a concept akin to path languages are used by Klarlund and Schwartzbach [KS93] to extend the concept of recursive data structures. They allow the definition of data structures such as circular linked lists in an elegant 1 way, avoiding explicit use of pointers. It will turn out that there are structures that cannot be defined by a routing language, while they can be ....

....y) 2 MSOL 2 ( Sigma; Gamma) with LGR (OE(x; y) L 0 is the set of mso definable graph node relations, denoted mso nr. 40 Regular Graph Node Relations We can define graph node relations with the help of path languages. They are akin to regular 2 paths in [Oos89] routing languages in [KS93], and regular tree embeddings in [Eng89] Definition 3.2. Let Sigma and Gamma be alphabets. A path language over ( Sigma; Gamma) is a string language over a set of directives, a finite subset of D Sigma; Gamma = fl2 Gamma f# fl ; fl g [ MSOL 1 ( Sigma; Gamma) For a path language ....

[Article contains additional citation context not shown here]

Nils Klarlund and Michael L. Schwartzbach. Graph types. In Proceedings of the 20th Conference on Principles of Programming Languages, pages 196--205, 1993.

....T and nodes u; v 2 V t , t; u; v) j= x; y) if and only if A can walk from u to v in t, starting in an initial state and ending in a nal state. We recall the formal de nition of the tree walking automata of [BloEng] The instructions used by tree walking automata are called directives (as in [KlaSch]) Let be an operator alphabet. The (in nite) set of directives over is D = f# i j i 2 rki( g [ f i j i 2 rki( g [ MSOL 1 ( A directive is an instruction of how to move from one node to another: # i means move along an edge labeled i , i.e. move to the i th child of the current ....

N. Klarlund, M. L. Schwartzbach; Graph Types, in Proc. of the 20th Conference on Principles of Programming Languages (POPL), 1993, 196{ 205

....a smooth integration of structuring types in C. The programmer can still express pointer manipulations with the expected constant time execution and benefit from the additional guarantee that the property specified by the structuring type is an invariant of the program. The graph types approach [17] shares the same concern. In their framework, a graph is defined using a canonical spanning tree (called the backbone) and auxiliary pointers. Only the backbone can be manipulated by programs and some simple operations may implicitly involve non constant updates of the auxiliary pointers. In ....

N. Klarlund and M. Schwartzbach. Graph types. In Proc.ofPrinciplesof Programming Languages (ACM Press, Jan. 1993) 196--205.

No context found.

N. Klarlund and M. Schwartzbach. Graph types. In ACM Symposium on Principles of Programming Languages, New York, NY, January 1993. ACM Press.

No context found.

N. Klarlund and M. I. Schwartzbach. Graph types. In Proc. 20th ACM POPL, Charleston, SC, 1993.

No context found.

N. Klarlund and M. I. Schwartzbach. Graph types. In Symp. on Principles of Programming Languages (POPL), pages 196--205, 1993.

No context found.

N. Klarlund and M. I. Schwartzbach. Graph types. In Proc. 20th ACM POPL, Charleston, SC, 1993.

No context found.

N. Klarlund and M. I. Schwartzbach. Graph types. In Proc. 20th ACM POPL, Charleston, SC, 1993.

No context found.

Nils Klarlund and Michael Schwartzbach. Graph types. In Twentieth ACM Symposium on Principles of Programming Languages, pages 196--205, Charleston, January 1993.

No context found.

N. Klarlund and M. I. Schwartzbach. Graph types. In Principles of Programming Languages, pp. 196--205. ACM Press, Jan. 1993.

No context found.

N. Klarlund and M. I. Schwartzbach. Graph types. In Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 196--205. ACM, ACM Press, Jan. 1993. 28

No context found.

Nils Klarlund and Michael Schwartzbach. Graph types. In Twentieth ACM Symposium on Principles of Programming Languages, pages 196--205, Charleston, January 1993.

No context found.

N. Klarlund and M. I. Schwartzbach. Graph types. In Proc. 20th ACM POPL, Charleston, SC, 1993.

No context found.

N. Klarlund and M. I. Schwartzbach. Graph types. In Proc. 20th ACM POPL, Charleston, SC, 1993.

No context found.

N. KLARLUND AND M. I. SCHWARTZBACH, Graph types, in Proc. 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '93, January 1993.

No context found.

N. Klarlund and M. I. Schwartzbach. Graph types. In 1993.

No context found.

N. Klarlund and M. Schwartzbach, Graph types, in 20 th Annual ACM Symp. on Principles of Programming Languages POPL'93, Jan. 93, pp. 196-205.

No context found.

N. Klarlund and M. Schwartzbach. Graph types. In Proc. 20th Symp. on Princ. of Prog. Lang., pp. 196-205. ACM, 1993.

First 50 documents

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