Sciweavers

1036 search results - page 14 / 208
» Natural Narrowing for General Term Rewriting Systems
Sort
View
PLILP
1998
Springer
13 years 11 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
TCS
2002
13 years 7 months ago
Specification of real-time and hybrid systems in rewriting logic
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...
Peter Csaba Ölveczky, José Meseguer
ENTCS
2007
103views more  ENTCS 2007»
13 years 7 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
WWW
2011
ACM
13 years 2 months ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...
FDL
2003
IEEE
14 years 25 days ago
Using Rewriting-Logic Notation for Funcional Verification in Data-Stream Based Reconfigurable Computing
Reconfigurable Systolic Arrays are a generalization of Systolic Arrays where node operations and interconnections can be redefined even at run time. This flexibility increases the...
Mauricio Ayala-Rincón, Ricardo P. Jacobi, C...