Sciweavers

5499 search results - page 56 / 1100
» Generalized Rewrite Theories
Sort
View
TCS
1998
13 years 7 months ago
Bubbles in Modularity
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
Massimo Marchiori
LISP
2008
105views more  LISP 2008»
13 years 7 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
DAGSTUHL
2006
13 years 9 months ago
Modeling and Simulating Biological Processes with Stochastic Multiset Rewriting
ed Abstract Membrane systems are models of computation inspired by the structure and the function of biological cells. The model was introduced in 1998 by Gh. Paun and since then m...
Matteo Cavaliere, Sean Sedwards
ICSE
2008
IEEE-ACM
14 years 8 months ago
Data flow testing of service-oriented workflow applications
WS-BPEL applications are a kind of service-oriented application. They use XPath extensively to integrate loosely-coupled workflow steps. However, XPath may extract wrong data from...
Lijun Mei, W. K. Chan, T. H. Tse
HASKELL
2006
ACM
14 years 1 months ago
Introducing the Haskell equational reasoning assistant
We introduce the new, improved version of the Haskell Equational Reasoning Assistant, which consists of an Ajax application for rewriting Haskell fragments in their context, and a...
Andy Gill