Dominator trees and fast verification of proof nets
暂无分享,去创建一个
[1] Dov Harel,et al. A linear algorithm for finding dominators in flow graphs and related problems , 1985, STOC '85.
[2] Patrick Lincoln,et al. Linear logic , 1992, SIGA.
[3] Mikkel Thorup,et al. Dominators in Linear Time , 1999, SIAM J. Comput..
[4] Haim Kaplan,et al. A new, simpler linear-time dominators algorithm , 1998, TOPL.
[5] Michael L. Fredman,et al. Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths , 1994, J. Comput. Syst. Sci..
[6] Robert E. Tarjan,et al. A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.
[7] Vincent Danos,et al. The structure of multiplicatives , 1989, Arch. Math. Log..
[8] Vincent Danos. La Logique Linéaire appliquée à l'étude de divers processus de normalisation (principalement du Lambda-calcul) , 1990 .
[9] Stefano Guerrini,et al. Correctness of multiplicative proof nets is linear , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[10] Harold N. Gabow,et al. Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.
[11] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..
[12] Gianluigi Bellin,et al. On the pi-Calculus and Linear Logic , 1992, Theor. Comput. Sci..
[13] R. Lathe. Phd by thesis , 1988, Nature.