|
|
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 |
26 | Patricia Bouyer, Pierre-Alain Reynier, Serge Haddad |
Extended Timed Automata and Time Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSD ![In: Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 28-30 June 2006, Turku, Finland, pp. 91-100, 2006, IEEE Computer Society, 0-7695-2556-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Conciseness, Timed Automata, Reachability Analysis, Time Petri Nets |
26 | Bixin Li, Yancheng Wang, Lili Yang |
An Integrated Regression Testing Framework to Multi-Threaded Java Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SET ![In: Software Engineering Techniques: Design for Quality, SET 2006, October 17-20, 2006, Warsaw, Poland, pp. 237-248, 2006, Springer, 978-0-387-39387-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Regression testing, Multi-threaded program, Reachability testing |
26 | Jifeng He 0001, Dang Van Hung, Geguang Pu, Zongyan Qiu, Wang Yi 0001 |
Exploring optimal solution to hardware/software partitioning for synchronous model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 17(4), pp. 443-460, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Timed automata, Scheduling algorithm, Reachability, Hardware/software partitioning |
26 | Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav Bodík |
Demand-driven points-to analysis for Java. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA ![In: Proceedings of the 20th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2005, October 16-20, 2005, San Diego, CA, USA, pp. 59-76, 2005, ACM, 1-59593-031-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
refinement, points-to analysis, demand-driven analysis, context-free language reachability |
26 | Yann Thierry-Mieg, Jean-Michel Ilié, Denis Poitrenaud |
A Symbolic Symbolic State Space Representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORTE ![In: Formal Techniques for Networked and Distributed Systems - FORTE 2004, 24th IFIP WG 6.1 International Conference, Madrid Spain, September 27-30, 2004, Proceedings, pp. 276-291, 2004, Springer, 3-540-23252-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Well-Formed Petri Nets, Symbolic Model-checking, Decision Diagrams, Symmetry Detection, Symbolic Reachability Graph |
26 | Annikka Aalto, Nisse Husberg, Kimmo Varpaaniemi |
Automatic Formal Model Generation and Analysis of SDL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SDL Forum ![In: SDL 2003: System Design, 11th International SDL Forum, Stuttgart, Germany, July 1-4, 2003. Proceedings, pp. 285-299, 2003, Springer. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
state space explosion problem, SDL, reachability analysis, high-level Petri nets |
26 | Ugo A. Buy, Gaurav Singal |
Toward Efficient Algorithms for Generating Compact Petri Nets from Labeled Transition Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: 26th International Computer Software and Applications Conference (COMPSAC 2002), Prolonging Software Life: Development and Redevelopment, 26-29 August 2002, Oxford, England, Proceedings, pp. 717-722, 2002, IEEE Computer Society, 0-7695-1727-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Petri net generation, Petri nets, concurrency, automatic verification, transition systems, reachability graph |
26 | Alain Finkel, Jérôme Leroux |
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings, pp. 145-156, 2002, Springer, 3-540-00225-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Presburger model checking, verification, acceleration, infinite-state systems, reachability set |
26 | Haoxun Chen, Hans-Michael Hanisch |
Analysis of Hybrid Systems Based on Hybrid Net Condition/Event System Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 11(1-2), pp. 163-185, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
condition /event systems, state reachability analysis, Petri nets, hybrid systems, modular modeling |
26 | Nisse Husberg, Teemu Tynjälä, Kimmo Varpaaniemi |
Modelling and Analysing the SDL Description of the ISDN-DSS1 Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICATPN ![In: Application and Theory of Petri Nets 2000, 21st International Conference, ICATPN 2000, Aarhus, Denmark, June 26-30, 2000, Proceeding, pp. 244-260, 2000, Springer, 3-540-67693-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
DSS1, SDL, reachability analysis, high-level Petri nets, protocol verification, ISDN |
26 | Fabiano Silva, Marcos A. Castilho, Luis Allan Künzle |
Petriplan: A New Algorithm for Plan Generation (Preliminary Report). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IBERAMIA-SBIA ![In: Advances in Artificial Intelligence, International Joint Conference, 7th Ibero-American Conference on AI, 15th Brazilian Symposium on AI, IBERAMIA-SBIA 2000, Atibaia, SP, Brazil, November 19-22, 2000, Proceedings, pp. 86-95, 2000, Springer, 3-540-41276-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Petri Nets, Integer Programming, Reachability, AI Planning |
26 | Jun Zhou, Kuo-Chung Tai |
Deadlock Analysis of Client/Server Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: Proceedings of the 20th International Conference on Distributed Computing Systems, Taipei, Taiwan, April 10-13, 2000, pp. 484-491, 2000, IEEE Computer Society, 0-7695-0601-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
client/server program, deadlock, labeled transition system, reachability graph |
26 | Mohamed Faouzi Atig, Tayssir Touili |
Verifying Parallel Programs with Dynamic Communication Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings, pp. 145-154, 2009, Springer, 978-3-642-02978-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Minh D. Nguyen, Max Thalmaier, Markus Wedler, Jörg Bormann, Dominik Stoffel, Wolfgang Kunz |
Unbounded Protocol Compliance Verification Using Interval Property Checking With Invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(11), pp. 2068-2082, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Vineet Kahlon |
Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent 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. 181-192, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Model Checking, Concurrent Programs, Dataflow Analysis, Parameterized Systems, Pushdown Systems |
26 | Dejvuth Suwimonteerabuth, Javier Esparza, Stefan Schwoon |
Symbolic Context-Bounded Analysis of Multithreaded Java Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 15th International SPIN Workshop, Los Angeles, CA, USA, August 10-12, 2008, Proceedings, pp. 270-287, 2008, Springer, 978-3-540-85113-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko |
Finer Is Better: Abstraction Refinement for Rewriting Approximations. ![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. 48-62, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Frantisek Galcík |
Centralized Communication in Radio Networks with Strong Interference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings, pp. 277-290, 2008, Springer, 978-3-540-69326-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Vesa Halava, Mika Hirvensalo |
Improved matrix pair undecidability results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 44(3-4), pp. 191-205, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Thomas Ball, Orna Kupferman, Mooly Sagiv |
Leaping Loops in the Presence of Abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings, pp. 491-503, 2007, Springer, 978-3-540-73367-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Giorgio Delzanno, Laurent Van Begin |
On the Dynamics of PB Systems with Volatile Membranes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Membrane Computing ![In: Membrane Computing, 8th International Workshop, WMC 2007, Thessaloniki, Greece, June 25-28, 2007 Revised Selected and Invited Papers, pp. 240-256, 2007, Springer, 978-3-540-77311-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Yohan Boichut, Thomas Genet |
Feasible Trace Reconstruction for Rewriting Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 123-135, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Yu Lei 0001, David Chenho Kung, Qizhi Ye |
A Blocking-Based Approach to Protocol Validation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC (1) ![In: 29th Annual International Computer Software and Applications Conference, COMPSAC 2005, Edinburgh, Scotland, UK, July 25-28, 2005. Volume 1, pp. 301-306, 2005, IEEE Computer Society, 0-7695-2413-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Venkatesh Mysore, Amir Pnueli |
Refining the Undecidability Frontier of Hybrid Automata. ![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. 261-272, 2005, Springer, 3-540-30495-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Marc Solé, Enric Pastor |
Evaluating Symbolic Traversal Algorithms Applied to Asynchronous Concurrent Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSD ![In: 4th International Conference on Application of Concurrency to System Design (ACSD 2004), 16-18 June 2004, Hamilton, Canada, pp. 207-216, 2004, IEEE Computer Society, 0-7695-2077-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Grégoire Sutre |
Software Verification with BLAST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 10th International SPIN Workshop. Portland, OR, USA, May 9-10, 2003, Proceedings, pp. 235-239, 2003, Springer, 3-540-40117-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Iovka Boneva, Jean-Marc Talbot |
When Ambients Cannot Be Opened. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings, pp. 169-184, 2003, Springer, 3-540-00897-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Martin Hirzel, Amer Diwan, Johannes Henkel |
On the usefulness of type and liveness accuracy for garbage collection and leak detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 24(6), pp. 593-624, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
liveness accuracy, type accuracy, program analysis, leak detection, Conservative garbage collection |
26 | Dmitri A. Dolgov, Edmund H. Durfee |
Satisficing strategies for resource-limited policy search in dynamic environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: The First International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2002, July 15-19, 2002, Bologna, Italy, Proceedings, pp. 1325-1332, 2002, ACM. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Martin Hirzel, Amer Diwan, Antony L. Hosking |
On the Usefulness of Liveness for Garbage Collection and Leak Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: ECOOP 2001 - Object-Oriented Programming, 15th European Conference, Budapest, Hungary, June 18-22, 2001, Proceedings, pp. 181-206, 2001, Springer, 3-540-42206-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | Andreas Hett, Christoph Scholl 0001, Bernd Becker 0001 |
Distance driven finite state machine traversal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 37th Conference on Design Automation, Los Angeles, CA, USA, June 5-9, 2000., pp. 39-42, 2000, ACM. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
26 | Catherine Dufourd, Alain Finkel |
Polynomial-Time Manz-One Reductions for Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 17th Conference, Kharagpur, India, December 18-20, 1997, Proceedings, pp. 312-326, 1997, Springer, 3-540-63876-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Hong Liu 0004, Raymond E. Miller |
Partial-Order Validation for Multi-Process Protocols Modeled as Communicating Finite State Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: 1996 International Conference on Network Protocols, ICNP 1996, October 29 - November 1, 1996, Columbus, Ohio, USA, pp. 76-83, 1996, IEEE Computer Society, 0-8186-7453-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Bengt Jonsson 0001, Lars Kempe |
Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 7th International Conference, Liège, Belgium, July, 3-5, 1995, Proceedings, pp. 42-53, 1995, Springer, 3-540-60045-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
26 | Peter Buchholz 0001 |
Hierarchical High Level Petri Nets for Complex System Analysis. ![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. 119-138, 1994, Springer, 3-540-58152-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Uriel Feige |
A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 499-507, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Rachid Hadjidj, Hanifa Boucheneb |
Efficient Reachability Analysis for Time Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 60(8), pp. 1085-1099, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
time Petri nets (TPN), state class spaces, reachability properties, model checking, Formal methods |
24 | Miroslav Svéda, Ondrej Rysavý, Gayan de Silva, Petr Matousek, Jaroslav Ráb |
Reachability Analysis in Dynamically Routed Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECBS ![In: 18th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, ECBS 2011, Las Vegas, NV, USA, 27-29 April, 2011, pp. 197-205, 2011, IEEE Computer Society, 978-1-4577-0065-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
network reachability, routing protocols, network design, IP-networks, network configuration |
24 | Parisa Heidari, Hanifa Boucheneb |
Efficient Method for Checking the Existence of a Safety/ Reachability Controller for Time Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSD ![In: 10th International Conference on Application of Concurrency to System Design, ACSD 2010, Braga, Portugal, 21-25 June 2010, pp. 201-210, 2010, IEEE Computer Society, 978-0-7695-4066-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
on-the-fly algorithm, reachability properties, time Petri nets, safety properties, controller synthesis |
24 | Amir R. Khakpour, Alex X. Liu |
Quantifying and Querying Network Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 2010 International Conference on Distributed Computing Systems, ICDCS 2010, Genova, Italy, June 21-25, 2010, pp. 817-826, 2010, IEEE Computer Society, 978-0-7695-4059-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Network Reachability, firewalls, network configuration, Access control lists, Network Access Control |
24 | Derrick Stolee, Chris Bourke, N. V. Vinodchandran |
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 131-138, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
acyclic digraph, logspace algorithm, planar graph, reachability |
24 | Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kramer |
Verification of Liveness Properties Using Compositional Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESEC / SIGSOFT FSE ![In: Software Engineering - ESEC/FSE '97, 6th European Software Engineering Conference Held Jointly with the 5th ACM SIGSOFT Symposium on Foundations of Software Engineering, Zurich, Switzerland, September 22-25, 1997, Proceedings, pp. 227-243, 1997, Springer, 3-540-63531-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Bu¨chi automata, reachability analysis, labelled transition systems, distributed computing systems, compositional verification, liveness properties |
24 | Amit Narayan, Adrian J. Isles, Jawahar Jain, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli |
Reachability analysis using partitioned-ROBDDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 388-393, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
ROBDD, Verification, Partitioning, Reachability, FSM, Symbolic, Sequential, Traversal |
24 | Felice Balarin |
Approximate reachability analysis of timed automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS '96), December 4-6, 1996, Washington, DC, USA, pp. 52-61, 1996, IEEE Computer Society, 0-8186-7689-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
approximate reachability analysis, unsafe states, incorrect system, discrete state components, real-time systems, formal verification, Boolean functions, computation, timed automata, finite automata, finite state automata, timing information |
24 | Miklós Ajtai, Ronald Fagin |
Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 358-367, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
efficiency of algorithms, undirected finite graphs, Ehrenfeucht-Fraisse games, directed graphs, reachability |
23 | Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamaric |
A low-level memory model and an accompanying reachability predicate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 11(2), pp. 105-116, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Colas Le Guernic, Antoine Girard |
Reachability Analysis of Hybrid Systems Using Support Functions. ![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. 540-554, 2009, Springer, 978-3-642-02657-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Alexander Markowetz, Yin Yang 0001, Dimitris Papadias |
Reachability Indexes for Relational Keyword Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 1163-1166, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Kristoffer Arnsfelt Hansen, Michal Koucký 0001, Peter Bro Miltersen |
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. ![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. 332-341, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Radu Grosu |
Finite Automata as Time-Inv Linear Systems Observability, Reachability and More. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 12th International Conference, HSCC 2009, San Francisco, CA, USA, April 13-15, 2009. Proceedings, pp. 194-208, 2009, Springer, 978-3-642-00601-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Bakhadyr Khoussainov, Jiamou Liu, Imran Khaliq |
A Dynamic Algorithm for Reachability Games Played on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 477-488, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Thomas Thierauf, Fabian Wagner |
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings, pp. 323-334, 2009, Springer, 978-3-642-03408-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Ehab Al-Shaer, Wilfredo Marrero, Adel El-Atawy, Khalid Elbadawi |
Network Configuration in A Box: Towards End-to-End Verification of Network Reachability and Security. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Proceedings of the 17th annual IEEE International Conference on Network Protocols, 2009. ICNP 2009, Princeton, NJ, USA, 13-16 October 2009, pp. 123-132, 2009, IEEE Computer Society, 978-1-4244-4634-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Silvio do Lago Pereira, Leliane Nunes de Barros |
A logic-based agent that plans for extended reachability goals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Auton. Agents Multi Agent Syst. ![In: Auton. Agents Multi Agent Syst. 16(3), pp. 327-344, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Model checking, Temporal logic, Automated planning |
23 | Zhijun Ding, Changjun Jiang, MengChu Zhou |
Deadlock Checking for One-Place Unbounded Petri Nets Based on Modified Reachability Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part B ![In: IEEE Trans. Syst. Man Cybern. Part B 38(3), pp. 881-883, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Anthony Widjaja To, Leonid Libkin |
Recurrent Reachability Analysis in Regular Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings, pp. 198-213, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Yangjun Chen |
On the Evaluation of Large and Sparse Graph Reachability Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 19th International Conference, DEXA 2008, Turin, Italy, September 1-5, 2008. Proceedings, pp. 97-105, 2008, Springer, 978-3-540-85653-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Sumit Kumar Jha 0001 |
d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata. ![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. 618-621, 2008, Springer, 978-3-540-78928-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Antoine Girard, Colas Le Guernic |
Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis. ![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. 215-228, 2008, Springer, 978-3-540-78928-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Jerry Ding, Jonathan Sprinkle, S. Shankar Sastry, Claire J. Tomlin |
Reachability calculations for automated aerial refueling. ![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. 3706-3712, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Alessandro Abate, Maria Prandini, John Lygeros, Shankar Sastry 0001 |
An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid 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. 4018-4023, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Naoki Tateishi, Mitsuho Tahara, Yu Miyoshi, Souhei Majima |
Methods for Rapidly Testing Node Reachability with Congestion Control and Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APNOMS ![In: Challenges for Next Generation Network Operations and Service Management, 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Beijing, China, October 22-24, 2008. Proceedings, pp. 491-494, 2008, Springer, 978-3-540-88622-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Luis I. Aguirre-Salas, Alejandra Santoyo-Sanchez |
Observability analysis of interpreted Petri nets under partial state observations using estimations reachability graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ETFA ![In: Proceedings of 13th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2008, September 15-18, 2008, Hamburg, Germany, pp. 129-136, 2008, IEEE, 1-4244-1505-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic 0001, Michal Rutkowski |
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, 6th International Conference, FORMATS 2008, Saint Malo, France, September 15-17, 2008. Proceedings, pp. 63-77, 2008, Springer, 978-3-540-85777-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Warren Schudy |
Finding strongly connected components in parallel using o(log2n) reachability queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008, pp. 146-151, 2008, ACM, 978-1-59593-973-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
transitive closure bottleneck, parallel algorithms, graph algorithms, strongly connected components, topological sort |
23 | Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin 0001, Haixun Wang, Philip S. Yu |
Fast computing reachability labelings for large graphs with high compression rate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2008, 11th International Conference on Extending Database Technology, Nantes, France, March 25-29, 2008, Proceedings, pp. 193-204, 2008, ACM, 978-1-59593-926-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Chao Wang 0001, Zijiang Yang 0006, Aarti Gupta, Franjo Ivancic |
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings, pp. 352-365, 2007, Springer, 978-3-540-73367-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Sean Safarpour, Andreas G. Veneris, Hratch Mangassarian |
Trace Compaction using SAT-based Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 12th Conference on Asia South Pacific Design Automation, ASP-DAC 2007, Yokohama, Japan, January 23-26, 2007, pp. 932-937, 2007, IEEE Computer Society, 1-4244-0629-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Sumit Kumar Jha 0001, Bruce H. Krogh, James E. Weimer, Edmund M. Clarke |
Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction. ![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. 287-300, 2007, Springer, 978-3-540-71492-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Matthew Hague, C.-H. Luke Ong |
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings, pp. 213-227, 2007, Springer, 978-3-540-71388-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding |
Cost-Based Query Optimization for Multi Reachability Joins. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Advances in Databases: Concepts, Systems and Applications, 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007, Bangkok, Thailand, April 9-12, 2007, Proceedings, pp. 18-30, 2007, Springer, 978-3-540-71702-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamaric |
A Reachability Predicate for Analyzing Low-Level Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 13th International Conference, TACAS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007 Braga, Portugal, March 24 - April 1, 2007, Proceedings, pp. 19-33, 2007, Springer, 978-3-540-71208-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Guillem Godoy, Eduard Huntingford |
Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings, pp. 184-199, 2007, Springer, 978-3-540-73447-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Antonio de la Oliva, Marcelo Bagnulo, Alberto García-Martínez, Ignacio Soto |
Performance Analysis of the REAchability Protocol for IPv6 Multihoming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NEW2AN ![In: Next Generation Teletraffic and Wired/Wireless Advanced Networking, 7th International Conference, NEW2AN 2007, St. Petersburg, Russia, September 10-14, 2007, Proceedings, pp. 443-454, 2007, Springer, 978-3-540-74832-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
REAP, failure detection, multihoming, SHIM6 |
23 | Susmit Jha, Bryan A. Brady, Sanjit A. Seshia |
Symbolic Reachability Analysis of Lazy Linear Hybrid Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, 5th International Conference, FORMATS 2007, Salzburg, Austria, October 3-5, 2007, Proceedings, pp. 241-256, 2007, Springer, 978-3-540-75453-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Bogdan Aman, Gabriel Ciobanu |
On the Reachability Problem in P Systems with Mobile Membranes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Membrane Computing ![In: Membrane Computing, 8th International Workshop, WMC 2007, Thessaloniki, Greece, June 25-28, 2007 Revised Selected and Invited Papers, pp. 113-123, 2007, Springer, 978-3-540-77311-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Husain Aljazzar, Stefan Leue |
Extended Directed Search for Probabilistic Timed Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings, pp. 33-51, 2006, Springer, 3-540-45026-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Yacine Zemali |
Controlled Reachability Analysis in AI Planning: Theory and Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KI ![In: KI 2005: Advances in Artificial Intelligence, 28th Annual German Conference on AI, KI 2005, Koblenz, Germany, September 11-14, 2005, Proceedings, pp. 264-278, 2005, Springer, 3-540-28761-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer, David L. Dill |
A New Reachability Algorithm for Symmetric Multi-processor Architecture. ![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. 26-38, 2005, Springer, 3-540-29209-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Fuzhi Wang, Marta Z. Kwiatkowska |
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata. ![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. 385-399, 2005, Springer, 3-540-29209-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, Siddharth Srivastava 0001, Greta Yorsh |
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings, pp. 99-115, 2005, Springer, 3-540-28005-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Domenico Cantone, Calogero G. Zarba |
A Tableau-Based Decision Procedure for a Fragment of Graph Theory Involving Reachability and Acyclicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2005, Koblenz, Germany, September 14-17, 2005, Proceedings, pp. 93-107, 2005, Springer, 3-540-28931-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Atsushi Ohta, Kohkichi Tsuji, Tomiji Hisamura |
Minimal time reachability problem of some subclasses of timed Petri nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (1) ![In: International Symposium on Circuits and Systems (ISCAS 2005), 23-26 May 2005, Kobe, Japan, pp. 760-763, 2005, IEEE, 0-7803-8834-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Prasanna Thati, José Meseguer 0001 |
Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALCO ![In: Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings, pp. 379-394, 2005, Springer, 3-540-28620-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim |
Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Proceedings, pp. 112-126, 2004, Springer, 3-540-21836-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Gianfranco Ciardo |
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICATPN ![In: Applications and Theory of Petri Nets 2004, 25th International Conference, ICATPN 2004, Bologna, Italy, June 21-25, 2004, Proceedings, pp. 17-34, 2004, Springer, 3-540-22236-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Rajeev Alur, Mikhail Bernadsky, P. Madhusudan |
Optimal Reachability for Weighted Timed Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 122-133, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Alexei Lisitsa 0001, Igor Potapov |
Membership and Reachability Problems for Row-Monomial Transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 623-634, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Thomas Bourdeaud'huy, Pascal Yim, Saïd Hanafi |
Efficient reachability analysis of bounded Petri nets using constraint programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC (2) ![In: Proceedings of the IEEE International Conference on Systems, Man & Cybernetics: The Hague, Netherlands, 10-13 October 2004, pp. 1870-1875, 2004, IEEE, 0-7803-8566-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Olfa Belkahla Driss, Pascal Yim, Ouajdi Korbaa, Khaled Ghédira |
Reachability search in timed Petri nets using constraint programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC (5) ![In: Proceedings of the IEEE International Conference on Systems, Man & Cybernetics: The Hague, Netherlands, 10-13 October 2004, pp. 4923-4928, 2004, IEEE, 0-7803-8566-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Wee Kheng Leow, Siau-Cheng Khoo, Tiong Hoe Loh, Vivy Suhendra |
Heuristic Search with Reachability Tests for Automated Generation of Test Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: 19th IEEE International Conference on Automated Software Engineering (ASE 2004), 20-25 September 2004, Linz, Austria, pp. 282-285, 2004, IEEE Computer Society, 0-7695-2131-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Ahmed Bouajjani, Antoine Meyer |
Symbolic Reachability Analysis of Higher-Order Context-Free Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings, pp. 135-147, 2004, Springer, 3-540-24058-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Yang 0006, Marek A. Perkowski |
Quantum logic synthesis by symbolic reachability analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 41th Design Automation Conference, DAC 2004, San Diego, CA, USA, June 7-11, 2004, pp. 838-841, 2004, ACM, 1-58113-828-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
model checking, formal verification, quantum computing, satisfiability, reversible logic |
23 | Ashish Tiwari 0001 |
Approximate Reachability for Linear Systems. ![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. 514-525, 2003, Springer, 3-540-00913-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Ventsi G. Rumchev |
Positive Linear Systems Reachability Criterion in Digraph Form. ![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. 241-248, 2003, Springer, 3-540-40342-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Agata Pólrola, Wojciech Penczek, Maciej Szreter |
Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. ![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. 2-17, 2003, Springer, 3-540-21671-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick |
Reachability and distance queries via 2-hop labels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 937-946, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
23 | Ehab Al-Shaer, Yongning Tang |
SMRM: SNMP-based multicast reachability monitoring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NOMS ![In: Management Solutions for the New Communications World, 8th IEEE/IFIP Network Operations and Management Symposium, NOMS 2002, Florence, Italy, April 15-19, 2002. Proceedings, pp. 467-482, 2002, IEEE, 0-7803-7383-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Catalin Dima |
Computing Reachability Relations in Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings, pp. 177-, 2002, IEEE Computer Society, 0-7695-1483-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Inseok Hwang 0002, Hamsa Balakrishnan, Ronojoy Ghosh, Claire J. Tomlin |
Reachability Analysis of Delta-NotchLateral Inhibition Using Predicate Abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2002, 9th International Conference, Bangalore, India, December 18-21, 2002, Proceedings, pp. 715-724, 2002, Springer, 3-540-00303-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #300 of 5162 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|