SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

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

Volumn 4098 LNCS, Issue , 2006, Pages 257-266

TPA: Termination proved automatically

(1) Koprowski, Adam a

a EINDHOVEN UNIVERSITY OF TECHNOLOGY (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; NUMBER THEORY; SEMANTICS; THEOREM PROVING;

NATURAL NUMBERS; SEMANTIC LABELLING; TERM REWRITE SYSTEMS (TRS);

COMPUTER PROGRAMMING LANGUAGES;

EID: 33749419632 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/11805618_19 Document Type: Conference Paper

Times cited : (23)

References (18)

1
- 84886941779
- The termination competition. http://www.lri.fr/~marche/termination- competition.
- The Termination Competition

2
- 84880246260
- Termination of simply typed term rewriting by translation and labelling
- LNCS 2706
- T. Aoto and T.Yamada. Termination of Simply Typed Term Rewriting by Translation and Labelling. In Proceedings of RTA, LNCS 2706:380-394, 2003.
- (2003) Proceedings of RTA , pp. 380-394
- Aoto, T.¹ Yamada, T.²

3
- 0001193616
- Termination of term rewriting using dependency pairs
- T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theor. Comput. Sci., 236(1-2):133-178, 2000.
- (2000) Theor. Comput. Sci. , vol.236 , Issue.1-2 , pp. 133-178
- Arts, T.¹ Giesl, J.²

4
- 0023437488
- Termination of rewriting systems by polynomial interpretations and its implementation
- A. B. Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Sci. Comput. Program., 9(2):137-159, 1987.
- (1987) Sci. Comput. Program. , vol.9 , Issue.2 , pp. 137-159
- Cherifa, A.B.¹ Lescanne, P.²

5
- 3042639683
- E. Contejean, C. Marché, B. Monate, and X. Urbain. Proving termination of rewriting with CiME. 71-73, 2003. http://cime.lri.fr.
- (2003) Proving Termination of Rewriting with CiME , pp. 71-73
- Contejean, E.¹ Marché, C.² Monate, B.³ Urbain, X.⁴

6
- 0001138255
- Orderings for term-rewriting systems
- N. Dershowitz. Orderings for term-rewriting systems. Theor. Comput. Sci., 17:279-301, 1982.
- (1982) Theor. Comput. Sci. , vol.17 , pp. 279-301
- Dershowitz, N.¹

7
- 84947944232
- Dummy elimination: Making termination easier
- LNCS 965
- M. C. F. Ferreira and H. Zantema. Dummy elimination: Making termination easier. In Proceedings of FCT, LNCS 965:243-252, 1995.
- (1995) Proceedings of FCT , pp. 243-252
- Ferreira, M.C.F.¹ Zantema, H.²

8
- 35048887144
- Automated termination proofs with AProVE
- LNCS 3091
- J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In Proceedings of RTA, LNCS 3091:210-220, 2004.
- (2004) Proceedings of RTA , pp. 210-220
- Giesl, J.¹ Thiemann, R.² Schneider-Kamp, P.³ Falke, S.⁴

9
- 84947789233
- Liveness in rewriting
- LNCS 2706
- J. Giesl and H. Zantema. Liveness in rewriting. In Proceedings of RTA, LNCS 2706:321-336, 2003.
- (2003) Proceedings of RTA , pp. 321-336
- Giesl, J.¹ Zantema, H.²

10
- 0022913962
- Proof of termination of the rewriting system SUBST on CCL
- T. Hardin and A. Laville. Proof of termination of the rewriting system SUBST on CCL. Theor. Comput. Sci., 46(2-3):305-312, 1986.
- (1986) Theor. Comput. Sci. , vol.46 , Issue.2-3 , pp. 305-312
- Hardin, T.¹ Laville, A.²

11
- 22944445114
- Tyrolean termination tool
- LNCS 3467
- N. Hirokawa and A. Middeldorp. Tyrolean termination tool. In Proceedings of RTA, LNCS 3467:175-184, 2005.
- (2005) Proceedings of RTA , pp. 175-184
- Hirokawa, N.¹ Middeldorp, A.²

12
- 33646194152
- Proving liveness with fairness using rewriting
- LNCS 3717
- A. Koprowski and H. Zantema. Proving liveness with fairness using rewriting. In Proceedings of FroCoS, LNCS 3717:232-247, 2005.
- (2005) Proceedings of FroCoS , pp. 232-247
- Koprowski, A.¹ Zantema, H.²

13
- 33749378478
- Automation of recursive path ordering for infinite labelled rewrite systems
- J.Harrison, editor, LNCS
- A. Koprowski and H. Zantema. Automation of recursive path ordering for infinite labelled rewrite systems. In J.Harrison, editor, IJCAR '06, LNCS, 2006.
- (2006) IJCAR '06
- Koprowski, A.¹ Zantema, H.²

14
- 0003916809
- On proving term rewriting systems are noetherian
- Louisiana Tech. Univ., Ruston
- D. S. Lankford. On proving term rewriting systems are noetherian. Tech. Rep. MTP-3, Louisiana Tech. Univ., Ruston, 1979.
- (1979) Tech. Rep. , vol.MTP-3
- Lankford, D.S.¹

15
- 33745478098
- Termination of fair computations in term rewriting
- LNCS 3835
- S. Lucas and J. Meseguer. Termination of fair computations in term rewriting. In Proceedings of LPAR, LNCS 3835:184-198, 2005.
- (2005) Proceedings of LPAR , pp. 184-198
- Lucas, S.¹ Meseguer, J.²

16
- 0002204834
- Termination of term rewriting by semantic labelling
- H. Zantema. Termination of term rewriting by semantic labelling. Fundam. Inform., 24(1/2):89-105, 1995.
- (1995) Fundam. Inform. , vol.24 , Issue.1-2 , pp. 89-105
- Zantema, H.¹

17
- 33749619433
- Torpa: Termination of rewriting proved automatically
- LNCS 3091
- H. Zantema. Torpa: Termination of rewriting proved automatically. In Proceedings of RTA, LNCS 3091:95-104, 2004.
- (2004) Proceedings of RTA , pp. 95-104
- Zantema, H.¹

18
- 33749539714
- Reducing right-hand sides for termination
- LNCS 3838
- H. Zantema. Reducing right-hand sides for termination. In Processes, Terms and Cycles, LNCS 3838:173-197, 2005.
- (2005) Processes, Terms and Cycles , pp. 173-197
- Zantema, H.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.