Search results for "reachability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
101	Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy	Planar and Grid Graph Reachability Problems.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs
76	Kamil Saraç, Kevin C. Almeroth	Monitoring Reachability in the Global Multicast Infrastructure.	ICNP	2000	DBLP DOI BibTeX RDF	global multicast infrastructure, Multicast Backbone, flat virtual topology, routing information, reachability monitoring, sdr-monitor, session directory information, long term reachability characteristics, protocol bugs, IP multicast infrastructure, multicast traffic management, Internet, transport protocols, network topology, network topology, autonomous systems, reachability analysis, telecommunication network routing, multicast communication, telecommunication traffic, computer network management, hierarchical routing, ISP, MBone, computerised monitoring, Internet service providers, application layer, management tools
63	Hong Liu 0004, Raymond E. Miller	Reachability Problems for Cyclic Protocols.	ICCCN	1995	DBLP DOI BibTeX RDF	Fair Reachability Analysis, Verification, Communication Protocols, Reachability Analysis, State Explosion
62	Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang	Efficiently answering reachability queries on very large directed graphs.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	maximal directed spanning tree, path-tree cover, transitive closure, graph indexing, reachability queries
58	Paul Bell, Igor Potapov	Lowering Undecidability Bounds for Decision Questions in Matrices.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF	vector reachability, matrix semigroups, piecewise linear maps, membership, Theory of computing
56	D. K. Lee, Sue B. Moon, Taesang Choi, Taesoo Jeong	Forensic analysis of autonomous system reachability.	MineNet	2006	DBLP DOI BibTeX RDF	AS reachability, address count, prefix count, security incidents, BGP
56	Suk Jai Seo, Peter J. Slater	An introduction to competition-reachability of a graph.	ACM Southeast Regional Conference (1)	2005	DBLP DOI BibTeX RDF	competition parameters, orientations, reachability
56	John Kodumal, Alexander Aiken	The set constraint/CFL reachability connection in practice.	PLDI	2004	DBLP DOI BibTeX RDF	flow analysis, type qualifiers, set constraints, context-free language reachability
56	Sridhar Iyer, S. Ramesh 0001	Apportioning: A Technique for Efficient Reachability Analysis of Concurrent Object-Oriented Programs.	IEEE Trans. Software Eng.	2001	DBLP DOI BibTeX RDF	object-oriented programming, static analysis, Concurrent programs, reachability analysis
56	Wuxu Peng	Deadlock Detection in Communicating Finite State Machines by Even Reachability Analysis.	ICCCN	1995	DBLP DOI BibTeX RDF	Communication protocols, reachability analysis, specification and verification
56	Markus Lindquist	Parameterized Reachability Trees for Predicate/Transition Nets.	Applications and Theory of Petri Nets	1991	DBLP DOI BibTeX RDF	Petri nets, reachability analysis, Predicate/Transition nets, high level nets
56	Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu Yu, Wee Keong Ng	A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs.	DASFAA	2009	DBLP DOI BibTeX RDF
56	Haixun Wang, Hao He 0006, Jun Yang 0001, Philip S. Yu, Jeffrey Xu Yu	Dual Labeling: Answering Graph Reachability Queries in Constant Time.	ICDE	2006	DBLP DOI BibTeX RDF
56	Jorge Júlvez, Laura Recalde, Manuel Silva Suárez	On Reachability in Autonomous Continuous Petri Net Systems.	ICATPN	2003	DBLP DOI BibTeX RDF
56	Keiko Takahashi, Isao Ono, Hiroshi Satoh, Shigenobu Kobayashi	An Efficient Genetic Algorithm for Reachability Problems.	HICSS (5)	1997	DBLP DOI BibTeX RDF
53	Yoshiharu Kojima, Masahiko Sakai	Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems.	RTA	2008	DBLP DOI BibTeX RDF
50	Shing-Chi Cheung, Jeff Kramer	Checking Subsystem Safety Properties in Compositional Reachability Analysis.	ICSE	1996	DBLP BibTeX RDF	automated method, compositional reachability analysis, evolutionary change, gas station system, globally observable actions, hierarchical subsystem composition, safety property violation, subsystem safety property checking, undefined state, software engineering, software architecture, software developers, distributed processing, program analysis, finite state machines, finite-state machines, safety, distributed program, reachability analysis, program diagnostics, interacting processes
50	Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry	3-HOP: a high-compression indexing scheme for reachability query.	SIGMOD Conference	2009	DBLP DOI BibTeX RDF	2-hop, 3-hop, path-tree, transitive closure, graph indexing, reachability queries
50	Gerardo Schneider	Reachability analysis of generalized polygonal hybrid systems.	SAC	2008	DBLP DOI BibTeX RDF	GSPDI, verification, hybrid systems, decidability, reachability
50	Yu Lei 0001, Richard H. Carver	Reachability Testing of Concurrent Programs.	IEEE Trans. Software Eng.	2006	DBLP DOI BibTeX RDF	Software testing, concurrent programming, reachability testing
50	Alexander E. Kostin	A Reachability Algorithm for General Petri Nets Based on Transition Invariants.	MFCS	2006	DBLP DOI BibTeX RDF	transition invariants, Petri nets, reachability
50	Peter Buchholz 0001, Peter Kemper	Efficient Computation and Representation of Large Reachability Sets for Composed Automata.	Discret. Event Dyn. Syst.	2002	DBLP DOI BibTeX RDF	automata networks, Kronecker representation, ordered natural decision diagrams, reachability analysis, equivalence
50	Shing-Chi Cheung, Jeff Kramer	Context Constraints for Compositional Reachability Analysis.	ACM Trans. Softw. Eng. Methodol.	1996	DBLP DOI BibTeX RDF	compositional techniques, context constraints, distributed systems, concurrency, static analysis, validation, reachability analysis, labeled transition systems, state space reduction
50	Masato Notomi, Tadao Murata	Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	hierarchical reachability graph, bounded Petri nets, concurrent-software analysis, communication protocol software, hierarchically organized state space, deadlock state, successor states, software engineering, Petri nets, efficiency, tractability, markings, state explosion, multiprocessing programs, hierarchical systems, state-space methods, Ada programs
49	Thomas D. LaToza, Brad A. Myers	Developers ask reachability questions.	ICSE (1)	2010	DBLP DOI BibTeX RDF	code navigation, developer questions, empirical study, software maintenance, program comprehension
49	C.-H. Luke Ong, Nikos Tzevelekos	Functional Reachability.	LICS	2009	DBLP DOI BibTeX RDF
49	Irith Pomeranz, Sudhakar M. Reddy	Functional Broadside Tests with Different Levels of Reachability.	VLSI Design	2007	DBLP DOI BibTeX RDF
49	Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Zhang 0001, Albert G. Greenberg, Gísli Hjálmtýsson, Jennifer Rexford	On static reachability analysis of IP networks.	INFOCOM	2005	DBLP DOI BibTeX RDF
49	Mustapha Bourahla, Mohamed Benmohamed	Efficient partition of state space for parallel reachability analysis.	AICCSA	2005	DBLP DOI BibTeX RDF
49	Richard H. Carver, Yu Lei 0001	A General Model for Reachability Testing of Concurrent Programs.	ICFEM	2004	DBLP DOI BibTeX RDF
49	Nabil Hameurlain, Christophe Sibertin-Blanc	Finite Symbolic Reachability Graphs for High-Level Petri Nets.	APSEC	1997	DBLP DOI BibTeX RDF
47	Dina Thomas, Supratik Chakraborty, Paritosh K. Pandya	Efficient guided symbolic reachability using reachability expressions.	Int. J. Softw. Tools Technol. Transf.	2008	DBLP DOI BibTeX RDF
47	Dina Thomas, Supratik Chakraborty, Paritosh K. Pandya	Efficient Guided Symbolic Reachability Using Reachability Expressions.	TACAS	2006	DBLP DOI BibTeX RDF
45	Zhuowei Bao, Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy	An optimal labeling scheme for workflow provenance using skeleton labels.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	workflow, provenance, labeling, reachability
45	Pramod V. Koppol, Richard H. Carver, Kuo-Chung Tai	Incremental Integration Testing of Concurrent Programs.	IEEE Trans. Software Eng.	2002	DBLP DOI BibTeX RDF	incremental testing, Software testing, concurrent programs, structural testing
45	Francesco Calzolari, Mauro Pezzè	A non-temporized approach for temporized analysis.	ECRTS	1998	DBLP DOI BibTeX RDF
45	Eduardo Pelegrí-Llopart, Susan L. Graham	Optimal Code Generation for Expression Trees: An Application of BURS Theory.	POPL	1988	DBLP DOI BibTeX RDF
44	B. Antal, György Csertán, István Majzik, Andrea Bondavalli, Luca Simoncini	Reachability and Timing Analysis in Data Flow Networks: A Case Study.	EUROMICRO	1996	DBLP DOI BibTeX RDF	data flow networks, computer control systems, performance, safety, timing analysis, reachability analysis, reachability analysis
43	Randy Bush, Olaf Maennel, Matthew Roughan, Steve Uhlig	Internet optometry: assessing the broken glasses in internet reachability.	Internet Measurement Conference	2009	DBLP DOI BibTeX RDF	data-plane, default-routing, limitation of data, routing, reachability, control-plane
43	Young Dae Kim, Chan Kyou Hwang, Jae-Hyoung Yoo	On-Line Network Reachability Analysis Using Forward Information Base Emulation.	ACIS-ICIS	2008	DBLP DOI BibTeX RDF	Network Reachability, BGP, OSPF, ISIS, IGP
43	Manuela-Luminita Bujorianu, John Lygeros, Rom Langerak	Reachability Analysis of Stochastic Hybrid Systems by Optimal Control.	HSCC	2008	DBLP DOI BibTeX RDF	Stochastic hybrid systems, reachability problem, Markov processes, optimal stopping
43	Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin	On the optimal reachability problem of weighted timed automata.	Formal Methods Syst. Des.	2007	DBLP DOI BibTeX RDF	Weighted timed automaton, Cost-optimal reachability problem
43	Hao He 0006, Haixun Wang, Jun Yang 0001, Philip S. Yu	Compact reachability labeling for graph-structured data.	CIKM	2005	DBLP DOI BibTeX RDF	graph reachability labeling
43	Tatiana Rybina, Andrei Voronkov	A Logical Reconstruction of Reachability.	Ershov Memorial Conference	2003	DBLP DOI BibTeX RDF	reachability analysis, infinite-state systems, model theory, theoretical foundations
43	Manuela-Luminita Bujorianu, John Lygeros	Reachability Questions in Piecewise Deterministic Markov Processes.	HSCC	2003	DBLP DOI BibTeX RDF	Markov processes, Hybrid systems, reachability, hitting times
43	Bengi Karaçali, Kuo-Chung Tai, Mladen A. Vouk	Deadlock Detection of EFSMs Using Simultaneous Reachability Analysis.	DSN	2000	DBLP DOI BibTeX RDF	Simultaneous Reachability Analysis, Extended Finite State Machine Model, Race Conditions, Deadlock Detection
43	Yih-Farn Chen, Emden R. Gansner, Eleftherios Koutsofios	AC++ Data Model Supporting Reachability Analysis and Dead Code Detection.	IEEE Trans. Software Eng.	1998	DBLP DOI BibTeX RDF	dead code detection, program database, reverse engineering, C++, static analysis, conceptual modeling, reachability analysis, software repository
43	Sridhar Iyer, S. Ramesh 0001	A Tool-Suite for Reachability Analysis of Concurrent Object-Oriented Programs.	APSEC	1997	DBLP DOI BibTeX RDF	Concurrent and distributed systems, software analysis and design, object-oriented programming, reachability analysis
43	Zhiyuan Ying, S. Sitharama Iyengar	Robot reachability problem: A nonlinear optimization approach.	J. Intell. Robotic Syst.	1995	DBLP DOI BibTeX RDF	Tunneling algorithm, robot manipulator, reachability test
43	Serge Haddad, Jean-Michel Ilié, Mohamed Taghelit, Belhassen Zouari	Symbolic Reachability Graph and Partial Symmetries.	Application and Theory of Petri Nets	1995	DBLP DOI BibTeX RDF	Well-Formed Petri nets, Partial Symmetries, Symbolic Reachability graphs
43	Ryszard Janicki, Maciej Koutny	Optimal simulations, nets and reachability graphs.	Applications and Theory of Petri Nets	1990	DBLP DOI BibTeX RDF	verification, Petri nets, traces, liveness, partial order semantics, reachability graphs, step sequences, state-space generation, deadlock-freeness
43	Jérôme Leroux	The General Vector Addition System Reachability Problem by Presburger Inductive Invariants.	LICS	2009	DBLP DOI BibTeX RDF
43	Vineet Kahlon	Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks.	LICS	2009	DBLP DOI BibTeX RDF
43	Yangjun Chen	General spanning trees and reachability query evaluation.	C3S2E	2009	DBLP DOI BibTeX RDF
43	Matthias Werner 0001, Gero Mühl	Non-reachability in Petri Nets with Delaying Places.	MASCOTS	2006	DBLP DOI BibTeX RDF
43	Joost-Pieter Katoen, Ivan S. Zapreev	Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability.	QEST	2006	DBLP DOI BibTeX RDF
43	Jiefeng Cheng, Jeffrey Xu Yu, Nan Tang 0001	Fast Reachability Query Processing.	DASFAA	2006	DBLP DOI BibTeX RDF
43	Nadia Busi, Gianluigi Zavattaro	Reachability Analysis in Boxed Ambients.	ICTCS	2005	DBLP DOI BibTeX RDF
43	Ahmed Bouajjani, Tayssir Touili	On Computing Reachability Sets of Process Rewrite Systems.	RTA	2005	DBLP DOI BibTeX RDF
43	Derek Rayside, Kostas Kontogiannis	A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis.	CSMR	2002	DBLP DOI BibTeX RDF
43	Yu Lei 0001, Kuo-Chung Tai	Blocking-based Simultaneous Reachability Analysis of Asynchronous Message-passing Programs.	ISSRE	2002	DBLP DOI BibTeX RDF
43	Youpyo Hong, Peter A. Beerel	Symbolic Reachability Analysis of Large Finite State Machines Using Don't Cares.	DATE	1999	DBLP DOI BibTeX RDF
43	David Melski, Thomas W. Reps	Interconveritibility of Set Constraints and Context-Free Language Reachability.	PEPM	1997	DBLP DOI BibTeX RDF
43	Dong-Ik Lee, Sadatoshi Kumagai, Shinzo Kodama	Handles and Reachability Analysis of Free Choice Nets.	Application and Theory of Petri Nets	1995	DBLP DOI BibTeX RDF
43	Cosimo Anglano, Luigi Portinale	B-W Analysis: A Backward Reachability Analysis for Diagnostic Problem Solving Suitable to Parallel Implementation.	Application and Theory of Petri Nets	1994	DBLP DOI BibTeX RDF
40	Salvatore La Torre, P. Madhusudan, Gennaro Parlato	Reducing Context-Bounded Concurrent Reachability to Sequential Reachability.	CAV	2009	DBLP DOI BibTeX RDF
40	Giuliana Franceschinis, Richard R. Muntz	Computing Bounds for the Performance Indices of Quasi-Lumpable Stochastic Well-Formed Nets.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	quasilumpable stochastic well-formed Nets, stochastic well-formed colored Petri nets, aggregated reachability graph, qualitative properties, quasilumpable SWN models, approximated performance indices, SWN models, bounded aggregation method, performance evaluation, Petri nets, Markov processes, stochastic processes, continuous time Markov chain, performance indices, symbolic reachability graph
39	Béatrice Bérard, Serge Haddad	Interrupt Timed Automata.	FoSSaCS	2009	DBLP DOI BibTeX RDF	decidability of reachability, timed automata, interruptions, Hybrid automata, multi-task systems
39	Guy Edward Gallasch, Jonathan Billington	A Parametric State Space for the Analysis of the Infinite Class of Stop-and-Wait Protocols.	SPIN	2006	DBLP DOI BibTeX RDF	Stop and Wait Protocols, Infinite Families of Systems, Parametric Reachability Graphs, Coloured Petri Nets
39	Guy Edward Gallasch, Jonathan Billington	Using Parametric Automata for the Verification of the Stop-and-Wait Class of Protocols.	ATVA	2005	DBLP DOI BibTeX RDF	Stop and Wait Protocols, Symbolic Automata, Language Equivalence, Coloured Petri Nets, Parametric Verification, Symbolic Reachability Graphs
39	Jörg Sander 0001, Xuejie Qin, Zhiyong Lu, Nan Niu, Alex Kovarsky	Automatic Extraction of Clusters from Hierarchical Clustering Representations.	PAKDD	2003	DBLP DOI BibTeX RDF	Single-Link method, reachability-plot, Hierarchical clustering, OPTICS, dendrogram
39	Guillaume Gardey, Olivier H. Roux, Olivier F. Roux	Using Zone Graph Method for Computing the State Space of a Time Petri Net.	FORMATS	2003	DBLP DOI BibTeX RDF	Verification, Reachability Analysis, Time Petri Nets, State Space, Zone
39	Luc C. G. J. M. Habets, Jan H. van Schuppen	Control of Piecewise-Linear Hybrid Systems on Simplices and Rectangles.	HSCC	2001	DBLP DOI BibTeX RDF	Piecewise-linear hybrid systems, polyhedral set, multi-dimensional rectangle, reachability, facet, simplex, control law
39	Matthew B. Dwyer, Lori A. Clarke	A Compact Petri Net Representation and Its Implications for Analysis.	IEEE Trans. Software Eng.	1996	DBLP DOI BibTeX RDF	coarsened representations, Petri nets, reachability analysis, program representations, Software validation
39	Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi	On the verification problem for weak memory models.	POPL	2010	DBLP DOI BibTeX RDF	lossy channel systems, program verification, infinite state systems, relaxed memory models
37	Hallstein Asheim Hansen, Gerardo Schneider	Reachability analysis of GSPDIs: theory, optimization, and implementation.	SAC	2010	DBLP DOI BibTeX RDF	differential inclusions, verification of hybrid systems, hybrid systems, reachability
37	Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yang Xiang	Computing label-constraint reachability in graph databases.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	generalized transitive closure, hoeffding and bernstein bounds, label-constraint reachability, maximal directed spanning tree
37	Michael Huth 0001, Orna Grumberg	Special section on advances in reachability analysis and decision procedures: contributions to abstraction-based system verification.	Int. J. Softw. Tools Technol. Transf.	2009	DBLP DOI BibTeX RDF	Bounded reachability, Bit-vector arithmetic, Abstraction, Asynchronous systems, Decision diagrams, Memory models, Decision problems
37	Panagiotis Bouros, Spiros Skiadopoulos, Theodore Dalamagas 0001, Dimitris Sacharidis, Timos K. Sellis	Evaluating Reachability Queries over Path Collections.	SSDBM	2009	DBLP DOI BibTeX RDF	path collections, reachability queries
37	Yaping Zhu, Jennifer Rexford, Subhabrata Sen, Aman Shaikh	Impact of prefix-match changes on IP reachability.	Internet Measurement Conference	2009	DBLP DOI BibTeX RDF	ip reachability, longest-matching prefix, bgp
37	Andrzej S. Murawski	Reachability Games and Game Semantics: Comparing Nondeterministic Programs.	LICS	2008	DBLP DOI BibTeX RDF	Idealized Algol, pushdown graphs, reachability games, nondeterminism, game semantics
37	Jean-Raymond Abrial, Dominique Cansell, Dominique Méry	Refinement and Reachability in EventB.	ZB	2005	DBLP DOI BibTeX RDF	Refinement, Reachability, B Method, Stuttering
37	Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer, David L. Dill, E. Allen Emerson	Multi-threaded reachability.	DAC	2005	DBLP DOI BibTeX RDF	parallel, multi-threaded, reachability analysis
37	Parthasarathy Ramachandran, Manjunath Kamath	A Sufficient Condition for Reachability in a General Petri Net.	Discret. Event Dyn. Syst.	2004	DBLP DOI BibTeX RDF	acyclic transformations, net expansion, transition firing sequence, Petri nets, reachability analysis, unfolding
37	Manuela-Luminita Bujorianu	Extended Stochastic Hybrid Systems and Their Reachability Problem.	HSCC	2004	DBLP DOI BibTeX RDF	stochastic hybrid systems, reachability problem, extended automata, Dirichlet forms, Markov processes
37	Karsten Schmidt 0004	Integrating Low Level Symmetries into Reachability Analysis.	TACAS	2000	DBLP DOI BibTeX RDF	symmetries, reachability analysis, automorphisms
36	Sumit Gulwani, Florian Zuleger	The reachability-bound problem.	PLDI	2010	DBLP DOI BibTeX RDF	disjunctive invariants, resource bound analysis, pattern matching, transitive closure, ranking functions
36	Andrey Rybalchenko, Rishabh Singh	Subsumer-First: Steering Symbolic Reachability Analysis.	SPIN	2009	DBLP DOI BibTeX RDF
36	Hao Yuan, Patrick Th. Eugster	An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees.	ESOP	2009	DBLP DOI BibTeX RDF
36	Martin Fränzle, Mani Swaminathan	Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata.	FORMATS	2009	DBLP DOI BibTeX RDF
36	Fangli Pu, Hai-Yin Xu	A Feasible Strategy for Reachability Testing of Internet-Based Concurrent Programs.	ICNSC	2008	DBLP DOI BibTeX RDF
36	Gordon Fraser 0001, Paul Ammann	Reachability and Propagation for LTL Requirements Testing.	QSIC	2008	DBLP DOI BibTeX RDF	requirements testing, software testing, automated testing, test case generation, property testing
36	Leevar Williams, Richard Lippmann, Kyle Ingols	An Interactive Attack Graph Cascade and Reachability Display.	VizSEC	2007	DBLP DOI BibTeX RDF
36	Marcin Jurdzinski, Ashutosh Trivedi 0001	Reachability-Time Games on Timed Automata.	ICALP	2007	DBLP DOI BibTeX RDF
36	Aabhas V. Paliwal, Nabil R. Adam, Basit Shafiq, Christof Bornhövd	Policy based Web Service Orchestration and Goal Reachability Analysis using MSC and CP Nets.	CEC/EEE	2007	DBLP DOI BibTeX RDF
36	Xenofon D. Koutsoukos, Derek Riley	Computational Methods for Reachability Analysis of Stochastic Hybrid Systems.	HSCC	2006	DBLP DOI BibTeX RDF
36	Yongsun Choi, Xinlei Zhao, Kwanhee Han	Hierarchical Reachability Analysis for Workflow-Nets.	CSCWD	2006	DBLP DOI BibTeX RDF
36	Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy	Grid Graph Reachability Problems.	CCC	2006	DBLP DOI BibTeX RDF
36	Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin 0001, Haixun Wang, Philip S. Yu	Fast Computation of Reachability Labeling for Large Graphs.	EDBT	2006	DBLP DOI BibTeX RDF
36	Yu Lei 0001, Richard H. Carver	A New Algorithm for Reachability Testing of Concurrent Programs.	ISSRE	2005	DBLP DOI BibTeX RDF