| Your search for 38847 returns 2527 document(s) |
| Automatic abstraction techniques for propositional u-calculus model checking, (LNCS-Lecture Notes in Computer Science 1254) Hal 12-23 |
|
Author: Abelardo Pardo; Gary D. Hachtel; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| A compositional rule for hardware design refinement, (LNCS-Lecture Notes in Computer Science 1254) Hal 24-35 |
|
Author: K. L. McMillan; | 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
|
| Construction of abstract state graphs with PVS, (LNCS-Lecture Notes in Computer Science 1254) Hal 72-83 |
|
Author: Susanne Graf; Hassen Saidi; | Call Number: 004 Int c | 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
|
| 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
|
| 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
|
Search Result