Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Electronic Notes in Theoretical Computer Science 86 No. 4 (2003) URL: http://www.elsevier.nl/locate/entcs/volume86.html 16 pages
 

Summary: Electronic Notes in Theoretical Computer Science 86 No. 4 (2003)
URL: http://www.elsevier.nl/locate/entcs/volume86.html 16 pages
Simulating Liveness by Reduction Strategies
J¨urgen Giesl 1
LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany
Hans Zantema 2
Department of Computer Science, TU Eindhoven, P.O. Box 513,
5600 MB Eindhoven, The Netherlands
Abstract
We define a general framework to handle liveness and related properties by reduction
strategies in abstract reduction and term rewriting. Classically, reduction strategies
in rewriting are used to simulate the evaluation process in programming languages.
The aim of our work is to use reduction strategies to also study liveness questions
which are of high importance in practice (e.g., in protocol verification for distributed
processes). In particular, we show how the problem of verifying liveness is related
to termination of term rewrite systems (TRSs). Using our results, techniques for
proving termination of TRSs can be used to verify liveness properties.
1 Introduction
In this paper, we give a formal definition of safety and liveness using the frame-
work of abstract reduction (Sect. 2). In particular, liveness is formalized by

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences