Termination of fair computations in term rewriting

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

Volumn 3835 LNAI, Issue , 2005, Pages 184-198

  Lucas, Salvador ^a   Meseguer, José ^b  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Concurrent programming; Fairness; Program analysis; Term rewriting; Termination

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONCURRENT ENGINEERING; LOGIC PROGRAMMING; STANDARDS; THEOREM PROVING;

FAIRNESS; PROGRAM ANALYSIS; TERM REWRITING; TERMINATION;

PROBLEM SOLVING;

EID: 33745478098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_14     Document Type: Conference Paper

References (20)

1. [BB92] G. Berry and G. Boudol. The Chemical Abstract Machine. Theoretical Computer Science 96(1):217-248, 1992.
2. [DLMMU04] F. Durán, S. Lucas, J. Meseguer, C. Marché, and X. Urbain. Proving Termination of Membership Equational Programs. In P. Sestoft and N. Heintze, editors, Proc. of ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation, PEPM'04, pages 147-158, ACM Press, New York, 2004.
3. [Fra86] N. Francez. Fairness. Springer-Verlag, Berlin, 1986.
4. [Ges90] A. Geser. Relative Termination. PhD Thesis. Fakultät für Mathematik und Informatik. Universität Passau, 1990.
5. [GM04] J. Giesl and A. Middeldorp. Transformation techniques for context-sensitive rewrite systems. Journal of Functional Programming, 14(4): 379-427, 2004.
6. [HL91] G. Huet and J.J. Levy. Computations in orthogonal term rewriting Systems I, II. In J.L. Lassez and G. Plotkin, editors, Computational logic: essays in honour of J. Alan Robinson, pages 395-414 and 415-443. The MIT Press, Cambridge, MA, 1991.
7. [KKSV95] R. Kennaway, J.W. Klop, M.R. Sleep, and F.-J. de Vries. Transfinite Reductions in Orthogonal Term Rewriting Systems. Information and Computation 119(1):18-38, 1995.
8. [Klo92] J.W. Klop. Term Rewriting Systems. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum. Handbook of Logic in Computer Science, volume 2, pages 1-116. Oxford University Press, 1992.
9. [KZ05] A. Koprowski and H. Zantema. Proving Liveness with Fairness using Rewriting. In B. Gramlich, editor, Proc. of the 5th International Workshop on Frontiers of Combining Systems, ProCoS'05, LNAI 3717:232-247, 2005.
10. [LPS81] D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, Justice and Fairness: the ethics of concurrent termination. In S. Even and O. Kariv, editors, Proc. of the 8th International Colloquium on Automata, Languages, and Programming, ICALP'81, LNCS 115:264-277, Springer-Verlag, Berlin, 1981.
11. [Mes92] J. Meseguer. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science 96(1):73-55, 1992.
12. [Mes05] J. Meseguer. Localized Fairness: A Rewriting Semantics. In J. Giesl, editor, Proc. of the 16th International Conference on Rewriting Techniques and Applications, RTA '05, LNCS 3467:250-263, Springer-Verlag, Berlin, 2005.
13. [MM02] N. Martí-Oliet and J. Meseguer. Rewriting logic: roadmap and bibliography. Theoretical Computer Science 285(2):121-154, 2002.
14. [MN70] Z. Manna and S. Ness. On the termination of Markov algorithms. In Proc. of the Third Hawaii International Conference on System Science, pages 789-792, 1970.
15. [O'D77] M.J. O'Donnell. Computing in Systems Described by Equations. LNCS 58, Springer-Verlag, Berlin, 1977.
16. [Oh102] E. Ohlebusch. Advanced Topics in Term Rewriting. Springer-Verlag, Berlin, 2002.
17. [PF85] S. Porat and N. Francez. Fairness in term rewriting systems. In J.-P. Jouannaud, editor, Proc. of the 1st International Conference on Rewriting Techniques and Applications, RTA '85, LNCS 202:287-300, Springer-Verlag, Berlin, 1985.
18. [PF86] S. Porat and N. Francez. Full-commutation and fair-termination in equational (and combined) term rewriting systems. In J.H. Siekmann, editor, Proc. of the 8th International Conference on Automated Deduction, CADE'86, LNCS 230:21-41, Springer-Verlag, Berlin, 1986.
19. [Ter03] TeReSe, editor, Term Rewriting Systems, Cambridge University Press, 2003.
20. [Tis89] S. Tison. Fair termination is decidable for ground systems. In N. Dershowitz, editor, Proc. of the 3rd International Conference on Rewriting Techniques and Applications, RTA '89, LNCS 355:462-476, Springer-Verlag, Berlin, 1989.