Sciweavers

Share
IGPL
2011
8 years 2 months ago
On representable ordered residuated semigroups
We show that the equational theory of representable lattice-ordered residuated semigroups is not finitely axiomatizable. We apply this result to the problem of completeness of su...
Szabolcs Mikulás
FUIN
2010
163views more  FUIN 2010»
8 years 4 months ago
Equational Reasoning on Mobile Ad Hoc Networks
We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize...
Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar
CCS
2010
ACM
8 years 4 months ago
Cap unification: application to protocol security modulo homomorphic encryption
We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. The protocol steps are modeled as rigid Horn clauses, and t...
Siva Anantharaman, Hai Lin, Christopher Lynch, Pal...
JSC
2010
103views more  JSC 2010»
8 years 5 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
8 years 5 months ago
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
Michael Backes, Matteo Maffei, Dominique Unruh
FOSSACS
2006
Springer
8 years 11 months ago
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation
We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alph...
Taolue Chen, Wan Fokkink, Sumit Nain
FOSSACS
2006
Springer
8 years 11 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
RTA
2010
Springer
8 years 11 months ago
Infinitary Rewriting: Foundations Revisited
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
Stefan Kahrs
JELIA
1990
Springer
8 years 11 months ago
Action Logic and Pure Induction
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
Vaughan R. Pratt
WOLLIC
2010
Springer
9 years 10 days 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...
books