Your search for 39698 returns 4450 document(s) |
Combining constraint solving and symbolic model checking for a class of sysems with non-linear constraints, (LNCS-Lecture Notes in Computer Science 1254)Hal. 316-327 |
Author: William Chan; Richard Anderson; Paul Beanne; David Notkin; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Testing for termination with monotonicity constraints, (LNCS-Lecture Notes in Computer Science 3668) Hal 326-340 |
Author: Michael Coodish; Vitaly Lagoon; Peter J. Stuckey; | Call Number: 005.133 Gab l | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
A Formalism for reasoning about fair termination, (LNCS-Lecture Notes in Computer Science 131) Hal. 119-138 |
Author: William P. de Roever; | Call Number: 004 Lec | 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
|
Probabilistic neighbourhood logic, (LNCS-Lecture Notes in Computer Science 1926) Hal 264-275 |
Author: Dimitar P. Guelev; | Call Number: 004.33 Jos f | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Encoding w: a logic z in 2obj, (LNCS-Lecture Notes in Computer Science 670) Hal 462-481 |
Author: Andrew Martin; | Call Number: 004 Woo f | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Logic in Computer Science: An Automata-Theoretic Approach to Branching-Time Model Checking |
Author: O. Kupferman, [et all] | Type: Indeks Artikel Jurnal
|
Find Similar |
Add To Favorites |
Detail in New Window
|
A format-independent architecture for run-time integrity checking of executable code, (LNCS-Lecture Notes in Computer Science 2576) Hal 219-233 |
Author: Luigi Catuogno; Ivan Visconti; | Call Number: 005.8 Sec | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Decidable model checking of probabilistic hybrid automata, (LNCS-Lecture Notes in Computer Science 1926) Hal 31-45 |
Author: Jeremy Sproston; | Call Number: 004.33 Jos f | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
A new algorithm for discrete timed symbolic model checking, (LNCS-Lecture Notes in Computer Science 1201) Hal 18-32 |
Author: Jurgen Ruf; Thomas Kropf; | Call Number: 004.33 Mal h | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|