1385 search results - page 45 / 277 » Natural Rewriting for General Term Rewriting Systems |
171
click to vote
CSMR
2004
IEEE
15 years 9 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...
166
click to vote
GLVLSI
2002
IEEE
15 years 11 months ago
2002
IEEE
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
169
click to vote
ENTCS
2007
15 years 6 months ago
2007
Automated deduction methods should be speciļ¬ed not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, diļ...
164
click to vote
IWPC
2003
IEEE
15 years 11 months ago
2003
IEEE
Syntactic and semantic analysis are established topics in the area of compiler construction. Their application to the understanding and restructuring of large software systems rev...
177
click to vote
CADE
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...