| Your search for 40567 returns 4306 document(s) |
| 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
|
| 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
|
| 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
|
| 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 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
|
Search Result