Search Result Save to File Save as CSV
Your search for 38555 returns 3822 document(s)
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 
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 
Protocols using anonymous connections: mobile applications, (LNCS-Lecture Notes in Computer Science 1361) Hal 13-23
Author: Michael G. Reed; Paul F. Syverson; David M. Goldschlag; | Call Number: 004.62 Chr s | 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 
Hardware verification using monadic second-order logic, (LNCS-Lecture Notes in Computer Science 939) Hal 31-41
Author: David A. Basin; Nils Klarlund; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Trace theoretic verification of asynchronous circuits using unfoldings, (LNCS-Lecture Notes in Computer Science 939) Hal 180-195
Author: K. L. McMillan; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Using relative refinement for fault tolerance,(LNCS-Lecture Notes in Computer Science 939) Hal 19-41
Author: Antonio Cau; Willem-Paul de Roever; | Call Number: 004 Woo f | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
A concurrency case study using RAISE, (LNCS-Lecture Notes in Computer Science 670) Hal 367-387
Author: Anne Haxthausen; Chris George; | Call Number: 004 Woo f | 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