|
|
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 |
36 | Michel Bidoit, Rolf Hennicker, Alexander Kurz 0001 |
On the Duality between Observability and Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings, pp. 72-87, 2001, Springer, 3-540-41864-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston |
Symbolic Computation of Maximal Probabilistic Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, pp. 169-183, 2001, Springer, 3-540-42497-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic |
Latency effects on reachability in large-scale peer-to-peer networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001, pp. 84-92, 2001, ACM, 1-58113-409-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin |
Reachability and Connectivity Queries in Constraint Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, May 15-17, 2000, Dallas, Texas, USA, pp. 104-115, 2000, ACM, 1-58113-214-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
36 | Luca Aceto, Augusto Burgueño, Kim Guldstrand Larsen |
Model Checking via Reachability Testing for Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for Construction and Analysis of Systems, 4th International Conference, TACAS '98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings, pp. 263-280, 1998, Springer, 3-540-64356-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
36 | Mauro Pezzè, Richard N. Taylor, Michal Young |
Graph Models for Reachability of Concurrent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Softw. Eng. Methodol. ![In: ACM Trans. Softw. Eng. Methodol. 4(2), pp. 171-213, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
static analysis, process algebra, Ada tasking |
36 | Rodney R. Howell |
On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings, pp. 360-370, 1987, Springer, 3-540-17219-X. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
33 | Anders Wall, Kristian Sandström, Jukka Mäki-Turja, Christer Norström, Wang Yi 0001 |
Verifying temporal constraints on data in multi-rate transactions using timed automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 7th International Workshop on Real-Time Computing and Applications Symposium (RTCSA 2000), 12-14 December 2000, Cheju Island, South Korea, pp. 263-270, 2000, IEEE Computer Society, 0-7695-0930-4. The full citation details ...](Pics/full.jpeg) |
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 |
33 | Christos T. Karamanolis, Dimitra Giannakopoulou, Jeff Magee, Stuart M. Wheater |
Model Checking of Workflow Schemas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDOC ![In: 4th International Enterprise Distributed Object Computing Conference (EDOC 2000), 25-28 September 2000, Makuhari, Japan, Proceedings, pp. 170-181, 2000, IEEE Computer Society, 0-7695-0865-0. The full citation details ...](Pics/full.jpeg) |
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 |
33 | Kim Guldstrand Larsen, Fredrik Larsson, Paul Pettersson, Wang Yi 0001 |
Efficient verification of real-time systems: compact data structure and state-space reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS '97), December 3-5, 1997, San Francisco, CA, USA, pp. 14-24, 1997, IEEE Computer Society, 0-8186-8268-X. The full citation details ...](Pics/full.jpeg) |
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 |
33 | Alvin S. Lim |
Automatic analytical tools for reliability and dynamic adaptation of complex distributed systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECCS ![In: 1st IEEE International Conference on Engineering of Complex Computer Systems (ICECCS '95), November 6-10, 1995, Fort Lauderdale, Florida, USA, pp. 1-8, 1995, IEEE Computer Society, 0-8186-7123-8. The full citation details ...](Pics/full.jpeg) |
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 |
33 | Aminu Mohammed, Mohamed Ould-Khaoua, Lewis M. Mackenzie |
An Efficient Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPEW ![In: Formal Methods and Stochastic Models for Performance Evaluation, Fourth European Performance Engineering Workshop, EPEW 2007, Berlin, Germany, September 27-28, 2007, Proceedings, pp. 275-283, 2007, Springer, 978-3-540-75210-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Broadcast storm problem, Saved-rebroadcast, MANETs, Latency, Flooding, Reachability |
33 | Geguang Pu, Dang Van Hung, Jifeng He 0001, Wang Yi 0001 |
An Optimal Approach to Hardware/Software Partitioning for Synchronous Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFM ![In: Integrated Formal Methods, 4th International Conference, IFM 2004, Canterbury, UK, April 4-7, 2004, Proceedings, pp. 363-381, 2004, Springer, 3-540-21377-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
timed automata, scheduling algorithm, reachability, Hardware/software partitioning |
33 | Sébastien Bardin, Alain Finkel, Jérôme Leroux |
FASTer Acceleration of Counter Automata in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings, pp. 576-590, 2004, Springer, 3-540-21299-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
counter automata, convex translation, TTP protocol, acceleration, reachability set |
33 | Christophe Lohr, Jean-Pierre Courtiat |
From the Specification to the Scheduling of Time-Dependent Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTRTFT ![In: Formal Techniques in Real-Time and Fault-Tolerant Systems, 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, Proceedings, pp. 129-146, 2002, Springer, 3-540-44165-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Minimal Reachability Graph, Time Labeled Scheduling Automata, Process Algebra, Timed Automata, Temporal Consistency, RT-Lotos |
33 | Marko Mäkelä |
Optimising Enabling Tests and Unfoldings of Algebraic System Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICATPN ![In: Application and Theory of Petri Nets 2001, 22nd International Conference, ICATPN 2001, Newcastle upon Tyne, UK, June 25-29, 2001, Proceedings, pp. 283-302, 2001, Springer, 3-540-42252-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
reachability analysis, unification, high-level Petri nets, unfolding |
33 | Christoph Schneider, Joachim Wehler |
Petri Net Theory - Problems Solved by Commutative Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICATPN ![In: Application and Theory of Petri Nets 1999, 20th International Conference, ICATPN '99, Williamsburg, Virginia, USA, June 21-25, 1999, Proceedings, pp. 248-267, 1999, Springer, 3-540-66132-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Artin net, commutative net, Gröbner theory, Coloured Petri net, flow, reachability |
32 | Fernando Rosa-Velardo, David de Frutos-Escrig |
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Applications and Theory of Petri Nets, 30th International Conference, PETRI NETS 2009, Paris, France, June 22-26, 2009. Proceedings, pp. 63-82, 2009, Springer, 978-3-642-02423-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Taolue Chen, Tingting Han 0001, Joost-Pieter Katoen, Alexandru Mereacre |
LTL Model Checking of Time-Inhomogeneous Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings, pp. 104-119, 2009, Springer, 978-3-642-04760-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Marta Z. Kwiatkowska, Gethin Norman, David Parker 0001 |
Stochastic Games for Verification of Probabilistic 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. 212-227, 2009, Springer, 978-3-642-04367-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr |
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, pp. 127-136, 2005, IEEE Computer Society, 0-7695-2266-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Ahmed Bouajjani, Markus Müller-Olm, Tayssir Touili |
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings, pp. 473-487, 2005, Springer, 3-540-28309-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Jie-Hong Roland Jiang, Robert K. Brayton |
Functional Dependency for Verification Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings, pp. 268-280, 2004, Springer, 3-540-22342-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Tatiana Rybina, Andrei Voronkov |
Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings, pp. 546-573, 2003, Springer, 3-540-40801-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi 0001 |
On Higher-Order Reachability Games Vs May Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings, pp. 108-124, 2022, Springer, 978-3-031-19134-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
30 | Sa'ed Abed, Otmane Aït Mohamed, Ghiath Al Sammane |
An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 24(1), pp. 76-95, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
correctness, reachability analysis, multiway decision graphs, HOL theorem prover |
30 | Andy Jinqing Yu, Gianfranco Ciardo, Gerald Lüttgen |
Decision-diagram-based techniques for bounded reachability checking of asynchronous systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 11(2), pp. 117-131, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Edge-valued decision diagrams, Petri net, Formal verification, BDDs, Reachability analysis, Bounded model checking, Asynchronous design, ADDs |
30 | Giorgio Delzanno, Roberto Montagna |
Reachability analysis of fragments of mobile ambients in AC term rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 20(4-5), pp. 407-428, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Petri nets, Term rewriting, Reachability, Mobile ambients |
30 | Sa'ed Abed, Otmane Aït Mohamed, Ghiath Al Sammane |
Reachability analysis using multiway decision graphs in the HOL theorem prover. ![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. 333-338, 2008, ACM, 978-1-59593-753-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
reachability analysis, HOL, multiway decision graphs |
30 | Emmanuel Hainry |
Reachability in Linear Dynamical Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings, pp. 241-250, 2008, Springer, 978-3-540-69405-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Skolem-Pisot problem, Gelfond-Schneider Theorem, Dynamical Systems, Reachability |
30 | Xutao Du, Chunxiao Xing, Lizhu Zhou |
Path-Sensitive Reachability Analysis of Web Service Interfaces (Short Paper). ![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. 114-119, 2008, IEEE Computer Society, 978-0-7695-3312-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
web service interface, verification, web service composition, reachability analysis |
30 | Bernard Berthomieu, Didier Lime, Olivier H. Roux, François Vernadat 0001 |
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 17(2), pp. 133-158, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
State classes, Real-time systems modeling and verification, Approximation, Decidability, Time Petri nets, Reachability, Stopwatches |
30 | José Meseguer 0001, Prasanna Thati |
Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
High. Order Symb. Comput. ![In: High. Order Symb. Comput. 20(1-2), pp. 123-160, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Rewrite theories, Security protocols, Reachability, Narrowing |
30 | Orna Grumberg, Tamir Heyman, Assaf Schuster |
A work-efficient distributed algorithm for reachability analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 29(2), pp. 157-175, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Distributed reachability, Distributed BDDs, Symbolic model checking |
30 | Rajeev Alur, Thao Dang 0001, Franjo Ivancic |
Predicate abstraction for reachability analysis of hybrid systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Embed. Comput. Syst. ![In: ACM Trans. Embed. Comput. Syst. 5(1), pp. 152-199, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
hybrid systems, Reachability analysis, predicate abstraction |
30 | Abdelaziz Guerrouat, Harald Richter 0001 |
A Combined Approach for Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSEA ![In: Proceedings of the International Conference on Software Engineering Advances (ICSEA 2006), October 28 - November 2, 2006, Papeete, Tahiti, French Polynesia, pp. 23, 2006, IEEE Computer Society, 0-7695-2703-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
testing and validation, formal specifications, Formal methods, reachability analysis |
30 | Sujatha Kashyap, Vijay K. Garg |
Exploiting predicate structure for efficient reachability detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), November 7-11, 2005, Long Beach, CA, USA, pp. 4-13, 2005, ACM, 1-58113-993-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
model checking, reachability, Mazurkiewicz traces |
30 | Mikkel Thorup |
Compact oracles for reachability and approximate distances in planar digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(6), pp. 993-1024, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
reachability and shortest paths oracles, Planar graphs |
30 | Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong |
Reachability Analysis over Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 33(3-4), pp. 341-383, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
completion algorithm, Timbuk, tree automaton, term rewriting, reachability analysis |
30 | Xu Wang 0001, A. W. Roscoe 0001, Ranko Lazic 0001 |
Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFM ![In: Integrated Formal Methods, 4th International Conference, IFM 2004, Canterbury, UK, April 4-7, 2004, Proceedings, pp. 247-266, 2004, Springer, 3-540-21377-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Trace refinement, Model checking, CSP, Array, Reachability, Data independence |
30 | Liam Roditty, Uri Zwick |
A fully dynamic reachability algorithm for directed graphs with an almost linear update time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 184-191, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
directed graphs, reachability, transitive closure, dynamic graphs algorithms |
30 | Ali Mohades, Mohammadreza Razzazi |
Reachability on a Region Bounded by Two Attached Squares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (1) ![In: Computational Science - ICCS 2001, International Conference, San Francisco, CA, USA, May 28-30, 2001. Proceedings, Part I, pp. 763-771, 2001, Springer, 3-540-42232-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Multi-link arm, concave region, motion planning, reachability, robot arms |
30 | Shing-Chi Cheung, Jeff Kramer |
Checking Safety Properties Using Compositional Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Softw. Eng. Methodol. ![In: ACM Trans. Softw. Eng. Methodol. 8(1), pp. 49-78, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
compositional reachability analysis, distributed systems, model checking, static analysis, safety properties |
30 | Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger |
Termination criteria for solving concurrent safety and reachability games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 197-206, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Tayssir Touili |
Constrained Reachability of Process Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings, pp. 307-321, 2009, Springer, 978-3-642-03465-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Ming Xu 0010, Liangyu Chen 0001, Zhi-bin Li 0005 |
Symbolic Reachability Computation of a Class of Nonlinear Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIS-ICIS ![In: 8th IEEE/ACIS International Conference on Computer and Information Science, IEEE/ACIS ICIS 2009, June 1-3, 2009, Shanghai, China, pp. 706-710, 2009, IEEE Computer Society, 978-0-7695-3641-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Martin Hofmann 0001, Ulrich Schöpp |
Pointer Programs and Undirected 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. 133-142, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Guoqing Xu 0001, Atanas Rountev, Manu Sridharan |
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: ECOOP 2009 - Object-Oriented Programming, 23rd European Conference, Genoa, Italy, July 6-10, 2009. Proceedings, pp. 98-122, 2009, Springer, 978-3-642-03012-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell 0001 |
Reachability in Succinct and Parametric One-Counter Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings, pp. 369-383, 2009, Springer, 978-3-642-04080-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Min Wan, Gianfranco Ciardo |
Symbolic Reachability Analysis of Integer Timed Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings, pp. 595-608, 2009, Springer, 978-3-540-95890-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Ran Duan, Seth Pettie |
Bounded-leg distance and reachability oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 436-445, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
30 | Yangjun Chen, Yibin Chen |
An Efficient Algorithm for Answering Graph Reachability Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 24th International Conference on Data Engineering, ICDE 2008, April 7-12, 2008, Cancún, Mexico, pp. 893-902, 2008, IEEE Computer Society, 978-1-4244-1836-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Leevar Williams, Richard Lippmann, Kyle Ingols |
GARNET: A Graphical Attack Graph and Reachability Network Evaluation Tool. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VizSEC ![In: 5th International Workshop on Visualization for Computer Security, VizSec 2008, Cambridge, MA, USA, September 15, 2008. Proceedings, pp. 44-59, 2008, Springer, 978-3-540-85931-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
attack path, visualization, network, recommendation, vulnerability, treemap, security metrics, attack graph, exploit, adversary model |
30 | Maria Elena Valcher, Paolo Santesso |
On the reachability of single-input positive switched systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, Mexico, pp. 947-952, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Barbara F. Csima, Bakhadyr Khoussainov |
When Is Reachability Intrinsically Decidable?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings, pp. 216-227, 2008, Springer, 978-3-540-85779-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili |
On the Reachability Analysis of Acyclic Networks of Pushdown Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings, pp. 356-371, 2008, Springer, 978-3-540-85360-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Lei Bu, You Li, Linzhang Wang, Xuandong Li |
BACH : Bounded ReAchability CHecker for Linear Hybrid Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: Formal Methods in Computer-Aided Design, FMCAD 2008, Portland, Oregon, USA, 17-20 November 2008, pp. 1-4, 2008, IEEE, 978-1-4244-2735-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Sudip K. Mazumder, Kaustuva Acharya, Muhammad Tahir 0002 |
Network reconfiguration of distributed controlled homogenous power inverter network using composite Lyapunov function based reachability bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCSC ![In: Proceedings of the 2007 Summer Computer Simulation Conference, SCSC 2007, San Diego, California, USA, July 16-19, 2007, pp. 76-87, 2007, Simulation Councils, Inc., 1-56555-316-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
piecewise linear systems, reaching conditions, switching power converters, linear matrix inequality, Markov-chain model, Lyapunov stability |
30 | Spring Berman, Ádám M. Halász, Vijay Kumar 0001 |
MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 10th International Workshop, HSCC 2007, Pisa, Italy, April 3-5, 2007, Proceedings, pp. 76-89, 2007, Springer, 978-3-540-71492-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Ian M. Mitchell |
Comparing Forward and Backward Reachability as Tools for Safety Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 10th International Workshop, HSCC 2007, Pisa, Italy, April 3-5, 2007, Proceedings, pp. 428-443, 2007, Springer, 978-3-540-71492-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Alessandro Abate, Saurabh Amin, Maria Prandini, John Lygeros, Shankar Sastry 0001 |
Computational Approaches to Reachability Analysis of Stochastic Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 10th International Workshop, HSCC 2007, Pisa, Italy, April 3-5, 2007, Proceedings, pp. 4-17, 2007, Springer, 978-3-540-71492-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Mikolaj Bojanczyk, Piotr Hoffman |
Reachability in Unions of Commutative Rewriting Systems Is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 622-633, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Topic classification Logic in computer science, rewriting |
30 | Woosin Lee, Hyukjoon Lee, Hyungkeun Lee, Keecheon Kim |
Packet Forwarding Based on Reachability Information for VANETs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICOIN ![In: Information Networking. Towards Ubiquitous Networking and Services, International Conference, ICOIN 2007, Estoril, Portugal, January 23-25, 2007. Revised Selected Papers, pp. 305-314, 2007, Springer, 978-3-540-89523-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger |
Strategy Improvement for Concurrent Reachability Games. ![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. 291-300, 2006, IEEE Computer Society, 0-7695-2665-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera 0001 |
Reachability in Recursive Markov Decision Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings, pp. 358-374, 2006, Springer, 3-540-37376-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Stephen Prajna, Anders Rantzer |
Primal-Dual Tests for Safety and Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings, pp. 542-556, 2005, Springer, 3-540-25108-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer, David L. Dill, E. Allen Emerson |
Predictive Reachability Using a Sample-Based Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHARME ![In: Correct Hardware Design and Verification Methods, 13th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2005, Saarbrücken, Germany, October 3-6, 2005, Proceedings, pp. 388-392, 2005, Springer, 3-540-29105-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Luis Quesada 0001, Peter Van Roy, Yves Deville |
Speeding Up Constrained Path Solvers with a Reachability Propagator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 866, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek |
Reachability Analysis of Multithreaded Software with Asynchronous Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings, pp. 348-359, 2005, Springer, 3-540-30495-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Raffaella Gentilini |
Reachability Problems on Extended O-Minimal Hybrid Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005, Proceedings, pp. 162-176, 2005, Springer, 3-540-30946-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Peep Küngas |
Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SARA ![In: Abstraction, Reformulation and Approximation, 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings, pp. 149-164, 2005, Springer, 3-540-27872-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Lawrence E. Holloway, A. S. Khare, Yu Gong |
Computing bounds for forbidden State reachability functions for controlled Petri nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part A ![In: IEEE Trans. Syst. Man Cybern. Part A 34(2), pp. 219-228, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Amit Bhatia 0001, Emilio Frazzoli |
Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems. ![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. 142-156, 2004, Springer, 3-540-21259-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Yu Lei 0001, Richard H. Carver |
Reachability Testing of Semaphore-Based Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: 28th International Computer Software and Applications Conference (COMPSAC 2004), Design and Assessment of Trustworthy Software-Based Systems, 27-30 September 2004, Hong Kong, China, Proceedings, pp. 312-317, 2004, IEEE Computer Society, 0-7695-2209-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Igor Potapov |
From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings, pp. 345-356, 2004, Springer, 3-540-24014-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Shuang Quan Li, Huo Yan Chen, Yu Xia Sun |
A framework of reachability testing for Java multithread programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC (3) ![In: Proceedings of the IEEE International Conference on Systems, Man & Cybernetics: The Hague, Netherlands, 10-13 October 2004, pp. 2730-2734, 2004, IEEE, 0-7803-8566-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, Aletta Nylén |
Forward Reachability Analysis of Timed Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS/FTRTFT ![In: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, Joint International Conferences on Formal Modelling and Analysis of Timed Systems, FORMATS 2004 and Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT 2004, Grenoble, France, September 22-24, 2004, Proceedings, pp. 343-362, 2004, Springer, 3-540-23167-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Amit Goel, Randal E. Bryant |
Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2003 Design, Automation and Test in Europe Conference and Exposition (DATE 2003), 3-7 March 2003, Munich, Germany, pp. 10816-10821, 2003, IEEE Computer Society, 0-7695-1870-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Eugene Asarin, Thao Dang 0001, Antoine Girard |
Reachability Analysis of Nonlinear Systems Using Conservative Approximation . ![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. 20-35, 2003, Springer, 3-540-00913-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Ettore Fornasini, Maria Elena Valcher |
On the Positive Reachability of 2D Positive Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POSTA ![In: Positive Systems, Proceedings of the First Multidisciplinary International Symposium on Positive Systems: Theory and Applications (POSTA 2003), Rome, Italy, August 28-30, 2003, pp. 297-304, 2003, Springer, 3-540-40342-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Guangming Xie, Long Wang 0001 |
Reachability and Controllability of Positive Linear Discrete-time Systems with Time-delays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POSTA ![In: Positive Systems, Proceedings of the First Multidisciplinary International Symposium on Positive Systems: Theory and Applications (POSTA 2003), Rome, Italy, August 28-30, 2003, pp. 377-384, 2003, Springer, 3-540-40342-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Arfst Nickelsen, Till Tantau |
On Reachability in Graphs with Bounded Independence Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 554-563, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Yu Lei 0001, Kuo-Chung Tai |
Efficient Reachability Testing of Asynchronous Message-Passing Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECCS ![In: 8th International Conference on Engineering of Complex Computer Systems (ICECCS 2002), 2-4 December 2002, Greenbelt, MD, USA, pp. 35-, 2002, IEEE Computer Society, 0-7695-1757-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Kamil Saraç, Kevin C. Almeroth |
Providing Scalable Many-to-One Feedback in Multicast Reachability Monitoring Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MMNS ![In: Management of Multimedia on the Internet, 4th IFIP/IEEE International Conference on Management of Multimedia Networks and Services, MMNS 2001, Chicago, IL, USA October 29 - November 1, 2001, Proceedings, pp. 256-270, 2001, Springer, 3-540-42786-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
30 | Dirk Beyer 0001 |
Improvements in BDD-Based Reachability Analysis of Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FME ![In: FME 2001: Formal Methods for Increasing Software Productivity, International Symposium of Formal Methods Europe, Berlin, Germany, March 12-16, 2001, Proceedings, pp. 318-343, 2001, Springer, 3-540-41791-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Real-time systems, Formal verification, Timed automata, BDDs, Discretization |
30 | Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, Yassine Lakhnech |
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 11th International Conference, CAV '99, Trento, Italy, July 6-10, 1999, Proceedings, pp. 146-159, 1999, Springer, 3-540-66202-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
30 | Antony L. Hosking, Jiawan Chen |
Mostly-copying Reachability-based Orthogonal Persistence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA ![In: Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages & Applications, OOPSLA 1999, Denver, Colorado, USA, November 1-5, 1999., pp. 382-398, 1999, ACM, 1-58113-238-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
C++, Modula-3 |
30 | Yiorgos Makris, Alex Orailoglu |
Channel-Based Behavioral Test Synthesis for Improved Module Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 1999 Design, Automation and Test in Europe (DATE '99), 9-12 March 1999, Munich, Germany, pp. 283-288, 1999, IEEE Computer Society / ACM, 0-7695-0078-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
30 | Sairam Subramanian |
A Fully Dynamic Data Structure for Reachability in Planar Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, pp. 372-383, 1993, Springer, 3-540-57273-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
30 | Shing-Chi Cheung, Jeff Kramer |
Enhancing Compositional Reachability Analysis with Context Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGSOFT FSE ![In: Proceedings of the First ACM SIGSOFT Symposium on Foundations of Software Engineering, SIGSOFT 1993, Los Angeles, California, USA, December 7-10, 1993, pp. 115-125, 1993, ACM, 978-0-89791-625-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
30 | Ryszard Janicki, Maciej Koutny |
Using Optimal Simulations to Reduce Reachability Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 2nd International Workshop, CAV '90, New Brunswick, NJ, USA, June 18-21, 1990, Proceedings, pp. 166-175, 1990, Springer, 3-540-54477-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
30 | Rodney R. Howell, Louis E. Rosier |
Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings, pp. 509-520, 1987, Springer, 3-540-18088-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
28 | Oded Maler |
Reachability for Continuous and Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, pp. 24-25, 2009, Springer, 978-3-642-04419-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | V. S. Anil Kumar 0001, Matthew Macauley, Henning S. Mortveit |
Limit Set Reachability in Asynchronous Graph Dynamical Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, pp. 217-232, 2009, Springer, 978-3-642-04419-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Eric Y. T. Juan, Jeffrey J. P. Tsai, Tadao Murata |
Compositional Verification of Concurrent Systems Using Petri-Net-Based Condensation Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 20(5), pp. 917-979, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
deadlock states, reachable markings, Petri nets, reachability analysis, compositional verification, boundedness, reachability graphs |
26 | Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci |
FAST: acceleration from theory to practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 10(5), pp. 401-424, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Counter systems, Infinite reachability set, Acceleration, Symbolic representation |
26 | Ramadhana Bramandia, Byron Choi, Wee Keong Ng |
On incremental maintenance of 2-hop labeling of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, April 21-25, 2008, pp. 845-854, 2008, ACM, 978-1-60558-085-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
2-hop, incremental maintenance, graph indexing, reachability test |
26 | Haibin Zhang, Zhenhua Duan |
Symbolic Algorithm Analysis of Rectangular Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 294-305, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
model checking, temporal logic, hybrid systems, reachability analysis |
26 | Silke Trißl, Ulf Leser |
Fast and practical indexing and querying of very large graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China, June 12-14, 2007, pp. 845-856, 2007, ACM, 978-1-59593-686-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
databases, graph indexing, reachability queries |
26 | John Kodumal, Alex Aiken |
Regularly annotated set constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, California, USA, June 10-13, 2007, pp. 331-341, 2007, ACM, 978-1-59593-633-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
annotated inclusion constraints, pushdown model checking, flow analysis, set constraints, context-free language reachability |
Displaying result #101 - #200 of 5162 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|