Sciweavers

2850 search results - page 292 / 570
» On Timed Models and Full Abstraction
Sort
View
WOLLIC
2010
Springer
15 years 12 months ago
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signa
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
Daniele Nantes Sobrinho, Mauricio Ayala-Rinc&oacut...
180
Voted
CP
2000
Springer
15 years 11 months ago
A Constraint-Based Framework for Prototyping Distributed Virtual Applications
Abstract. This paper describes the architecture and implementation of a constraint-based framework for rapid prototyping of distributed applications such as virtual simulations, co...
Vineet Gupta, Lalita Jategaonkar Jagadeesan, Radha...
CC
2010
Springer
135views System Software» more  CC 2010»
15 years 6 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
TON
2002
94views more  TON 2002»
15 years 6 months ago
Multicast routing and wavelength assignment in multihop optical networks
Abstract--This paper addresses multicast routing in circuitswitched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast com...
Ran Libeskind-Hadas, Rami G. Melhem
FPGA
2009
ACM
159views FPGA» more  FPGA 2009»
16 years 1 months ago
Choose-your-own-adventure routing: lightweight load-time defect avoidance
Aggressive scaling increases the number of devices we can integrate per square millimeter but makes it increasingly difficult to guarantee that each device fabricated has the inte...
Raphael Rubin, André DeHon