Simulating Liveness by Reduction Strategies

Autor:	Giesl, J., Zantema, H., Gramlich, B., Lucas, S.
Přispěvatelé:	Formal System Analysis
Rok vydání:	2003
Předmět:	Reduction (complexity) General Computer Science Process (engineering) Programming language Computer science Liveness Rewriting computer.software_genre computer Term (time) Theoretical Computer Science Computer Science(all)
Zdroj:	Proceedings 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003, Valencia, Spain, June 8, 2003)
ISSN:	1571-0661
DOI:	10.1016/s1571-0661(05)82615-5
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e45f8c4c731676fbf188ed5c13cd5453 Zobrazit plný text záznamu Full Text from ScienceDirect