Liveness in rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2706, Issue , 2003, Pages 321-336

  Giesl, Jürgen ^a   Zantema, Hans ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

A-RINGS; LIVENESS; LIVENESS PROPERTIES; SOUND AND COMPLETE; SOUND TRANSFORMATIONS; TERM REWRITE SYSTEMS; WAITING LINES;

ARTIFICIAL INTELLIGENCE;

EID: 84947789233     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44881-0_23     Document Type: Conference Paper

References (12)

1. B. Alpern and F. B. Schneider. Defining liveness. Inf. Pr. Lett., 21:181–185, 1985.
2. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133–178, 2000.
3. F. Baader and T. Nipkow. Term Rewriting and All That. Cambr. Univ. Pr., 1998.
4. A. Bouajjani. Languages, rewriting systems, and verification of infinite-state systems. In Proc. ICALP’01, volume 2076 of LNCS, pages 24–39, 2001.
5. N. Dershowitz. Termination of rewriting. J. Symb. Comp., 3:69–116, 1987.
6. J. Giesl and T. Arts.: Verification of Erlang processes by dependency pairs. Applicable Algebra in Engineering, Communication and Comp., 12(1,2):39–72, 2001.
7. J. Giesl and A. Middeldorp. Transforming context-sensitive rewrite systems. In Proc. 10th RTA, volume 1631 of Lecture Notes in Comp. Sc., pages 271–285, 1999.
8. J. Giesl and A. Middeldorp. Transformation techniques for context-sensitive rewrite systems. Journal of Functional Programming, 2003. To appear. Preliminary extended version in Technical Report AIB-2002-02, RWTH Aachen, Germany.
9. J. Giesl and H. Zantema. Liveness in rewriting. Technical Report AIB-2002-11, RWTH Aachen, Germany, 2002. http://aib.informatik.rwth-aachen.de.
10. L. Lamport. A new solution to Dijkstra’s concurrent programming problem. Communications of the ACM, 17(8):453–455, 1974.
11. H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17:23–50, 1994.
12. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89–105, 1995.