A syntactic pattern recognition technique is described based upon a mathematical principle associated with finite sequences of symbols. The technique allows for fast recognition of...
Paul S. Fisher, Howard Fisher, Jinsuk Baek, Cleopa...
The -calculus is an extension of the -calculus with a pattern matching facility. The form of the argument of a function can be speci ed and hence -calculus is more convenient than...
Jan Willem Klop, Vincent van Oostrom, Roel C. de V...
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco...
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
This paper investigates the potential for automatic mapping of typical embedded applications to architectures with multimedia instruction set extensions. For this purpose a (patter...