Search Result Save to File Save as CSV
Your search for 39705 returns 2482 document(s)
Multi-pass execution of functional logic programs,Hal 361-374
Author: Jukka Paakki; | Call Number: SEM-198 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Synthesis of communicating progresses from temporal logic specifications, (LNCS-Lecture Notes in Computer Science 131) Hal. 253-281
Author: Zohar Manna; Pierre Wolper; | Call Number: 004 Lec | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Verification of coccurent program temporal proof principles, (LNCS-Lecture Notes in Computer Science 131) Hal. 200- 252
Author: Zohar Manna; Amir Pneuli; | Call Number: 004 Lec | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Some observations on compositional semantics, (LNCS-Lecture Notes in Computer Science 131)Hal. 137-149
Author: Theo M.V. Janssen; Peter van Emde Bosa; | Call Number: 004 Lec | 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 
Design and synthesis of synchronization skeletons using brancing time temporal logic, (LNCS-Lecture Notes in Computer Science 131) Hal. 52-71
Author: Edmund M. Clarke; | Call Number: 004 Lec | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Toward a logical theory of program data, (LNCS-Lecture Notes in Computer Science 131) Hal. 37-51
Author: Robert Cartwright; | Call Number: 004 Lec | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
The refinements and the stability of hoare logic, (LNCS-Lecture Notes in Computer Science 131)Hal. 24-36
Author: J.A. Berostra; J. V. Tucker; | Call Number: 004 Lec | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Hoare's logic incomplete when it does not have to be, (LNCS-Lecture Notes in Computer Science 131) Hal. 9-23
Author: J. Bergstra; | Call Number: 004 Lec | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Proof rules dealine with fairness, (LNCS-Lecture Notes in Computer Science 131) Hal. 1-8
Author: Krsystof R. Apt; | Call Number: 004 Lec | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Prev   1 2 3 4 5 6 7 8 9 10  Next