861 search results - page 1 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
FMCAD
2008
Springer
13 years 6 months ago
2008
Springer
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
RTA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
CSMR
2004
IEEE
13 years 8 months ago
2004
IEEE
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...
CTCS
1997
Springer
13 years 9 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...