Sciweavers

48 search results - page 2 / 10
» Issues in the Practical Use of Graph Rewriting
Sort
View
ICDE
1997
IEEE
136views Database» more  ICDE 1997»
14 years 6 months ago
Delegation: Efficiently Rewriting History
Transaction delegation, as introduced in ACTA, allows a transaction to transfer responsibility for the operations that it has performed on an object to another transaction. Delega...
Cris Pedregal Martin, Krithi Ramamritham
ICSE
2001
IEEE-ACM
13 years 9 months ago
Using Transformation Systems for Software Maintenance and Reengineering
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...
Ira D. Baxter
ICSE
2008
IEEE-ACM
14 years 5 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
ENTCS
2007
109views more  ENTCS 2007»
13 years 4 months ago
Improving the Context-sensitive Dependency Graph
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
Beatriz Alarcón, Raúl Gutiérr...
PVLDB
2010
128views more  PVLDB 2010»
13 years 3 months ago
Update Rewriting and Integrity Constraint Maintenance in a Schema Evolution Support System: PRISM++
Supporting legacy applications when the database schema evolves represents a long-standing challenge of practical and theoretical importance. Recent work has produced algorithms a...
Carlo Curino, Hyun Jin Moon, Alin Deutsch, Carlo Z...