Search Result Save to File Save as CSV
Your search for 38829 returns 4066 document(s)
A new heuristic for bad cycle detection using BDDs, LNCS-Lecture Notes in Computer Science 1254) Hal 268-278
Author: R. H. Shadin; R. P. Kurshan; S. K. Shukla; M. Y. Vardi; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Efficient detection of vacuity in ACTL formulas, (LNCS-Lecture Notes in Computer Science 1254) Hal 279-290
Author: Ilan Beer; Shoham Ben-David; Cindy Eisner; Yoav Rodeh; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Using the rippling heuristic in set membership proofs, (LNCS-Lecture Notes in Computer Science 1212)Hal. 135-147
Author: Ina Kraan; | Call Number: 005.133 Bow z | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Deadlock checking using net unfoldings, (LNCS-Lecture Notes in Computer Science 1254) Hal 352-363
Author: Stephan Melzer; Stefan Romer; | 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 Sistla; | 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 presburger arithmetic, (LNCS-Lecture Notes in Computer Science 1254) Hal 400-411
Author: Tevfik Bultan; Richard Gerber; William Pugh; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Using compositional preorders in the verification of sliding window protocol, (LNCS-Lecture Notes in Computer Science 1254) Hal 48-59
Author: Roope Kaivola; | 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 
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 
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 
Prev   1 2 3 4 5 6 7 8 9 10  Next