Sciweavers

3552 search results - page 440 / 711
» Proof theory in the abstract
Sort
View
ENTCS
2007
104views more  ENTCS 2007»
15 years 6 months ago
General Reversibility
The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we t the core of...
Vincent Danos, Jean Krivine, Pawel Sobocinski
SIAMCOMP
2008
103views more  SIAMCOMP 2008»
15 years 6 months ago
Compression in Finite Fields and Torus-Based Cryptography
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
Karl Rubin, Alice Silverberg
TECS
2008
94views more  TECS 2008»
15 years 6 months ago
Composing heterogeneous reactive systems
elationships between heterogeneous models at different levels of abstraction. In particular, they can be used to represent design transformations from tightly synchronized specific...
Albert Benveniste, Benoît Caillaud, Luca P. ...
JACIII
2007
79views more  JACIII 2007»
15 years 6 months ago
State-Transition Computation Models and Program Correctness Thereon
Abstract— A common framework for formalization of statetransition computation models is presented based on a general theory for studying the interrelationships between specifica...
Kiyoshi Akama, Ekawit Nantajeewarawat
JCT
2007
107views more  JCT 2007»
15 years 6 months ago
On a conjecture of Wilf
Abstract. Let n and k be natural numbers and let S(n, k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum nX j=0 (−1)j S(n, j) ...
Stefan De Wannemacker, Thomas Laffey, Robert Osbur...