226 search results - page 18 / 46 » Extensional Theories and Rewriting |
95
Voted
AAECC
2006
Springer
15 years 16 days ago
2006
Springer
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...
ICALP
1997
Springer
15 years 4 months ago
1997
Springer
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...
200
click to vote
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
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 ...
98
Voted
CONCUR
2005
Springer
15 years 6 months ago
2005
Springer
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...
ENTCS
2007
15 years 13 days ago
2007
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...