Sciweavers

1537 search results - page 235 / 308
» On sets not belonging to algebras
Sort
View
CSL
2007
Springer
14 years 3 months ago
Not Enough Points Is Enough
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...
Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzon...
LPAR
2007
Springer
14 years 3 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
14 years 3 months ago
Equivalence verification of arithmetic datapaths with multiple word-length operands
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have di...
Namrata Shekhar, Priyank Kalla, Florian Enescu
ACSC
2005
IEEE
14 years 2 months ago
Flexible Exclusion Control for Composite Objects
We present a simple approach for implementing flexible locking strategies in a system of components, which may themselves be composite objects. The approach is flexible in that a ...
Abdelsalam Shanneb, John Potter
CCA
2005
Springer
14 years 2 months ago
Effectively Open Real Functions
A function f is continuous iff the pre-image f −1[V ] of any open setV is open again. Dual to this topological7 property, f is called open iff the image f [U] of any open set U ...
Martin Ziegler