67 search results - page 4 / 14 » A Verification Technique Using Term Rewriting Systems and Ab... |
90
Voted
LATA
2009
Springer
15 years 6 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
79
Voted
FROCOS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
CADE
2006
Springer
15 years 12 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
100
click to vote
ICLP
2005
Springer
15 years 5 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
116
Voted
SIGSOFT
2007
ACM
16 years 12 days ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...