Sciweavers

74 search results - page 8 / 15
» Program Transformation with Scoped Dynamic Rewrite Rules
Sort
View
ICLP
2009
Springer
14 years 8 months ago
Qualified Computations in Functional Logic Programming
Abstract. Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this paper we investigate a more expressive language f...
Rafael Caballero, Mario Rodríguez-Artalejo,...
POPL
2007
ACM
14 years 8 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
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
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 8 months ago
Using ATL to define advanced and flexible constraint model transformations
Abstract. Transforming constraint models is an important task in recent constraint programming systems. User-understandable models are defined during the modeling phase but rewriti...
Raphaël Chenouard, Laurent Granvilliers, Rica...
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund