Application of rewriting techniques to verification problems

A. Koprowski

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    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 languageEnglish
    Title of host publicationIFM 2005 Doctoral Symposium on Integrated Formal Methods (Eindhoven, The Netherlands, November 29, 2005)
    EditorsJ.M.T. Romijn, G. Smith, J.C. Pol, van de
    Place of PublicationEindhoven
    PublisherTechnische Universiteit Eindhoven
    Pages76-80
    Publication statusPublished - 2005

    Publication series

    NameComputer Science Reports
    Volume05-29
    ISSN (Print)0926-4515

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

    Cite this