| Your search for 38805 returns 4090 document(s) |
| An n log n algorithm for online BDD refinement, (LNCS-Lecture Notes in Computer Science 1254) Hal 107-118 |
|
Author: Nils Klarlund; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Weak bisimulation for fully probabilistic processes, (LNCS-Lecture Notes in Computer Science 1254) Hal 119-130 |
|
Author: Christel Baier; Holger Hermanns; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Efficient model checking using tabled resolution,(LNCS-Lecture Notes in Computer Science 1254) Hal 143-154 |
|
Author: Y.S. Ramakrishna; C.R. Ramakhrisnan; I.V. Ramakrishnan; Scott A. Smolka; Terrance Swift; David S. Warren; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Containment of regular languages in non-regular timing diagram languages is decidable, (LNCS-Lecture Notes in Computer Science 1254) Hal 155-166 |
|
Author: Kathi Fisler; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| TermiLong: a system for checking termination of queries to logic programs, (LNCS-Lecture Notes in Computer Science 1254)Hal. 444-447 |
|
Author: N. Lindenstrauss, Y. Sagiv; A. Serebernik; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Symbolic model checking of infinite state systems using presbuger; arithmetic, (LNCS-Lecture Notes in Computer Science 1254)Hal. 400-411 |
|
Author: Tevfik Bultan; Richard Gerber and William Pugh; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Efficient modeling of memory arrays in symbolic simulation, (LNCS-Lecture Notes in Computer Science 1254)Hal. 368-399 |
|
Author: Miroslav Velev; Randal E. Bryant; Alok Jain; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Deadlock checking using net unforldings, (LNCS-Lecture Notes in Computer Science 1254) Hal. 352-363 |
|
Author: Stephan Melzer and Stefan Romer; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Partial-order reduction in symbolic state space explorarion, (LNCS-Lecture Notes in Computer Science 1254) Hal. 340-351 |
|
Author: R. Alur; R.K. Bryton; T.A. Henzinger; S. Qadeer; S.K. Rajamani; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Relaxed visibility enhances partial order recution, (LNCS-Lecture Notes in Computer Science 1254) Hal. 328-339 |
|
Author: Ikka Kokkarinem; Doron Peled; Anti Valman; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Search Result