Sciweavers

950 search results - page 155 / 190
» Process Algebra in PVS
Sort
View
CISC
2005
Springer
116views Cryptology» more  CISC 2005»
14 years 1 months ago
Specifying Authentication Using Signal Events in CSP
The formal analysis of cryptographic protocols has developed into a comprehensive body of knowledge, building on a wide variety of formalisms and treating a diverse range of securi...
Siraj A. Shaikh, Vicky J. Bush, Steve A. Schneider
FOSSACS
2005
Springer
14 years 1 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
BIRTHDAY
2004
Springer
14 years 1 months ago
Retracing the Semantics of CSP
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...
Stephen D. Brookes
IFM
2004
Springer
104views Formal Methods» more  IFM 2004»
14 years 1 months ago
Linking CSP-OZ with UML and Java: A Case Study
Abstract. We describe how CSP-OZ, an integrated formal method combining the process algebra CSP with the specification language Object-Z, can be linked to standard software engine...
Michael Möller, Ernst-Rüdiger Olderog, H...
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
14 years 1 months ago
The Succinct Solver Suite
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun,...