Sciweavers

279 search results - page 9 / 56
» Tree Pattern Rewriting Systems
Sort
View
FSTTCS
2003
Springer
15 years 10 months ago
Reachability Analysis of Process Rewrite Systems
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
Ahmed Bouajjani, Tayssir Touili
RTA
2010
Springer
15 years 8 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
DEBS
2009
ACM
15 years 11 months ago
Distributed complex event processing with query rewriting
The nature of data in enterprises and on the Internet is changing. Data used to be stored in a database first and queried later. Today timely processing of new data, represented ...
Nicholas Poul Schultz-Møller, Matteo Miglia...
APBC
2004
154views Bioinformatics» more  APBC 2004»
15 years 6 months ago
Dispensation Order Generation for Pyrosequencing
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
Mats Carlsson, Nicolas Beldiceanu
ICTAC
2004
Springer
15 years 10 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...