| Application of Rewriting Techniques to Verification Problems |  |
Abstract:
The goal of the project is to employ techniques from term rewriting to verification problems. The relationship between
liveness properties and termination of term rewrite systems (TRSs) is of particular interest. The emphasis is on the
investigation of such properties for infinite state space systems where standard model checking techniques fail. Next
to developing the necessary underlying theory and performing a case study analysis, the possibility to automate this
approach is of great importance. In this paper we discuss the motivation of such work, present the results obtained
so far, discuss related work and present plans for the further research.
Application of Rewriting Techniques to Verification Problems
In
Proceedings of the Doctoral Symposium on Integrated Formal Methods
( IFM '05),
Eindhoven, The Netherlands.
BibTeX:@inproceedings{liv-IFM-05,
author = {Adam Koprowski},
title = {Application of Rewriting Techniques to Verification Problems},
booktitle = {Proceedings of the Doctoral Symposium on Integrated Formal Methods (IFM '05)},
year = {2005},
pages = {76--80},
} | 
