|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1988 occurrences of 963 keywords
|
|
|
Results
Found 5162 publication records. Showing 5162 according to the selection in the facets
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(4), pp. 675-723, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Eighth Annual International Conference on Network Protocols, ICNP 2000, 14-17 November, 2000, Osaka, Japan, pp. 141-150, 2000, IEEE Computer Society, 0-7695-0921-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN '95), September 20-23, 1995, Las Vegas, Nevada, USA, pp. 32, 1995, IEEE Computer Society, 0-8186-7180-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 595-608, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings, pp. 375-385, 2006, Springer, 3-540-35428-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MineNet ![In: Proceedings of the 2nd Annual ACM Workshop on Mining Network Data, MineNet 2006, Pisa, Italy, September 15, 2006, pp. 335-340, 2006, ACM, 1-59593-569-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference (1) ![In: Proceedings of the 43nd Annual Southeast Regional Conference, 2005, Kennesaw, Georgia, USA, March 18-20, 2005, Volume 1, pp. 121-125, 2005, ACM, 1-59593-059-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
competition parameters, orientations, reachability |
56 | John Kodumal, Alexander Aiken |
The set constraint/CFL reachability connection in practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation 2004, Washington, DC, USA, June 9-11, 2004, pp. 207-218, 2004, ACM, 1-58113-807-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 27(11), pp. 1037-1056, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN '95), September 20-23, 1995, Las Vegas, Nevada, USA, pp. 656, 1995, IEEE Computer Society, 0-8186-7180-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Communication protocols, reachability analysis, specification and verification |
56 | Markus Lindquist |
Parameterized Reachability Trees for Predicate/Transition Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applications and Theory of Petri Nets ![In: Advances in Petri Nets 1993, Papers from the 12th International Conference on Applications and Theory of Petri Nets, Gjern, Denmark, June 1991, pp. 301-324, 1991, Springer, 3-540-56689-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advanced Applications, 14th International Conference, DASFAA 2009, Brisbane, Australia, April 21-23, 2009. Proceedings, pp. 138-152, 2009, Springer, 978-3-642-00886-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, 3-8 April 2006, Atlanta, GA, USA, pp. 75, 2006, IEEE Computer Society, 0-7695-2570-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
56 | Jorge Júlvez, Laura Recalde, Manuel Silva Suárez |
On Reachability in Autonomous Continuous Petri Net Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICATPN ![In: Applications and Theory of Petri Nets 2003, 24th International Conference, ICATPN 2003, Eindhoven, The Netherlands, June 23-27, 2003, Proceedings, pp. 221-240, 2003, Springer, 3-540-40334-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
56 | Keiko Takahashi, Isao Ono, Hiroshi Satoh, Shigenobu Kobayashi |
An Efficient Genetic Algorithm for Reachability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (5) ![In: 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 7-10 January 1997, Maui, Hawaii, USA, pp. 89-98, 1997, IEEE Computer Society, 0-8186-7734-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 187-201, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
50 | Shing-Chi Cheung, Jeff Kramer |
Checking Subsystem Safety Properties in Compositional Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE ![In: 18th International Conference on Software Engineering, Berlin, Germany, March 25-29, 1996, Proceedings., pp. 144-154, 1996, IEEE Computer Society, 0-8186-7246-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2009, Providence, Rhode Island, USA, June 29 - July 2, 2009, pp. 813-826, 2009, ACM, 978-1-60558-551-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, March 16-20, 2008, pp. 327-332, 2008, ACM, 978-1-59593-753-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
GSPDI, verification, hybrid systems, decidability, reachability |
50 | Yu Lei 0001, Richard H. Carver |
Reachability Testing of Concurrent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 32(6), pp. 382-403, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 608-621, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 12(3), pp. 265-286, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Softw. Eng. Methodol. ![In: ACM Trans. Softw. Eng. Methodol. 5(4), pp. 334-377, 1996. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(5), pp. 325-336, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE (1) ![In: Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1, ICSE 2010, Cape Town, South Africa, 1-8 May 2010, pp. 185-194, 2010, ACM, 978-1-60558-719-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
code navigation, developer questions, empirical study, software maintenance, program comprehension |
49 | C.-H. Luke Ong, Nikos Tzevelekos |
Functional Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA, pp. 286-295, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
49 | Irith Pomeranz, Sudhakar M. Reddy |
Functional Broadside Tests with Different Levels of Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 20th International Conference on VLSI Design (VLSI Design 2007), Sixth International Conference on Embedded Systems (ICES 2007), 6-10 January 2007, Bangalore, India, pp. 799-804, 2007, IEEE Computer Society, 0-7695-2762-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 13-17 March 2005, Miami, FL, USA, pp. 2170-2183, 2005, IEEE, 0-7803-8968-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Mustapha Bourahla, Mohamed Benmohamed |
Efficient partition of state space for parallel reachability analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), January 3-6, 2005, Cairo, Egypt, pp. 21, 2005, IEEE Computer Society, 0-7803-8735-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Richard H. Carver, Yu Lei 0001 |
A General Model for Reachability Testing of Concurrent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering, 6th International Conference on Formal Engineering Methods, ICFEM 2004, Seattle, WA, USA, November 8-12, 2004, Proceedings, pp. 76-98, 2004, Springer, 3-540-23841-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
49 | Nabil Hameurlain, Christophe Sibertin-Blanc |
Finite Symbolic Reachability Graphs for High-Level Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 4th Asia-Pacific Software Engineering and International Computer Science Conference (APSEC '97 / ICSC '97), 2-5 December 1997, Clear Water Bay, Hong Kong, pp. 150-159, 1997, IEEE Computer Society, 0-8186-8271-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
47 | Dina Thomas, Supratik Chakraborty, Paritosh K. Pandya |
Efficient guided symbolic reachability using reachability expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 10(2), pp. 113-129, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
47 | Dina Thomas, Supratik Chakraborty, Paritosh K. Pandya |
Efficient Guided Symbolic Reachability Using Reachability Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 12th International Conference, TACAS 2006 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings, pp. 120-134, 2006, Springer, 3-540-33056-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010, pp. 711-722, 2010, ACM, 978-1-4503-0032-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 28(6), pp. 607-623, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECRTS ![In: 10th Euromicro Conference on Real-Time Systems (ECRTS 1998), 17-19 June 1998, berlin, Germany, Proceedings, pp. 154-161, 1998, IEEE Computer Society, 0-8186-8503-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
45 | Eduardo Pelegrí-Llopart, Susan L. Graham |
Optimal Code Generation for Expression Trees: An Application of BURS Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, San Diego, California, USA, January 10-13, 1988, pp. 294-308, 1988, ACM Press, 0-89791-252-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 22rd EUROMICRO Conference '96, Beyond 2000: Hardware and Software Design Strategies, September 2-5, 1996, Prague, Czech Republic, pp. 193-, 1996, IEEE Computer Society, 0-8186-7487-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Measurement Conference ![In: Proceedings of the 9th ACM SIGCOMM Internet Measurement Conference, IMC 2009, Chicago, Illinois, USA, November 4-6, 2009, pp. 242-253, 2009, ACM, 978-1-60558-771-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIS-ICIS ![In: 7th IEEE/ACIS International Conference on Computer and Information Science, IEEE/ACIS ICIS 2008, 14-16 May 2008, Portland, Oregon, USA, pp. 237-240, 2008, IEEE Computer Society, 978-0-7695-3131-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 11th International Workshop, HSCC 2008, St. Louis, MO, USA, April 22-24, 2008. Proceedings, pp. 610-613, 2008, Springer, 978-3-540-78928-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 31(2), pp. 135-175, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31 - November 5, 2005, pp. 594-601, 2005, ACM, 1-59593-140-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
graph reachability labeling |
43 | Tatiana Rybina, Andrei Voronkov |
A Logical Reconstruction of Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ershov Memorial Conference ![In: Perspectives of Systems Informatics, 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, 2003, Revised Papers, pp. 222-237, 2003, Springer, 3-540-20813-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 6th International Workshop, HSCC 2003 Prague, Czech Republic, April 3-5, 2003, Proceedings, pp. 126-140, 2003, Springer, 3-540-00913-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSN ![In: 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 25-28 June 2000, New York, NY, USA, pp. 315-324, 2000, IEEE Computer Society, 0-7695-0707-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 24(9), pp. 682-694, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 4th Asia-Pacific Software Engineering and International Computer Science Conference (APSEC '97 / ICSC '97), 2-5 December 1997, Clear Water Bay, Hong Kong, pp. 160-, 1997, IEEE Computer Society, 0-8186-8271-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 12(1), pp. 87-100, 1995. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Application and Theory of Petri Nets ![In: Application and Theory of Petri Nets 1995, 16th International Conference, Turin, Italy, June 26-30, 1995, Proceedings, pp. 238-257, 1995, Springer, 3-540-60029-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applications and Theory of Petri Nets ![In: Advances in Petri Nets 1991, Papers from the 11th International Conference on Applications and Theory of Petri Nets, Paris, France, June 1990, pp. 205-226, 1990, Springer, 3-540-54398-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA, pp. 4-13, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA, pp. 27-36, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Yangjun Chen |
General spanning trees and reachability query evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
C3S2E ![In: Canadian Conference on Computer Science & Software Engineering, C3S2E 2009, Montreal, Quebec, Canada, May 19-21, 2009, Proceedings, pp. 243-252, 2009, ACM, 978-1-60558-401-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Matthias Werner 0001, Gero Mühl |
Non-reachability in Petri Nets with Delaying Places. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASCOTS ![In: 14th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2006), 11-14 September 2006, Monterey, California, USA, pp. 401-412, 2006, IEEE Computer Society, 0-7695-2573-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Joost-Pieter Katoen, Ivan S. Zapreev |
Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QEST ![In: Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 11-14 September 2006, Riverside, California, USA, pp. 301-310, 2006, IEEE Computer Society, 0-7695-2665-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Jiefeng Cheng, Jeffrey Xu Yu, Nan Tang 0001 |
Fast Reachability Query Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advanced Applications, 11th International Conference, DASFAA 2006, Singapore, April 12-15, 2006, Proceedings, pp. 674-688, 2006, Springer, 3-540-33337-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Nadia Busi, Gianluigi Zavattaro |
Reachability Analysis in Boxed Ambients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings, pp. 143-159, 2005, Springer, 3-540-29106-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Ahmed Bouajjani, Tayssir Touili |
On Computing Reachability Sets of Process Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 484-499, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Derek Rayside, Kostas Kontogiannis |
A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSMR ![In: 6th European Conference on Software Maintenance and Reengineering (CSMR 2002), 11-13 March 2002, Budapest, Hungary, Proceedings, pp. 67-76, 2002, IEEE Computer Society, 0-7695-1438-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Yu Lei 0001, Kuo-Chung Tai |
Blocking-based Simultaneous Reachability Analysis of Asynchronous Message-passing Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSRE ![In: 13th International Symposium on Software Reliability Engineering (ISSRE 2002), 12-15 November 2002, Annapolis, MD, USA, pp. 316-328, 2002, IEEE Computer Society, 0-7695-1763-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Youpyo Hong, Peter A. Beerel |
Symbolic Reachability Analysis of Large Finite State Machines Using Don't Cares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 1999 Design, Automation and Test in Europe (DATE '99), 9-12 March 1999, Munich, Germany, pp. 13-, 1999, IEEE Computer Society / ACM, 0-7695-0078-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
43 | David Melski, Thomas W. Reps |
Interconveritibility of Set Constraints and Context-Free Language Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '97), Amsterdam, The Netherlands, June 12-13, 1997, pp. 74-89, 1997, ACM, 0-89791-917-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
43 | Dong-Ik Lee, Sadatoshi Kumagai, Shinzo Kodama |
Handles and Reachability Analysis of Free Choice Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Application and Theory of Petri Nets ![In: Application and Theory of Petri Nets 1995, 16th International Conference, Turin, Italy, June 26-30, 1995, Proceedings, pp. 298-315, 1995, Springer, 3-540-60029-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Application and Theory of Petri Nets ![In: Application and Theory of Petri Nets 1994, 15th International Conference, Zaragoza, Spain, June 20-24, 1994, Proceedings, pp. 39-58, 1994, Springer, 3-540-58152-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
40 | Salvatore La Torre, P. Madhusudan, Gennaro Parlato |
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings, pp. 477-492, 2009, Springer, 978-3-642-02657-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
40 | Giuliana Franceschinis, Richard R. Muntz |
Computing Bounds for the Performance Indices of Quasi-Lumpable Stochastic Well-Formed Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(7), pp. 516-525, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 197-211, 2009, Springer, 978-3-642-00595-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30 - April 1, 2006, Proceedings, pp. 201-218, 2006, Springer, 3-540-33102-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings, pp. 457-473, 2005, Springer, 3-540-29209-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 7th Pacific-Asia Conference, PAKDD 2003, Seoul, Korea, April 30 - May 2, 2003, Proceedings, pp. 75-87, 2003, Springer, 3-540-04760-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003. Revised Papers, pp. 246-259, 2003, Springer, 3-540-21671-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 4th International Workshop, HSCC 2001, Rome, Italy, March 28-30, 2001, Proceedings, pp. 261-274, 2001, Springer, 3-540-41866-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 22(11), pp. 794-811, 1996. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, 2010, pp. 7-18, 2010, ACM, 978-1-60558-479-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 2511-2516, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010, pp. 123-134, 2010, ACM, 978-1-4503-0032-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 11(2), pp. 85-94, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSDBM ![In: Scientific and Statistical Database Management, 21st International Conference, SSDBM 2009, New Orleans, LA, USA, June 2-4, 2009, Proceedings, pp. 398-416, 2009, Springer, 978-3-642-02278-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Measurement Conference ![In: Proceedings of the 9th ACM SIGCOMM Internet Measurement Conference, IMC 2009, Chicago, Illinois, USA, November 4-6, 2009, pp. 235-241, 2009, ACM, 978-1-60558-771-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
ip reachability, longest-matching prefix, bgp |
37 | Andrzej S. Murawski |
Reachability Games and Game Semantics: Comparing Nondeterministic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 353-363, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ZB ![In: ZB 2005: Formal Specification and Development in Z and B, 4th International Conference of B and Z Users, Guildford, UK, April 13-15, 2005, Proceedings, pp. 222-241, 2005, Springer, 3-540-25559-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 42nd Design Automation Conference, DAC 2005, San Diego, CA, USA, June 13-17, 2005, pp. 467-470, 2005, ACM, 1-59593-058-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 14(3), pp. 251-266, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 7th International Workshop, HSCC 2004, Philadelphia, PA, USA, March 25-27, 2004, Proceedings, pp. 234-249, 2004, Springer, 3-540-21259-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for Construction and Analysis of Systems, 6th International Conference, TACAS 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings, pp. 315-330, 2000, Springer, 3-540-67282-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
symmetries, reachability analysis, automorphisms |
36 | Sumit Gulwani, Florian Zuleger |
The reachability-bound problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, Toronto, Ontario, Canada, June 5-10, 2010, pp. 292-304, 2010, ACM, 978-1-4503-0019-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 16th International SPIN Workshop, Grenoble, France, June 26-28, 2009. Proceedings, pp. 192-204, 2009, Springer, 978-3-642-02651-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Hao Yuan, Patrick Th. Eugster |
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: Programming Languages and Systems, 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 175-189, 2009, Springer, 978-3-642-00589-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Martin Fränzle, Mani Swaminathan |
Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings, pp. 149-163, 2009, Springer, 978-3-642-04367-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Fangli Pu, Hai-Yin Xu |
A Feasible Strategy for Reachability Testing of Internet-Based Concurrent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNSC ![In: Proceedings of the IEEE International Conference on Networking, Sensing and Control, ICNSC 2008, Hainan, China, 6-8 April 2008, pp. 1559-1564, 2008, IEEE, 978-1-4244-1685-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Gordon Fraser 0001, Paul Ammann |
Reachability and Propagation for LTL Requirements Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QSIC ![In: Proceedings of the Eighth International Conference on Quality Software, QSIC 2008, 12-13 August 2008, Oxford, UK, pp. 189-198, 2008, IEEE Computer Society, 978-0-7695-3312-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VizSEC ![In: 4th International Workshop on Visualization for Computer Security, VizSEC 2007, Sacramento, CA, USA, October 29, 2007, pp. 221-236, 2007, Springer, 978-3-540-78242-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Marcin Jurdzinski, Ashutosh Trivedi 0001 |
Reachability-Time Games on Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 838-849, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC/EEE ![In: 9th IEEE International Conference on E-Commerce Technology (CEC 2007) / 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services (EEE 2007), 23-26 July 2007, National Center of Sciences, Tokyo, Japan, pp. 131-140, 2007, IEEE Computer Society, 0-7695-2913-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Xenofon D. Koutsoukos, Derek Riley |
Computational Methods for Reachability Analysis of Stochastic Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 9th International Workshop, HSCC 2006, Santa Barbara, CA, USA, March 29-31, 2006, Proceedings, pp. 377-391, 2006, Springer, 3-540-33170-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Yongsun Choi, Xinlei Zhao, Kwanhee Han |
Hierarchical Reachability Analysis for Workflow-Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCWD ![In: Proceedings of the 10th International Conference on CSCW in Design, CSCWD 2006, May 3-5, 2006, Southeast University, Nanjing, China, pp. 556-561, 2006, IEEE, 1-4244-0165-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy |
Grid Graph Reachability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic, pp. 299-313, 2006, IEEE Computer Society, 0-7695-2596-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: Advances in Database Technology - EDBT 2006, 10th International Conference on Extending Database Technology, Munich, Germany, March 26-31, 2006, Proceedings, pp. 961-979, 2006, Springer, 3-540-32960-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Yu Lei 0001, Richard H. Carver |
A New Algorithm for Reachability Testing of Concurrent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSRE ![In: 16th International Symposium on Software Reliability Engineering (ISSRE 2005), 8-11 November 2005, Chicago, IL, USA, pp. 346-355, 2005, IEEE Computer Society, 0-7695-2482-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 5162 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|