Sciweavers

226 search results - page 18 / 46
» Extensional Theories and Rewriting
Sort
View
AAECC
2006
Springer
109views Algorithms» more  AAECC 2006»
13 years 9 months ago
Cryptosystems using Linear Groups
Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, t...
Gilbert Baumslag, Benjamin Fine, Xiaowei Xu
ICALP
1997
Springer
14 years 1 months ago
The Theory of Vaccines
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
Massimo Marchiori
ICFP
2009
ACM
14 years 9 months ago
A theory of typed coercions and its applications
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
Nikhil Swamy, Michael W. Hicks, Gavin M. Bierman
CONCUR
2005
Springer
14 years 2 months ago
Selecting Theories and Recursive Protocols
Many decidability results are known for non-recursive cryptographic protocols, where the protocol steps can be expressed by simple rewriting rules. Recently, a tree transducer-base...
Tomasz Truderung
ENTCS
2007
144views more  ENTCS 2007»
13 years 8 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer