Sciweavers

168 search results - page 33 / 34
» Imperative Program Transformation by Rewriting
Sort
View
PPDP
2010
Springer
13 years 2 months ago
Rewrite-based verification of XML updates
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
Florent Jacquemard, Michaël Rusinowitch
SCP
1998
112views more  SCP 1998»
13 years 4 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer
SIGSOFT
2003
ACM
14 years 5 months ago
Consistency techniques for interprocedural test data generation
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...
Nguyen Tran Sy, Yves Deville
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
13 years 8 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
PLDI
2003
ACM
13 years 10 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers