|
|
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 |
17 | Thomas Colcombet |
On Families of Graphs Having a Decidable First Order Theory with Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 98-109, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
17 | Rajeev Alur, Thao Dang 0001, Franjo Ivancic |
Reachability Analysis of Hybrid Systems via Predicate Abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 5th International Workshop, HSCC 2002, Stanford, CA, USA, March 25-27, 2002, Proceedings, pp. 35-48, 2002, Springer, 3-540-43321-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
17 | Michel Bidoit, Rolf Hennicker |
On the Integration of Observability and Reachability Concepts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings, pp. 21-36, 2002, Springer, 3-540-43366-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
17 | Jakob Rehof, Manuel Fähndrich |
Type-base flow analysis: from polymorphic subtyping to CFL-reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, London, UK, January 17-19, 2001, pp. 54-66, 2001, ACM, 1-58113-336-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
17 | Tak-John Koo, George J. Pappas, Shankar Sastry 0001 |
Mode Switching Synthesis for Reachability Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 4th International Workshop, HSCC 2001, Rome, Italy, March 28-30, 2001, Proceedings, pp. 333-346, 2001, Springer, 3-540-41866-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
17 | Dirk Beyer 0001 |
Efficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHARME ![In: Correct Hardware Design and Verification Methods, 11th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2001, Livingston, Scotland, UK, September 4-7, 2001, Proceedings, pp. 86-91, 2001, Springer, 3-540-42541-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Real-time systems, Formal verification, Timed Automata |
17 | Sherief Reda, Ayman Wahba, Ashraf Salem, Dominique Borrione, M. Ghonaimy |
On the use of don't cares during symbolic reachability analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (5) ![In: Proceedings of the 2001 International Symposium on Circuits and Systems, ISCAS 2001, Sydney, Australia, May 6-9, 2001, pp. 121-124, 2001, IEEE, 0-7803-6685-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
17 | Gianpiero Cabodi, Paolo Camurati, Stefano Quer |
Improving symbolic reachability analysis by means of activityprofiles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(9), pp. 1065-1075, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
17 | Alexander B. Kurzhanski, Pravin Varaiya |
Ellipsoidal Techniques for Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000, Proceedings, pp. 202-214, 2000, Springer, 3-540-67259-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
17 | Parosh Aziz Abdulla, Per Bjesse, Niklas Eén |
Symbolic Reachability Analysis Based on SAT-Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for Construction and Analysis of Systems, 6th International Conference, TACAS 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings, pp. 411-425, 2000, Springer, 3-540-67282-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
17 | Oscar H. Ibarra, Tevfik Bultan, Jianwen Su |
Reachability Analysis for Some Models of Infinite-State Transition Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings, pp. 183-198, 2000, Springer, 3-540-67897-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
17 | Roberto M. Amadio, Denis Lugiez |
On the Reachability Problem in Cryptographic Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings, pp. 380-394, 2000, Springer, 3-540-67897-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
verification, cryptographic protocols, symbolic computation |
17 | Piotr Chrzastowski-Wachtel |
Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem. ![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. 268-281, 1999, Springer, 3-540-66132-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
17 | Nisse Husberg, Tapio Manner |
Emma: Developing an Industrial Reachability Analyser for SDL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
World Congress on Formal Methods ![In: FM'99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume I, pp. 642-661, 1999, Springer, 3-540-66587-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
17 | Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes |
Decidable Fragments of Simultaneous Rigid Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 250-260, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
17 | In-Ho Moon, James H. Kukula, Thomas R. Shiple, Fabio Somenzi |
Least fixpoint approximations for reachability analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design, 1999, San Jose, California, USA, November 7-11, 1999, pp. 41-44, 1999, IEEE Computer Society, 0-7803-5832-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
17 | Keijo Heljanko |
Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings, pp. 240-254, 1999, Springer, 3-540-65703-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
17 | Stavros Tripakis |
Timed Diagnostics for Reachability Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings, pp. 59-73, 1999, Springer, 3-540-65703-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
17 | Sameer Sharma, Michael S. Hsiao |
Partial Scan Using Multi-Hop State Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 17th IEEE VLSI Test Symposium (VTS '99), 25-30 April 1999, San Diego, CA, USA, pp. 121-127, 1999, IEEE Computer Society, 0-7695-0146-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
17 | Conrado Daws, Stavros Tripakis |
Model Checking of Real-Time Reachability Properties Using Abstractions. ![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. 313-329, 1998, Springer, 3-540-64356-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
17 | Michael S. Hsiao, Gurjeet S. Saund, Elizabeth M. Rudnick, Janak H. Patel |
Partial Scan Selection Based on Dynamic Reachability and Observability Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 11th International Conference on VLSI Design (VLSI Design 1991), 4-7 January 1998, Chennai, India, pp. 174-180, 1998, IEEE Computer Society, 0-8186-8224-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
test generation, DFT, partial scan |
17 | Shankar G. Govindaraju, David L. Dill, Alan J. Hu, Mark Horowitz |
Approximate Reachability with BDDs Using Overlapping Projections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 35th Conference on Design Automation, Moscone center, San Francico, California, USA, June 15-19, 1998., pp. 451-456, 1998, ACM Press, 0-89791-964-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
transceiver, spread spectrum communication, RF CMOS, digital radio, ISM frequency band |
17 | Burkhard Graves |
Computing Reachability Properties Hidden in Finite Net Unfoldings. ![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. 327-341, 1997, Springer, 3-540-63876-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
17 | Peter Kemper |
Reachability Analysis Based on Structured Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Application and Theory of Petri Nets ![In: Application and Theory of Petri Nets 1996, 17th International Conference, Osaka, Japan, June 24-28, 1996, Proceedings, pp. 269-288, 1996, Springer, 3-540-61363-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
17 | Gianpiero Cabodi, Paolo Camurati, Stefano Quer |
Improved reachability analysis of large finite state machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10-14, 1996, pp. 354-360, 1996, IEEE Computer Society / ACM, 0-8186-7597-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Sequential Logic Synthesis and Verification |
17 | Shin'ichi Nagano, Yoshinori Hatakeyama, Yoshiaki Kakuda, Tohru Kikuno |
Timed Reachability Analysis Method for EFSM-based Communication Protocols and Its Experimental Evaluation. ![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. 92-, 1996, IEEE Computer Society, 0-8186-7453-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
17 | Thomas W. Reps, Susan Horwitz, Shmuel Sagiv |
Precise Interprocedural Dataflow Analysis via Graph Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, January 23-25, 1995, pp. 49-61, 1995, ACM Press, 0-89791-692-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
C |
17 | Hong Liu 0004, Raymond E. Miller |
Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: 1995 International Conference on Network Protocols, ICNP 1995, November 7-10, 1995, Tokyo, Japan, pp. 6-13, 1995, IEEE Computer Society, 0-8186-7216-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
17 | Angelo Monti, Alessandro Roncato |
On the Complexity of Some Reachability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings, pp. 192-202, 1994, Springer, 3-540-57811-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
17 | Jörg Desel, Javier Esparza |
Shortest Paths in Reachability Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Application and Theory of Petri Nets ![In: Application and Theory of Petri Nets 1993, 14th International Conference, Chicago, Illinois, USA, June 21-25, 1993, Proceedings, pp. 224-241, 1993, Springer, 3-540-56863-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
17 | Jörg Desel, Javier Esparza |
Reachability in Reversible Free Choice Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings, pp. 384-397, 1991, Springer, 3-540-53709-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
17 | Aline Deruyver, Rémi Gilleron |
The Reachability Problem for Ground TRS and Some Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT, Vol.1 ![In: TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'89), pp. 227-243, 1989, Springer, 3-540-50939-9. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
17 | Heiko Krumm |
Projections of the Reachability Graph and Environment Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Automatic Verification Methods for Finite State Systems ![In: Automatic Verification Methods for Finite State Systems, International Workshop, Grenoble, France, June 12-14, 1989, Proceedings, pp. 89-96, 1989, Springer, 3-540-52148-8. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
17 | J. L. Lambert |
Some Consequences of the Decidability of the Reachability Problem for Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
European Workshop on Applications and Theory of Petri Nets ![In: Advances in Petri Nets 1988, covers the 8th European Workshop on Applications and Theory of Petri Nets, held in Zaragoza, Spain in June 1987, selected papers, pp. 266-282, 1987, Springer, 3-540-50580-6. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
17 | Horst Müller |
The reachability problem for VAS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
European Workshop on Applications and Theory in Petri Nets ![In: Advances in Petri Nets 1984, European Workshop on Applications and Theory in Petri Nets, covers the last two years which include the workshop 1983 in Toulouse and the workshop 1984 in Aarhus, selected papers, pp. 376-391, 1984, Springer, 3-540-15204-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
17 | Greg Nelson |
Verifying Reachability Invariants of Linked Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 1983, pp. 38-47, 1983, ACM Press, 0-89791-090-7. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
17 | Horst Müller |
Reachability Analysis with Assertion Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theoretical Computer Science ![In: Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings, pp. 214-223, 1981, Springer, 3-540-10576-X. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
13 | Jiefeng Cheng, Jeffrey Xu Yu, Philip S. Yu |
Graph Pattern Matching: A Join/Semijoin Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 23(7), pp. 1006-1021, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
2-hop labeling, reachability joins, join/semijoin processing, Graph matching |
13 | Ernst Moritz Hahn, Gethin Norman, David Parker 0001, Björn Wachter, Lijun Zhang 0001 |
Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QEST ![In: Eighth International Conference on Quantitative Evaluation of Systems, QEST 2011, Aachen, Germany, 5-8 September, 2011, pp. 69-78, 2011, IEEE Computer Society, 978-1-4577-0973-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
probabilistic hybrid systems, probabilistic reachability, long-run average, abstraction refinement, stochastic games, controller synthesis |
13 | Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate |
Adaptive Gridding for Abstraction and Verification of Stochastic Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QEST ![In: Eighth International Conference on Quantitative Evaluation of Systems, QEST 2011, Aachen, Germany, 5-8 September, 2011, pp. 59-68, 2011, IEEE Computer Society, 978-1-4577-0973-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
Stochastic Hybrid Systems, Reachability and Safety, Approximations, Markov Chains, Abstractions |
13 | Yunhuai Liu, Qian Zhang 0001, Lionel M. Ni |
Opportunity-Based Topology Control in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 21(3), pp. 405-416, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Topology control transitional region network reachability |
13 | Richard H. Carver, Jeff Yu Lei |
A Stateful Approach to Testing Monitors in Multithreaded Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HASE ![In: 12th IEEE High Assurance Systems Engineering Symposium, HASE 2010, San Jose, CA, USA, November 3-4, 2010, pp. 54-63, 2010, IEEE Computer Society, 978-1-4244-9091-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
monitor, concurrent programming, reachability testing |
13 | Muneer Masadeh, Sanabel Fathi Nimer, Ahmed Yassin Al-Dubai |
The Effects of Network Density of a New Counter-based Broadcasting Scheme in Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: 10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, West Yorkshire, UK, June 29-July 1, 2010, pp. 1462-1467, 2010, IEEE Computer Society, 978-0-7695-4108-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Counter-based, Broadcast storm problem, Delivery ratio, MANETs, Broadcast, Flooding, Reachability |
13 | Arunabha Sen, Sujogya Banerjee, Pavel Ghosh, Sudheendra Murthy, Hung Q. Ngo 0001 |
Brief announcement: on regenerator placement problems in optical networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pp. 178-180, 2010, ACM, 978-1-4503-0079-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
regenerator placement, optical networks, lightpath, reachability graph |
13 | Zijiang Yang 0006, Chao Wang 0001, Aarti Gupta, Franjo Ivancic |
Model checking sequential software programs via mixed symbolic analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 14(1), pp. 10:1-10:26, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
composite symbolic formula, Model checking, binary decision diagram, reachability analysis, presburger arithmetic, image computation |
13 | Jonathan Billington, Cong Yuan |
On Modelling and Analysing the Dynamic MANET On-Demand (DYMO) Routing Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Petri Nets Other Model. Concurr. ![In: Transactions on Petri Nets and Other Models of Concurrency III, pp. 98-126, 2009, Springer, 978-3-642-04854-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
DYMO, MANETs, Coloured Petri Nets, Reachability Analysis, On-Demand Routing |
13 | Jonathan Billington, Somsak Vanit-Anunchai, Guy Edward Gallasch |
Parameterised Coloured Petri Net Channel Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Petri Nets Other Model. Concurr. ![In: Transactions on Petri Nets and Other Models of Concurrency III, pp. 71-97, 2009, Springer, 978-3-642-04854-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Parameterized Protocol Channel Models, Datagram Congestion Control Protocol, Coloured Petri Nets, Reachability Analysis |
13 | Antti Valmari |
Bisimilarity Minimization in O(m logn) Time. ![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. 123-142, 2009, Springer, 978-3-642-02423-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Analysis of reachability graphs, verification of systems |
13 | Hassan Reza, Malvika Pimple, Varun Krishna, Jared Hildle |
A Safety Analysis Method Using Fault Tree Analysis and Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Sixth International Conference on Information Technology: New Generations, ITNG 2009, Las Vegas, Nevada, USA, 27-29 April 2009, pp. 1089-1094, 2009, IEEE Computer Society, 978-0-7695-3596-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
forward and backward reachability analysis, Petri nets, safety critical systems, fault tree analysis |
13 | Ramzi Ben Salah, Marius Bozga, Oded Maler |
Compositional timing analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMSOFT ![In: Proceedings of the 9th ACM & IEEE International conference on Embedded software, EMSOFT 2009, Grenoble, France, October 12-16, 2009, pp. 39-48, 2009, ACM, 978-1-60558-627-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
compositional generation, abstraction, timed automata, reachability analysis |
13 | Klaus Seyerlehner, Arthur Flexer, Gerhard Widmer |
On the limitations of browsing top-N recommender systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RecSys ![In: Proceedings of the 2009 ACM Conference on Recommender Systems, RecSys 2009, New York, NY, USA, October 23-25, 2009, pp. 321-324, 2009, ACM, 978-1-60558-435-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
catalog coverage, top-N recommender systems, browsing, reachability, long tail |
13 | Yasmina Abdeddaïm, Eugene Asarin, Mihaela Sighireanu |
Simple Algorithm for Simple Timed Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TIME ![In: TIME 2009, 16th International Symposium on Temporal Representation and Reasoning, Bressanone-Brixen, Italy, 23-25 July 2009, Proceedings, pp. 99-106, 2009, IEEE Computer Society, 978-0-7695-3727-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
reachability games, temporal uncertainity, timed game automata, STNU |
13 | Ioannis Krommidas, Christos D. Zaroliagis |
An experimental study of algorithms for fully dynamic transitive closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 1.6:1-1.6:22, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
reachability, Transitive closure, dynamic algorithm, path |
13 | Isil Dillig, Thomas Dillig, Eran Yahav, Satish Chandra 0001 |
The CLOSER: automating resource management in java. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 7th International Symposium on Memory Management, ISMM 2008, Tucson, AZ, USA, June 7-8, 2008, pp. 1-10, 2008, ACM, 978-1-60558-134-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
higher-level resource, interest reachability, logical liveness, resource interest graph, resource management |
13 | Shuvendu K. Lahiri, Shaz Qadeer |
Back to the future: revisiting precise program verification using SMT solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008, pp. 171-182, 2008, ACM, 978-1-59593-689-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
heap-manipulating programs, software verification, decision procedures, reachability, linked lists, SMT solvers |
13 | Sukanta Das, Biplab K. Sikdar |
Characterization of Non-reachable States in Irreversible CAState Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACRI ![In: Cellular Automata, 8th International Conference on Cellular Aotomata for Reseach and Industry, ACRI 2008, Yokohama, Japan, September 23-26, 2008. Proceedings, pp. 160-167, 2008, Springer, 978-3-540-79991-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Irreversible CA, non-reachable states, reachability tree, attractor |
13 | Chao Wang 0001, Zijiang Yang 0006, Franjo Ivancic, Aarti Gupta |
Disjunctive image computation for software verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 12(2), pp. 10, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Model checking, formal verification, binary decision diagram, reachability analysis, image computation |
13 | Gary Wassermann, Carl Gould 0001, Zhendong Su 0001, Premkumar T. Devanbu |
Static checking of dynamically generated queries in database applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Softw. Eng. Methodol. ![In: ACM Trans. Softw. Eng. Methodol. 16(4), pp. 14, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
database queries, JDBC, Static checking, context-free language reachability |
13 | Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina |
Parametric probabilistic transition systems for system design and analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 19(1), pp. 93-109, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Probabilistic non-repudiation protocol, Reachability, Parameters, Discrete-time Markov chains |
13 | David Greenfieldboyce, Jeffrey S. Foster |
Type qualifier inference for java. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA ![In: Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2007, October 21-25, 2007, Montreal, Quebec, Canada, pp. 321-336, 2007, ACM, 978-1-59593-786-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
JQual, field-sensitivity, opaque, java, tracked, transparent, context-sensitivity, type qualifiers, readonly, mutable, context-free language reachability |
13 | Alexandre Hamez, Fabrice Kordon, Yann Thierry-Mieg, Fabrice Legond-Aubry |
dmcG : A Distributed Symbolic Model Checker Based on GreatSPN. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICATPN ![In: Petri Nets and Other Models of Concurrency - ICATPN 2007, 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings, pp. 495-504, 2007, Springer, 978-3-540-73093-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
GreatSPN, Distributed Model Checking, Symbolic Reachability Graph |
13 | Satoshi Yamane |
Theory and Practice of Probabilistic Timed Game for Embedded Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICESS ![In: Embedded Software and Systems, [Third] International Conference, ICESS 2007, Daegu, Korea, May 14-16, 2007, Proceedings, pp. 109-120, 2007, Springer, 978-3-540-72684-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
game-theoretic approach, probabilistic timed game automaton, reachability game, formal specification, formal verification |
13 | Kimmo Varpaaniemi |
On Stubborn Sets in the Verification of Linear Time Temporal Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 26(1), pp. 45-67, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
reduced state space generation, stubborn sets, verification of LTL formulas, reachability analysis |
13 | Gianpiero Cabodi, Sergio Nocco, Stefano Quer |
Are BDDs still alive within sequential verification? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 7(2), pp. 129-142, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Approximate-reachability, Model checking, Binary Decision Diagrams, Satisfiability solvers |
13 | Biplab K. Sikdar, Samir Roy, Debesh K. Das |
A Degree-of-Freedom Based Synthesis Scheme for Sequential Machines with Enhanced BIST Quality and Reduced Area. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 21(1), pp. 83-93, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
emitability, FSM state encoding, reachability, degree-of-freedom |
13 | Biplab K. Sikdar, Arijit Sarkar, Samir Roy, Debesh K. Das |
Synthesis of Testable Finite State Machine Through Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 14th Asian Test Symposium (ATS 2005), 18-21 December 2005, Calcutta, India, pp. 398-403, 2005, IEEE Computer Society, 0-7695-2481-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
emitability, FSM state encoding, decomposition, reachability, degree-of-freedom |
13 | Jean-François Couchot, Alain Giorgetti, Nikolai Kosmatov |
A uniform deductive approach for parameterized protocol safety. ![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. 364-367, 2005, ACM, 1-58113-993-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
generalized substitutions, safety, assertion, symbolic model checking, reachability |
13 | Rajeev Alur, Sampath Kannan, Salvatore La Torre |
Polyhedral Flows in Hybrid Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 24(3), pp. 261-280, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
polyhedral dynamics, hybrid systems, reachability analysis |
13 | HoonSang Jin, Kavita Ravi, Fabio Somenzi |
Fate and free will in error traces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 6(2), pp. 102-116, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Reachability game, Model checking, Counterexample |
13 | Gwan-Hwan Hwang, Sheng-Jen Chang, Huey-Der Chu |
Technology for Testing Nondeterministic Client/Server Database Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 30(1), pp. 59-77, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
database management system, Concurrent programming, client/server, reachability testing |
13 | Amit M. Paradkar, Tim Klinger |
Automated Consistency and Completeness Checking of Testing Models for Interactive Systems. ![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. 342-348, 2004, IEEE Computer Society, 0-7695-2209-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Completeness Checking, Reachability, Consistency Checking |
13 | Hsu-Chun Yen, Lien-Po Yu |
Dependability Analysis of a Class of Probabilistic Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRDC ![In: 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), 3-5 March 2004, Papeete, Tahiti, pp. 373-380, 2004, IEEE Computer Society, 0-7695-2076-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
probabilistic Petri net, verification, Controllability, self-stabilization, reachability |
13 | Glenn Bruns, Satish Chandra 0001 |
Searching for Points-To Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 29(10), pp. 883-897, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
model checking, program analysis, reachability analysis, Points-to analysis |
13 | Ian M. Mitchell, Claire J. Tomlin |
Overapproximating Reachable Sets by Hamilton-Jacobi Projections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 19(1-3), pp. 323-346, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
verification, projection, reachability, Hamilton-Jacobi equation |
13 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 117-123, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
BFS tree, decremental, reachability |
13 | Eric Y. T. Juan, Jeffrey J. P. Tsai, Tadao Murata, Yi Zhou |
Reduction Methods for Real-Time Systems Using Delay Time Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 27(5), pp. 422-448, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
net reduction, schedule, Real-time systems, Petri nets, deadlock, reachability, state explosion |
13 | Inhye Kang, Insup Lee 0001, Young-Si Kim |
An Efficient State Space Generation for the Analysis of Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 26(5), pp. 453-477, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
real-time systems analysis, state space minimization, Formal specification, timed automata, reachability analysis |
13 | Ireneusz Sierocki |
A Feedback Transformation of the Planning Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 9(3), pp. 193-209, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Planning problem, Reachability structure, Transformation, Feedback, Representation, Decomposition, Problem complexity |
13 | Ge-Ming Chiu, Kai-Shung Chen |
Efficient Fault-Tolerant Multicast Scheme for Hypercube Multicomputers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(10), pp. 952-962, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
routing capability, Fault tolerance, multicast, hypercubes, reachability, time optimality |
13 | Steven Gordon, Jonathan Billington |
Analysing a Missile Simulator with Coloured Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 2(2), pp. 144-159, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Missile simulator design, Simulation, Distributed systems, Coloured Petri nets, Reachability analysis |
13 | Gianpiero Cabodi, Paolo Camurati, Stefano Quer |
Auxiliary variables for BDD-based representation and manipulation of Boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 3(3), pp. 309-340, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
finite state machines, binary decision diagrams, reachability analysis, functional decompositions |
13 | William Chan 0001, Richard J. Anderson, Paul Beame, David Notkin |
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1998, Clearwater Beach, Florida, USA, March 2-5, 1998, pp. 102-112, 1998, ACM, 0-89791-971-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
TCAS II, partitioned transition relation, system requirements specification, formal verification, abstraction, binary decision diagrams, statecharts, reachability analysis, symbolic model checking, RSML |
13 | Marc Abrams |
An Example of Deriving Performance Properties from a Visual Representation of Program Execution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 8(6), pp. 658-666, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
timed progress graphs, performance evaluation, visualization, Petri nets, Parallel computation, computational geometry, mutual exclusion, reachability analysis, ray shooting |
13 | Patrice Godefroid, Doron A. Peled, Mark G. Staskauskas |
Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 22(7), pp. 496-507, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Formal methods, validation, concurrent programs, reachability analysis, automatic verification, partial-order methods |
13 | Peter Kemper |
Numerical Analysis of Superposed GSPNs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 22(9), pp. 615-628, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
superposed GSPN, numerical solution algorithm for steady-state analysis tensor/Kronecker algebra, Markov process, decomposition, reachability analysis, Stochastic Petri net, structured representation |
13 | Amit Konar, Ajit K. Mandal |
Uncertainty Management in Expert Systems Using Fuzzy Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 8(1), pp. 96-105, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
fuzzy belief, limitcycles, stability, expert systems, belief revision, nonmonotonic reasoning, reachability, Belief propagation, fuzzy Petri nets, uncertainty management |
13 | Matthew Andrews, Michael A. Bender, Lisa Zhang |
New Algorithms for the Disk Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 550-559, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
disk I/O performance, convex reachability function, disk head, 3/2-approximation algorithm, optimal tour, head scheduling, scheduling, polynomial time, disk scheduling, asymmetric Traveling Salesman Problem |
13 | Thomas W. Reps, Genevieve Rosay |
Precise Interprocedural Chopping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGSOFT FSE ![In: Proceedings of the Third ACM SIGSOFT Symposium on Foundations of Software Engineering, SIGSOFT 1995, Washington, DC, USA, October 10-13, 1995, pp. 41-52, 1995, ACM, 978-0-89791-716-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
graph reachability, program chopping, realizable path, debugging, program slicing, interprocedural analysis, program dependence graph |
13 | Shing-Chi Cheung, Jeff Kramer |
Tractable Dataflow Analysis for Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(8), pp. 579-593, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
action dependency, history sets, pump control system, arbitrary loops, nondeterministic structures, synchronous communicating systems, distributed systems, software engineering, static analysis, distributed processing, program verification, reachability analysis, labeled transition systems, dataflow analysis, software development tools, distributed software engineering, worst-case complexity |
13 | Narayanan Krishnakumar, Arthur J. Bernstein |
Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 19(4), pp. 586-625, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
concurrency control, replication, integrity constraints, reachability analysis, serializability |
13 | Edith Cohen |
Estimating the Size of the Transitive Closure in Linear Time ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 190-200, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
size-estimation algorithms, reachability information, query optimization, randomized algorithm, directed graphs, transitive closure, database applications, neighborhoods, linear time, fast matrix multiplication |
13 | Giovanni Chiola, Claude Dutheillet, Giuliana Franceschinis, Serge Haddad |
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(11), pp. 1343-1360, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
stochastic well-formed colored nets, SWN, stochastic high-level nets, syntactic restriction, model definition, Markovian performance evaluation, lumpability condition, performance evaluation, computational complexity, computational complexity, complexity, Petri net, Petri nets, performance modeling, multiprocessing systems, memory contention, symbolic reachability graph |
13 | Stavros S. Cosmadakis |
Logical Reducibility and Monadic NP ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 52-61, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
syntactically restricted first-order reductions, logical reducibility, monadic NP, polynomial-time many-one reductions, directed reachability, encodings, first-order logic, NP-complete problems, relational structures |
13 | Gianfranco Ciardo, Raymond A. Marie, Bruno Sericola, Kishor S. Trivedi |
Performability Analysis Using Semi-Markov Reard Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(10), pp. 1251-1264, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
vanishing states elimination, fast transient states elimination, semi-Markov reward processes, zero reward nonabsorbing states, probabilistic switch, stiff Markov chains, performance evaluation, performability analysis, Markov processes, decomposition, stochastic Petri net, reachability graph |
13 | Dar-Tzen Peng, Kang G. Shin |
Modeling of Concurrent Task Execution in a Distributed System for Real-Time Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 36(4), pp. 500-516, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
task flow graph (TFG), Activity selection, continuous-time Markov chain (CTMC), generalized stochastic Petri nets (GSPN), reachability analysis, real-time control, first passage time, communication primitives |
13 | Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa |
Parametric inference of memory requirements for garbage collected languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 9th International Symposium on Memory Management, ISMM 2010, Toronto, Ontario, Canada, June 5-6, 2010, pp. 121-130, 2010, ACM, 978-1-4503-0054-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
live heap space analysis, peak memory consumption, garbage collection, java bytecode, low-level languages |
13 | Neha Rungta, Eric Mercer |
Slicing and dicing bugs in concurrent programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE (2) ![In: Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2, ICSE 2010, Cape Town, South Africa, 1-8 May 2010, pp. 195-198, 2010, ACM. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
underapproximation, concurrency, abstraction-refinement |
13 | Stavros Tripakis |
Checking timed Büchi automata emptiness on simulation graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 10(3), pp. 15:1-15:19, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
property-preserving abstractions, timed Büchi automata, model checking, Formal methods, specification languages |
13 | Hai-Bin Zhang, Zhen-Hua Duan |
Symbolic Algorithmic Analysis of Rectangular Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 24(3), pp. 534-543, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
model checking, temporal logic, hybrid systems, automata |
13 | Moez Krichen, Stavros Tripakis |
Conformance testing for real-time systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 34(3), pp. 238-304, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
On-the-fly algorithms, Real-time systems, Test generation, Coverage, Timed automata, Conformance testing, Specification and verification, Partial observability |
Displaying result #601 - #700 of 5162 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ 15][ 16][ >>] |
|