Sciweavers

215 search results - page 24 / 43
» Pattern Matching in Order-Sorted Languages
Sort
View
PODS
2005
ACM
99views Database» more  PODS 2005»
15 years 9 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
JFP
2006
90views more  JFP 2006»
14 years 9 months ago
Regular expression filters for XML
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have give...
Haruo Hosaya
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
15 years 1 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
15 years 7 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
FLOPS
2010
Springer
15 years 4 months ago
Beluga: Programming with Dependent Types, Contextual Data, and Contexts
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
Brigitte Pientka