| Your search for 38812 returns 2555 document(s) |
| 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
|
| Some progress in the symbolic verification of timed automata, (LNCS-Lecture Notes in Computer Science 1254) Hal 179-190 |
|
Author: Marius Bozga; Oded Maler; Amir Pnueli; Sergio Yovine; | 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
|
| The invariant checker: automated deductive verification of reactive systems, (LNCS-Lecture Notes in Computer Science 1254)Hal. 436-443 |
|
Author: Hassen Saidi; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Parametrized verification of linear networks using automata as invariants, (LNCS-Lecture Notes in Computer Science 1254)Hal. 412-423 |
|
Author: A. Prasad Sistia; | 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
|
| On combining formal and informal verification, (LNCS-Lecture Notes in Computer Science 1254)Hal. 376-387 |
|
Author: Jun Yuan; Jian Shen; Jacob Abraham; Adnan Azis; | 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
|
| 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