| Your search for 38924 returns 3690 document(s) |
| 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
|
| 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
|
| 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
|
| Using formal verification/analysis methods on the critical path in system design: a case study, (LNCS-Lecture Notes in Computer Science 939) Hal 367-380 |
|
Author: Asgeir Th. Eiriksson; Ken L. McMillan; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Trace table based approach for pipelined microprocessor verification, (LNCS-Lecture Notes in Computer Science 1254) Hal 364-375 |
|
Author: Jun Sawada; Warren A. Hunt Jr; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Building asynchronous circuits with JBits, (LNCS-Lecture Notes in Computer Science 2147) Hal 628-632 |
|
Author: Eric Keller; | Call Number: 005.115 Fie | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| An automata-theoretic approach to fair realizability and synthesis, (LNCS-Lecture Notes in Computer Science 939) Hal 267-278 |
|
Author: Moshe Y. Vardi; | 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
|
| 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
|
| 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
|
Search Result