Sciweavers

7109 search results - page 389 / 1422
» Process Algebra with Combinators
Sort
View
FOSSACS
2005
Springer
16 years 9 days 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
16 years 5 days 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
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
16 years 3 days 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,...
CHES
2001
Springer
130views Cryptology» more  CHES 2001»
15 years 11 months ago
Generating Elliptic Curves of Prime Order
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
Erkay Savas, Thomas A. Schmidt, Çetin Kaya ...
CONCUR
2001
Springer
15 years 11 months ago
CCS with Priority Guards
It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Va...
Iain Phillips