| Your search for 38836 returns 2528 document(s) |
| 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
|
| An efficient decision procedure for the theory of fixed-sized bit-vectors, (LNCS-Lecture Notes in Computer Science 1254) Hal 60-71 |
|
Author: David Cyrluk; Oliver Moller; Harald Rueb; | Call Number: 004 Int c | Edition: (LNCS-Lecture Notes in Computer Science 985) | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Verification of a chemical process leak test procedure, (LNCS-Lecture Notes in Computer Science 1254) Hal 84-94 |
|
Author: Adam L. Turk; Scott T. Probst; Gary J. Powers; | Call Number: 004 Int c | Edition: (LNCS-Lecture Notes in Computer Science 985) | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Automatic datapath extraction for efficient usage of HDD, (LNCS-Lecture Notes in Computer Science 1254) Hal 95-106 |
|
Author: Gila Kamhi; Osnat Weissberg; Limor Fix; | Call Number: 004 Int c | Edition: (LNCS-Lecture Notes in Computer Science 985) | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| 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
|
| Towards a mechanization of cryptographic protocol verification, (LNCS-Lecture Notes in Computer Science 1254) Hal 131-142 |
|
Author: Dominique Bolignano; | 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
|
Search Result