论文信息 - GLB-Closures in Directed Acyclic Graphs and Their Applications

GLB-Closures in Directed Acyclic Graphs and Their Applications

A subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the greatest lower bounds of all pairs of vertices of S. The glb-closure of S is the smallest glb-closed subset containing S. An efficient output sensitive algorithm for computing glb-closures is presented and two applications in the field of object-oriented programming languages are discussed.

Volker Turau | Weimin Chen

[1] Jean-Claude Royer,et al. Optimizing method search with lookup caches and incremental coloring , 1992, OOPSLA '92.

[2] Alexander Borgida,et al. Efficient management of transitive relationships in large data and knowledge bases , 1989, SIGMOD '89.

[3] Jean-Claude Royer,et al. Optimizing method search with lookup caches and incremental coloring , 1992, OOPSLA '92.

[4] Daniel G. Bobrow,et al. CommonLoops: merging Lisp and object-oriented programming , 1986, OOPLSA '86.

[5] Wolfgang Klas,et al. Efficient Dynamic Look-Up Strategy for Multi-Methods , 1994, ECOOP.

[6] Patrick Lincoln,et al. Efficient implementation of lattice operations , 1989, TOPL.

[7] Marie-Laure Mugnier,et al. Monotonic conflict resolution mechanisms for inheritance , 1992, OOPSLA 1992.

[8] Karel Driesen. Selector table indexing & sparse arrays , 1993, OOPSLA '93.

[9] Marie-Laure Mugnier,et al. Monotonic conflict resolution mechanisms for inheritance , 1992, OOPSLA.

[10] Daniel G. Bobrow,et al. Common lisp object system specification , 1988, SIGP.

[11] Bruce G. Lindsay,et al. Static type checking of multi-methods , 1991, OOPSLA '91.