215 search results - page 6 / 43 » Pattern Matching in Order-Sorted Languages |
IR
2008
14 years 9 months ago
2008
We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm-1...
98
Voted
PPDP
2005
Springer
15 years 3 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
OOPSLA
2007
Springer
15 years 3 months ago
2007
Springer
We present a new language feature, specified as an extension to Java. The feature is a form of dispatch which includes and subsumes multimethods (see for example [3]), but which ...
FUIN
2006
14 years 9 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on ty...