A compiler for a class of conditional term rewriting systems

Geser, Alfons; Hußmann, Heinrich; Mück, Andy

doi:10.1007/3-540-19242-5_7

Cited by 12 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Executing algebraic specifications. There is a long history of executing algebraic specifications by term re-writing (e.g., [7,10,11,16,17,43]). This is related to our work in that it has to do with executing specifications, but the kind of specification language used is different and the synthesis technique is different.…”

Section: Related Workmentioning

confidence: 99%

Synthesizing iterators from abstraction functions

et al. 2012

View full text Add to dashboard Cite

A technique for synthesizing iterators from declarative abstraction functions written in a relational logic specification language is described. The logic includes a transitive closure operator that makes it convenient for expressing reachability queries on linked data structures. Some optimizations, including tuple elimination, iterator flattening, and traversal state reduction, are used to improve performance of the generated iterators. A case study demonstrates that most of the iterators in the widely used JDK Collections classes can be replaced with code synthesized from declarative abstraction functions. These synthesized iterators perform competitively with the hand-written originals. In a user study the synthesized iterators always passed more test cases than the hand-written ones, were almost always as efficient, usually took less programmer effort, and were the qualitative preference of all participants who provided free-form comments.

show abstract

Section: Related Workmentioning

confidence: 99%

Synthesizing iterators from abstraction functions

et al. 2012

View full text Add to dashboard Cite

show abstract

“…There is a long history of executing algebraic specifications by term re-writing (e.g., [7,10,11,16,17,43]). This is related to our work in that it has to do with executing specifications, but the kind of specification language used is different and the synthesis technique is different.…”

Section: Related Workmentioning

confidence: 99%

Synthesizing iterators from abstraction functions

Rayside

Montaghami

Leung

et al. 2012

Proceedings of the 11th International Conference on Generative Programming and Component Engineering

View full text Add to dashboard Cite

A technique for synthesizing iterators from declarative abstraction functions written in a relational logic specification language is described. The logic includes a transitive closure operator that makes it convenient for expressing reachability queries on linked data structures. Some optimizations, including tuple elimination, iterator flattening, and traversal state reduction, are used to improve performance of the generated iterators.A case study demonstrates that most of the iterators in the widely used JDK Collections classes can be replaced with code synthesized from declarative abstraction functions. These synthesized iterators perform competitively with the hand-written originals.In a user study the synthesized iterators always passed more test cases than the hand-written ones, were almost always as efficient, usually took less programmer effort, and were the qualitative preference of all participants who provided free-form comments.

show abstract

Normalization by leftmost innermost rewriting

Antoy

1993

Conditional Term Rewriting Systems

View full text Add to dashboard Cite

A compiler for a class of conditional term rewriting systems

Cited by 12 publications

References 3 publications

Synthesizing iterators from abstraction functions

Synthesizing iterators from abstraction functions

Synthesizing iterators from abstraction functions

Normalization by leftmost innermost rewriting

Contact Info

Product

Resources

About