| Your search for 38921 returns 3729 document(s) |
| Efficient checking of behavioural relations and modal assertions using fixed-point inversion, (LNCS-Lecture Notes in Computer Science 939) Hal 142-154 |
|
Author: Henrik Reif Andersen; Bart Vergauwen; | 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
|
| Ucke - efficient u-calculus model checking, (LNCS-Lecture Notes in Computer Science 1254) Hal 468-471 |
|
Author: Armin Biere; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving, (LNCS-Lecture Notes in Computer Science 939) Hal 54-69 |
|
Author: Jurgen Dingel; Thomas Filkorn; | 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
|
| Symbolic model checking of infinite state systems using presburger arithmetic, (LNCS-Lecture Notes in Computer Science 1254) Hal 400-411 |
|
Author: Tevfik Bultan; Richard Gerber; William Pugh; | 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
|
| 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
|
| An integration of model checking with automated proof checking, (LNCS-Lecture Notes in Computer Science 939) Hal 84-97 |
|
Author: S. Rajan; N. Shankar; M. K. Srivas; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| An efficient tree-based group key agreement using bilinear map, (LNCS-Lecture Notes in Computer Science 2576) Hal 357-371 |
|
Author: Sangwon Lee; Yongdae Kim; Kwangjo Kim; Dae-Hyun Ryu; | Call Number: 005.8 Zho a | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Search Result