Sciweavers

1000 search results - page 73 / 200
» Nominal rewriting systems
Sort
View
FLOPS
2008
Springer
13 years 9 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...
AICOM
2004
100views more  AICOM 2004»
13 years 7 months ago
Query rewriting with symmetric constraints
Abstract. We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous informatio...
Christoph Koch
VIROLOGY
2008
121views more  VIROLOGY 2008»
13 years 7 months ago
Constructing malware normalizers using term rewriting
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
Andrew Walenstein, Rachit Mathur, Mohamed R. Chouc...
ENTCS
2010
103views more  ENTCS 2010»
13 years 5 months ago
Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting
Testing and verification of asynchronously communicating objects in open environments are challenging due to non-determinism. We explore a formal approach for black-box testing by...
Olaf Owe, Martin Steffen, Arild B. Torjusen
UPP
2004
Springer
14 years 1 months ago
Higher-Order Chemical Programming Style
The chemical reaction metaphor describes computation in terms of a chemical solution in which molecules interact freely according to reaction rules. Chemical solutions are represen...
Jean-Pierre Banâtre, Pascal Fradet, Yann Rad...