A Needed Rewriting Strategy for Data-Structures with Pointers

DOI10.1007/978-3-540-70590-1_5MaRDI QIDQ3522009zbMATH OpenOpenAlexFDO

Authors Rachid Echahed, Nicolas Peltier

Publication date 28 August 2008

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70590-1_5

Mathematics Subject Classification ID

Searching and sorting (68P10) Grammars and rewriting systems (68Q42)

Recommendations

• Non Strict Confluent Rewrite Systems for Data-Structures with Pointers
• Modeling pointer redirection as cyclic term-graph rewriting
• Narrowing Data-Structures with Pointers
• On term-graph rewrite strategies
• scientific article; zbMATH DE number 177461

Cites work

• scientific article; zbMATH DE number 599028 (Why is no real title available?)
• scientific article; zbMATH DE number 1418367 (Why is no real title available?)
• scientific article; zbMATH DE number 1420819 (Why is no real title available?)
• An efficient machine-independent procedure for garbage collection in various list structures
• Narrowing Data-Structures with Pointers
• Non Strict Confluent Rewrite Systems for Data-Structures with Pointers
• Sequentiality in orthogonal term rewriting systems
• Strongly sequential and inductively sequential term rewriting systems

Cited in

(4)

• Narrowing Data-Structures with Pointers
• Non Strict Confluent Rewrite Systems for Data-Structures with Pointers
• A method of elimination of data structures based on formula rewriting systems
• Modeling pointer redirection as cyclic term-graph rewriting

This page was built for publication: A Needed Rewriting Strategy for Data-Structures with Pointers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522009)