Your search for 38821 returns 2489 document(s) |
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
|
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
|
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
|
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
|
Relaxed visibility enhances partial order recution, (LNCS-Lecture Notes in Computer Science 1254) Hal. 328-339 |
Author: Ikka Kokkarinem; Doron Peled; Anti Valman; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Programs with quasi-stable channels are effectively recognizable, (LNCS-Lecture Notes in Computer Science 1254)Hal. 304-315 |
Author: Gerard CECE; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|