Sciweavers

691 search results - page 18 / 139
» Equational Abstractions
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
13 years 8 months ago
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...
Peter Selinger
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
13 years 9 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
AGP
1994
IEEE
14 years 8 days ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...
WOLLIC
2010
Springer
14 years 1 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...
EUROCAST
2001
Springer
127views Hardware» more  EUROCAST 2001»
14 years 1 months ago
Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations
Abstract. This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an exte...
Tetsuo Ida, Mircea Marin, Taro Suzuki