861 search results - page 7 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
124
click to vote
FOSSACS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
RTA
2010
Springer
15 years 3 months ago
2010
Springer
The K framework, based on rewriting logic semantics, provides a powerful logic for deļ¬ning the semantics of programming languages. While most work in this area has focused on deļ...
125
click to vote
MCMASTER
1993
15 years 3 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
109
click to vote
AMAST
2008
Springer
15 years 1 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
104
click to vote
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...