Sciweavers

1012 search results - page 165 / 203
» Process Algebra with Backtracking
Sort
View
IPPS
2006
IEEE
14 years 3 months ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
SEFM
2005
IEEE
14 years 2 months ago
Formal Analysis of Human-computer Interaction using Model-checking
Experiments with simulators allow psychologists to better understand the causes of human errors and build models of cognitive processes to be used in Human Reliability Assessment ...
Antonio Cerone, Peter A. Lindsay, Simon Connelly
CISC
2005
Springer
116views Cryptology» more  CISC 2005»
14 years 2 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 2 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 2 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