Application of rewriting techniques to verification problems

A. Koprowski

Application of rewriting techniques to verification problems

A. Koprowski

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

30 Downloads (Pure)

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

Access to Document

Metis192076Final published version, 222 KB

Fingerprint Dive into the research topics of 'Application of rewriting techniques to verification problems'. Together they form a unique fingerprint.

Cite this

@inproceedings{fdea4088b0e04c8bac93e665c2c9ad91,

title = "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.",

author = "A. Koprowski",

year = "2005",

language = "English",

series = "Computer Science Reports",

publisher = "Technische Universiteit Eindhoven",

pages = "76--80",

editor = "J.M.T. Romijn and G. Smith and {Pol, van de}, J.C.",

booktitle = "IFM 2005 Doctoral Symposium on Integrated Formal Methods (Eindhoven, The Netherlands, November 29, 2005)",

}

Application of rewriting techniques to verification problems. / Koprowski, A.

IFM 2005 Doctoral Symposium on Integrated Formal Methods (Eindhoven, The Netherlands, November 29, 2005). ed. / J.M.T. Romijn; G. Smith; J.C. Pol, van de. Eindhoven : Technische Universiteit Eindhoven, 2005. p. 76-80 (Computer Science Reports; Vol. 05-29).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

TY - GEN

T1 - Application of rewriting techniques to verification problems

AU - Koprowski, A.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

M3 - Conference contribution

T3 - Computer Science Reports

SP - 76

EP - 80

BT - IFM 2005 Doctoral Symposium on Integrated Formal Methods (Eindhoven, The Netherlands, November 29, 2005)

A2 - Romijn, J.M.T.

A2 - Smith, G.

A2 - Pol, van de, J.C.

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -