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.
| Original language | English |
|---|---|
| Title of host publication | IFM 2005 Doctoral Symposium on Integrated Formal Methods (Eindhoven, The Netherlands, November 29, 2005) |
| Editors | J.M.T. Romijn, G. Smith, J.C. Pol, van de |
| Place of Publication | Eindhoven |
| Publisher | Technische Universiteit Eindhoven |
| Pages | 76-80 |
| Publication status | Published - 2005 |
Publication series
| Name | Computer Science Reports |
|---|---|
| Volume | 05-29 |
| ISSN (Print) | 0926-4515 |
Fingerprint
Cite this
Koprowski, A. (2005). Application of rewriting techniques to verification problems. In J. M. T. Romijn, G. Smith, & J. C. Pol, van de (Eds.), IFM 2005 Doctoral Symposium on Integrated Formal Methods (Eindhoven, The Netherlands, November 29, 2005) (pp. 76-80). (Computer Science Reports; Vol. 05-29). Eindhoven: Technische Universiteit Eindhoven.