2007
DOI: 10.1017/s1471068406002869
|View full text |Cite
|
Sign up to set email alerts
|

Removing redundant arguments automatically

Abstract: The application of automatic transformation processes during the formal development and optimization of programs can introduce encumbrances in the generated code that programmers usually (or presumably) do not write. An example is the introduction of redundant arguments in the functions defined in the program. Redundancy of a parameter means that replacing it by any expression does not change the result. In this work, we provide methods for the analysis and elimination of redundant arguments in term rewriting … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 57 publications
0
3
0
Order By: Relevance
“…While a related concept for the restricted formalism of int-based TRSs was informally mentioned in [27], the following formal criteria identify a substantially larger set of needless positions, and can handle data structures represented as terms, unlike earlier work [1]. A related approach for TRSs without built-in integers was presented in [3]. Here the goal was to find arguments whose elimination does not change the semantics, while our goal is only to keep the termination behavior unchanged.…”
Section: Slicingmentioning
confidence: 99%
“…While a related concept for the restricted formalism of int-based TRSs was informally mentioned in [27], the following formal criteria identify a substantially larger set of needless positions, and can handle data structures represented as terms, unlike earlier work [1]. A related approach for TRSs without built-in integers was presented in [3]. Here the goal was to find arguments whose elimination does not change the semantics, while our goal is only to keep the termination behavior unchanged.…”
Section: Slicingmentioning
confidence: 99%
“…This is discussed in the formal treatment at http://www.trs.css.i.nagoya-u.ac.jp/c2lctrs/formal.pdf 2 Variations of such preprocessing steps preserving the properties of interest to simplify the output of an automatic translation are fairly standard in program analysis, see e.g [Albert et al 2008;Alpuente et al 2007;Beyer et al 2009;Falke et al 2011;Giesl et al 2017;Spoto et al 2009]…”
mentioning
confidence: 99%
“…This is discussed in the formal treatment at http://www.apal.i.is.nagoya-u.ac.jp/c2lctrs/formal.pdf 2 Variations of such preprocessing steps preserving the properties of interest to simplify the output of an automatic translation are fairly standard in program analysis, see e.g [Albert et al 2008;Alpuente et al 2007;Beyer et al 2009;Falke et al 2011;Giesl et al 2017;Spoto et al 2009…”
mentioning
confidence: 99%