|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1988 occurrences of 963 keywords
|
|
|
|
|
Results
Found 2380 publication records. Showing 2380 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 5 | Kamil Saraç, Kevin C. Almeroth |
Monitoring Reachability in the Global Multicast Infrastructure. (PDF / PS)  |
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 |
| 4 | 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 |
| 4 | 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 |
| 4 | Hong Liu, Raymond E. Miller |
Reachability Problems for Cyclic Protocols.  |
ICCCN  |
1995 |
DBLP DOI BibTeX RDF |
Fair Reachability Analysis, Verification, Communication Protocols, Reachability Analysis, State Explosion |
| 3 | 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 |
| 3 | 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 |
| 3 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, 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 |
| 3 | Sa'ed Abed, Otmane Aït Mohamed, Ghiath Al Sammane |
An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs.  |
J. Comput. Sci. Technol.  |
2009 |
DBLP DOI BibTeX RDF |
correctness, reachability analysis, multiway decision graphs, HOL theorem prover |
| 3 | Andy Jinqing Yu, Gianfranco Ciardo, Gerald Lüttgen |
Decision-diagram-based techniques for bounded reachability checking of asynchronous systems.  |
STTT  |
2009 |
DBLP DOI BibTeX RDF |
Edge-valued decision diagrams, Petri net, Formal verification, BDDs, Reachability analysis, Bounded model checking, Asynchronous design, ADDs |
| 3 | Michael Huth, Orna Grumberg |
Special section on advances in reachability analysis and decision procedures: contributions to abstraction-based system verification.  |
STTT  |
2009 |
DBLP DOI BibTeX RDF |
Bounded reachability, Bit-vector arithmetic, Abstraction, Asynchronous systems, Decision diagrams, Memory models, Decision problems |
| 3 | Oded Maler |
Reachability for Continuous and Hybrid Systems.  |
RP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 3 | V. S. Anil Kumar, Matthew Macauley, Henning S. Mortveit |
Limit Set Reachability in Asynchronous Graph Dynamical Systems.  |
RP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 3 | Panagiotis Bouros, Spiros Skiadopoulos, Theodore Dalamagas, Dimitris Sacharidis, Timos K. Sellis |
Evaluating Reachability Queries over Path Collections.  |
SSDBM  |
2009 |
DBLP DOI BibTeX RDF |
path collections, reachability queries |
| 3 | 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 |
| 3 | 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 |
| 3 | 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 |
| 3 | Giorgio Delzanno, Roberto Montagna |
Reachability analysis of fragments of mobile ambients in AC term rewriting.  |
Formal Asp. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
Petri nets, Term rewriting, Reachability, Mobile ambients |
| 3 | Gerardo Schneider |
Reachability analysis of generalized polygonal hybrid systems.  |
SAC  |
2008 |
DBLP DOI BibTeX RDF |
GSPDI, verification, hybrid systems, decidability, reachability |
| 3 | Sa'ed Abed, Otmane Aït Mohamed, Ghiath Al Sammane |
Reachability analysis using multiway decision graphs in the HOL theorem prover.  |
SAC  |
2008 |
DBLP DOI BibTeX RDF |
reachability analysis, HOL, multiway decision graphs |
| 3 | 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 |
| 3 | Xutao Du, Chunxiao Xing, Lizhu Zhou |
Path-Sensitive Reachability Analysis of Web Service Interfaces (Short Paper).  |
QSIC  |
2008 |
DBLP DOI BibTeX RDF |
web service interface, verification, web service composition, reachability analysis |
| 3 | Manuela L. 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 |
| 3 | 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 |
| 3 | 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 |
| 3 | Emmanuel Hainry |
Reachability in Linear Dynamical Systems.  |
CiE  |
2008 |
DBLP DOI BibTeX RDF |
Skolem-Pisot problem, Gelfond-Schneider Theorem, Dynamical Systems, Reachability |
| 3 | José Meseguer, Prasanna Thati |
Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols.  |
Higher-Order and Symbolic Computation  |
2007 |
DBLP DOI BibTeX RDF |
Rewrite theories, Security protocols, Reachability, Narrowing |
| 3 | Bernard Berthomieu, Didier Lime, Olivier H. Roux, François Vernadat |
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches.  |
Discrete Event Dynamic Systems  |
2007 |
DBLP DOI BibTeX RDF |
State classes, Real-time systems modeling and verification, Approximation, Decidability, Time Petri nets, Reachability, Stopwatches |
| 3 | Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin |
On the optimal reachability problem of weighted timed automata.  |
Formal Methods in System Design  |
2007 |
DBLP DOI BibTeX RDF |
Weighted timed automaton, Cost-optimal reachability problem |
| 3 | Yu Lei, Richard H. Carver |
Reachability Testing of Concurrent Programs.  |
IEEE Trans. Software Eng.  |
2006 |
DBLP DOI BibTeX RDF |
Software testing, concurrent programming, reachability testing |
| 3 | Rajeev Alur, Thao Dang, Franjo Ivancic |
Predicate abstraction for reachability analysis of hybrid systems.  |
ACM Trans. Embedded Comput. Syst.  |
2006 |
DBLP DOI BibTeX RDF |
hybrid systems, Reachability analysis, predicate abstraction |
| 3 | Orna Grumberg, Tamir Heyman, Assaf Schuster |
A work-efficient distributed algorithm for reachability analysis.  |
Formal Methods in System Design  |
2006 |
DBLP DOI BibTeX RDF |
Distributed reachability, Distributed BDDs, Symbolic model checking |
| 3 | 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 |
| 3 | 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 |
| 3 | Abdelaziz Guerrouat, Harald Richter |
A Combined Approach for Reachability Analysis.  |
ICSEA  |
2006 |
DBLP DOI BibTeX RDF |
testing and validation, formal specifications, Formal methods, reachability analysis |
| 3 | Sujatha Kashyap, Vijay K. Garg |
Exploiting predicate structure for efficient reachability detection.  |
ASE  |
2005 |
DBLP DOI BibTeX RDF |
model checking, reachability, Mazurkiewicz traces |
| 3 | Suk Jai Seo, Peter J. Slater |
An introduction to competition-reachability of a graph.  |
ACM Southeast Regional Conference  |
2005 |
DBLP DOI BibTeX RDF |
competition parameters, orientations, reachability |
| 3 | 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 |
| 3 | Jean-Raymond Abrial, Dominique Cansell, Dominique Méry |
Refinement and Reachability in EventB.  |
ZB  |
2005 |
DBLP DOI BibTeX RDF |
Refinement, Reachability, B Method, Stuttering |
| 3 | Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu |
Compact reachability labeling for graph-structured data.  |
CIKM  |
2005 |
DBLP DOI BibTeX RDF |
graph reachability labeling |
| 3 | Mikkel Thorup |
Compact oracles for reachability and approximate distances in planar digraphs.  |
J. ACM  |
2004 |
DBLP DOI BibTeX RDF |
reachability and shortest paths oracles, Planar graphs |
| 3 | Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong |
Reachability Analysis over Term Rewriting Systems.  |
J. Autom. Reasoning  |
2004 |
DBLP DOI BibTeX RDF |
completion algorithm, Timbuk, tree automaton, term rewriting, reachability analysis |
| 3 | Parthasarathy Ramachandran, Manjunath Kamath |
A Sufficient Condition for Reachability in a General Petri Net.  |
Discrete Event Dynamic Systems  |
2004 |
DBLP DOI BibTeX RDF |
acyclic transformations, net expansion, transition firing sequence, Petri nets, reachability analysis, unfolding |
| 3 | 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 |
| 3 | Xu Wang, A. W. Roscoe, Ranko Lazic |
Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption.  |
IFM  |
2004 |
DBLP DOI BibTeX RDF |
Trace refinement, Model checking, CSP, Array, Reachability, Data independence |
| 3 | Manuela L. 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 |
| 3 | Liam Roditty, Uri Zwick |
A fully dynamic reachability algorithm for directed graphs with an almost linear update time.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
directed graphs, reachability, transitive closure, dynamic graphs algorithms |
| 3 | 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 |
| 3 | Manuela L. Bujorianu, John Lygeros |
Reachability Questions in Piecewise Deterministic Markov Processes.  |
HSCC  |
2003 |
DBLP DOI BibTeX RDF |
Markov processes, Hybrid systems, reachability, hitting times |
| 3 | Peter Buchholz, Peter Kemper |
Efficient Computation and Representation of Large Reachability Sets for Composed Automata.  |
Discrete Event Dynamic Systems  |
2002 |
DBLP DOI BibTeX RDF |
automata networks, Kronecker representation, ordered natural decision diagrams, reachability analysis, equivalence |
| 3 | Sridhar Iyer, S. Ramesh |
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 |
| 3 | Ali Mohades, Mohammadreza Razzazi |
Reachability on a Region Bounded by Two Attached Squares.  |
International Conference on Computational Science  |
2001 |
DBLP DOI BibTeX RDF |
Multi-link arm, concave region, motion planning, reachability, robot arms |
| 3 | Karsten Schmidt 0004 |
Integrating Low Level Symmetries into Reachability Analysis.  |
TACAS  |
2000 |
DBLP DOI BibTeX RDF |
symmetries, reachability analysis, automorphisms |
| 3 | 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 |
| 3 | Christos T. Karamanolis, Dimitra Giannakopoulou, Jeff Magee, Stuart M. Wheater |
Model Checking of Workflow Schemas. (PDF / PS)  |
EDOC  |
2000 |
DBLP DOI BibTeX RDF |
workflow schemas, error-prone process, primitive syntactic verification, automata-based method, compositional reachability analysis, model checking, formal methods, formal verification, robustness, correctness, reachability analysis, liveness properties |
| 3 | Anders Wall, Kristian Sandström, Jukka Mäki-Turja, Christer Norström, Wang Yi |
Verifying temporal constraints on data in multi-rate transactions using timed automata.  |
RTCSA  |
2000 |
DBLP DOI BibTeX RDF |
temporal constraint verification, multi-rate transactions, nonpreemptive execution order, scheduling, real-time systems, real-time systems, program verification, transaction processing, computational models, timed automata, data dependencies, schedulability analysis, reachability analysis, reachability analysis, automata theory, end-to-end latency |
| 3 | Shing-Chi Cheung, Jeff Kramer |
Checking Safety Properties Using Compositional Reachability Analysis.  |
ACM Trans. Softw. Eng. Methodol.  |
1999 |
DBLP DOI BibTeX RDF |
compositional reachability analysis, distributed systems, model checking, static analysis, safety properties |
| 3 | 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 |
| 3 | Sridhar Iyer, S. Ramesh |
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 |
| 3 | Kim Guldstrand Larsen, Fredrik Larsson, Paul Pettersson, Wang Yi |
Efficient verification of real-time systems: compact data structure and state-space reduction. (PDF / PS)  |
IEEE Real-Time Systems Symposium  |
1997 |
DBLP DOI BibTeX RDF |
real-time systems verification, clock values, clock constraints, real-valued variables, static analysis, timed automata, termination, reachability analysis, reachability analysis, state-space reduction, compact data structure |
| 3 | 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 |
| 3 | Zhiyuan Ying, S. Sitharama Iyengar |
Robot reachability problem: A nonlinear optimization approach.  |
Journal of Intelligent and Robotic Systems  |
1995 |
DBLP DOI BibTeX RDF |
Tunneling algorithm, robot manipulator, reachability test |
| 3 | 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 |
| 3 | 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 |
| 3 | Alvin S. Lim |
Automatic analytical tools for reliability and dynamic adaptation of complex distributed systems.  |
ICECCS  |
1995 |
DBLP DOI BibTeX RDF |
automatic analytical tools, complex distributed systems, runtime facilities, complex application behavior, reliability, formal specification, distributed processing, software tools, software reliability, software fault tolerance, reachability analysis, liveness, reachability, dynamic adaptation, failure recovery, development environment, behavior specification, group behavior |
| 3 | 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 |
| 3 | 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 |
| 3 | 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 |
| 3 | 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 |
| 2 | Rachid Hadjidj, Hanifa Boucheneb |
Efficient Reachability Analysis for Time Petri Nets.  |
IEEE Trans. Computers  |
2011 |
DBLP DOI BibTeX RDF |
time Petri nets (TPN), state class spaces, reachability properties, model checking, Formal methods |
| 2 | Miroslav Svéda, Ondrej Rysavy, Gayan de Silva, Petr Matousek, Jaroslav Ráb |
Reachability Analysis in Dynamically Routed Networks.  |
ECBS  |
2011 |
DBLP DOI BibTeX RDF |
network reachability, routing protocols, network design, IP-networks, network configuration |
| 2 | Roland Axelsson, Martin Lange |
Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics.  |
RP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 2 | Jean-François Raskin |
Reachability Problems for Hybrid Automata.  |
RP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 2 | Krishnendu Chatterjee |
Graph Games with Reachability Objectives - (Invited Talk).  |
RP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 2 | Nataliya Skrypnyuk, Flemming Nielson |
Reachability for Finite-State Process Algebras Using Static Analysis.  |
RP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 2 | Xin Chen, Erika Ábrahám, Goran Frehse |
Efficient Bounded Reachability Computation for Rectangular Automata.  |
RP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 2 | Christian Eggermont, Gerhard J. Woeginger |
Reachability and Deadlocking Problems in Multi-stage Scheduling.  |
RP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 2 | Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni |
Improving Reachability Analysis of Infinite State Systems by Specialization.  |
RP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 2 | 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 |
| 2 | Parisa Heidari, Hanifa Boucheneb |
Efficient Method for Checking the Existence of a Safety/ Reachability Controller for Time Petri Nets.  |
ACSD  |
2010 |
DBLP DOI BibTeX RDF |
on-the-fly algorithm, reachability properties, time Petri nets, safety properties, controller synthesis |
| 2 | Fang Wei |
Efficient Graph Reachability Query Answering Using Tree Decomposition.  |
RP  |
2010 |
DBLP DOI BibTeX RDF |
|
| 2 | Jakub Chaloupka |
Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P.  |
RP  |
2010 |
DBLP DOI BibTeX RDF |
|
| 2 | Kim Guldstrand Larsen |
Symbolic and Compositional Reachability for Timed Automata.  |
RP  |
2010 |
DBLP DOI BibTeX RDF |
|
| 2 | Paulin Jacobé de Naurois, Virgile Mogbil |
Rewriting Systems for Reachability in Vector Addition Systems with Pairs.  |
RP  |
2010 |
DBLP DOI BibTeX RDF |
|
| 2 | Amir R. Khakpour, Alex X. Liu |
Quantifying and Querying Network Reachability.  |
ICDCS  |
2010 |
DBLP DOI BibTeX RDF |
Network Reachability, firewalls, network configuration, Access control lists, Network Access Control |
| 2 | Thomas D. LaToza, Brad A. Myers |
Developers ask reachability questions.  |
ICSE  |
2010 |
DBLP DOI BibTeX RDF |
code navigation, developer questions, empirical study, software maintenance, program comprehension |
| 2 | Derrick Stolee, Chris Bourke, N. V. Vinodchandran |
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources.  |
IEEE Conference on Computational Complexity  |
2010 |
DBLP DOI BibTeX RDF |
acyclic digraph, logspace algorithm, planar graph, reachability |
| 2 | Thao Dang, Oded Maler, Romain Testylier |
Accurate hybridization of nonlinear systems.  |
HSCC  |
2010 |
DBLP DOI BibTeX RDF |
reachability computation, numerical analysis, non-linear systems |
| 2 | Andrew Begel, Yit Phang Khoo, Thomas Zimmermann |
Codebook: discovering and exploiting relationships in software repositories.  |
ICSE  |
2010 |
DBLP DOI BibTeX RDF |
inter-team coordination, regular language reachability, social networking, knowledge management, regular expression, mining software repositories |
| 2 | Guoqing (Harry) Xu, Atanas Rountev |
Detecting inefficiently-used containers to avoid bloat.  |
PLDI  |
2010 |
DBLP DOI BibTeX RDF |
cfl reachability, container bloat, points-to analysis |
| 2 | 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 |
| 2 | Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamaric |
A low-level memory model and an accompanying reachability predicate.  |
STTT  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell |
Reachability in Succinct and Parametric One-Counter Automata.  |
CONCUR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Wolfgang Thomas |
The Reachability Problem over Infinite Graphs.  |
CSR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger |
Termination criteria for solving concurrent safety and reachability games.  |
SODA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | 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 |
|
| 2 | Patricia Bouyer, Vojtech Forejt |
Reachability in Stochastic Timed Games.  |
ICALP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Jasper Berendsen, Taolue Chen, David N. Jansen |
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata.  |
TAMC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Tayssir Touili |
Constrained Reachability of Process Rewrite Systems.  |
ICTAC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Martin Fränzle, Mani Swaminathan |
Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata.  |
FORMATS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Alexander Markowetz, Yin Yang, Dimitris Papadias |
Reachability Indexes for Relational Keyword Search.  |
ICDE  |
2009 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 2380 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|