Sciweavers

2432 search results - page 378 / 487
» Cryptographic logical relations
Sort
View
APAL
2008
104views more  APAL 2008»
15 years 6 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
173
Voted
ENTCS
2008
116views more  ENTCS 2008»
15 years 6 months ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
FAC
2008
92views more  FAC 2008»
15 years 6 months ago
Capture-avoiding substitution as a nominal algebra
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
Murdoch James Gabbay, Aad Mathijssen
178
Voted
IEE
2008
91views more  IEE 2008»
15 years 6 months ago
Story-driven approach to software evolution
: From a maintenance perspective, only software that is well understood can evolve in a controlled and high-quality manner. Software evolution itself is a knowledge-driven process ...
Juergen Rilling, Wen Jun Meng, René Witte, ...
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 6 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger