메뉴 건너뛰기




Volumn 4915 LNCS, Issue , 2008, Pages 1-7

Proving termination with (Boolean) satisfaction

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; FOURIER TRANSFORMS; LEARNING ALGORITHMS;

EID: 58449130805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78769-3_1     Document Type: Conference Paper
Times cited : (3)

References (26)
  • 1
    • 0001193616 scopus 로고    scopus 로고
    • Termination of term rewriting using dependency pairs
    • Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133-178 (2000)
    • (2000) Theoretical Computer Science , vol.236 , Issue.1-2 , pp. 133-178
    • Arts, T.1    Giesl, J.2
  • 2
    • 33745803003 scopus 로고    scopus 로고
    • Size-Change Termination Analysis in κ-Bits
    • Sestoft, P, ed, ESOP 2006 and ETAPS 2006, Springer, Heidelberg
    • Codish, M., Lagoon, V., Schachte, P., Stuckey, P.J.: Size-Change Termination Analysis in κ-Bits. In: Sestoft, P. (ed.) ESOP 2006 and ETAPS 2006. LNCS, vol. 3924, pp. 230-245. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.3924 , pp. 230-245
    • Codish, M.1    Lagoon, V.2    Schachte, P.3    Stuckey, P.J.4
  • 3
    • 33749421246 scopus 로고    scopus 로고
    • Stuckey, P.J., Codish, M., Lagoon, V.: Solving Partial Order Constraints for LPO Termination, in: Pfenning, F. (ed.) RTA 2006. LNCS, 4098, pp. 4-18. Springer, Heidelberg (2006)
    • Stuckey, P.J., Codish, M., Lagoon, V.: Solving Partial Order Constraints for LPO Termination, in: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 4-18. Springer, Heidelberg (2006)
  • 5
    • 33845214865 scopus 로고    scopus 로고
    • Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R., Giesl, J.: SAT Solving for Argument Filterings. In: Hermann, M., Voronkov, A. (eds.) LPAR, 2006. LNCS (LNA1), 4246, pp. 30-44. Springer, Heidelberg (2006)
    • Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R., Giesl, J.: SAT Solving for Argument Filterings. In: Hermann, M., Voronkov, A. (eds.) LPAR, 2006. LNCS (LNA1), vol. 4246, pp. 30-44. Springer, Heidelberg (2006)
  • 6
    • 84919401135 scopus 로고
    • A machine program for theorem-proving
    • Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5(7), 394-397 (1962)
    • (1962) Commun. ACM , vol.5 , Issue.7 , pp. 394-397
    • Davis, M.1    Logemann, G.2    Loveland, D.W.3
  • 7
    • 0001138255 scopus 로고
    • Orderings for term-rewriting systems
    • Dershowitz, N.: Orderings for term-rewriting systems. Theoretical Computer Science 17, 279-301 (1982)
    • (1982) Theoretical Computer Science , vol.17 , pp. 279-301
    • Dershowitz, N.1
  • 9
    • 33749564303 scopus 로고    scopus 로고
    • Waldmann, J., Zantema, H., Endrullis, J.: Matrix Interpretations for Proving Termination of Term Rewriting. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), 4130, pp. 574-588. Springer, Heidelberg (2006)
    • Waldmann, J., Zantema, H., Endrullis, J.: Matrix Interpretations for Proving Termination of Term Rewriting. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 574-588. Springer, Heidelberg (2006)
  • 10
    • 38049141479 scopus 로고    scopus 로고
    • Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: SAT solving for termination analysis with polynomial interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, 4501, pp. 340-354. Springer, Heidelberg (2007)
    • Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: SAT solving for termination analysis with polynomial interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 340-354. Springer, Heidelberg (2007)
  • 11
    • 33749559876 scopus 로고    scopus 로고
    • Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), 4130, pp. 281-286. Springer, Heidelberg (2006)
    • Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 281-286. Springer, Heidelberg (2006)
  • 12
    • 35048887144 scopus 로고    scopus 로고
    • Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated Termination Proofs with AProVE. In: van O ostrom, V. (ed.) RTA 2004. LNCS, 3091, pp. 210-220. Springer, Heidelberg (2004)
    • Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated Termination Proofs with AProVE. In: van O ostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 210-220. Springer, Heidelberg (2004)
  • 13
    • 22944445114 scopus 로고    scopus 로고
    • Middeldorp, A., Hirokawa, N.: Tyrolean Termination Tool. In: Giesl, J. (ed.) RTA 2005. LNCS, 3467, pp. 175-184. Springer, Heidelberg (2005)
    • Middeldorp, A., Hirokawa, N.: Tyrolean Termination Tool. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 175-184. Springer, Heidelberg (2005)
  • 14
    • 33749409184 scopus 로고    scopus 로고
    • Waldmann, J., Hofbauer, D.: Termination of String Rewriting with Matrix Interpretations. In: Pfenning, F. (ed.) RTA 2006. LNCS, 4098, pp. 328-342. Springer, Heidelberg (2006)
    • Waldmann, J., Hofbauer, D.: Termination of String Rewriting with Matrix Interpretations. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 328-342. Springer, Heidelberg (2006)
  • 15
    • 58449110226 scopus 로고    scopus 로고
    • Kamin, S., Levy, J.-J.: Two generalizations of the recursive path ordering. In: Department of Computer Science, University of Illinois, Urbana, IL (viewed December 2005) (1980), http://www.ens-lyon.fr/LIP/REWRITING/0LD- PUBLICATI0NS-0N-TERMINATION
    • Kamin, S., Levy, J.-J.: Two generalizations of the recursive path ordering. In: Department of Computer Science, University of Illinois, Urbana, IL (viewed December 2005) (1980), http://www.ens-lyon.fr/LIP/REWRITING/0LD- PUBLICATI0NS-0N-TERMINATION
  • 17
    • 9444258628 scopus 로고    scopus 로고
    • Kurihara, M., Kondo, H.: Efficient BDD Encodings for Partial Order Constraints with Application to Expert Systems in Software Verification. In: Orchard, B., Yang, C., Ali, M. (eds.) IEA/AIE 2004. LNCS (LNAI), 3029, pp. 827-837. Springer, Heidelberg (2004)
    • Kurihara, M., Kondo, H.: Efficient BDD Encodings for Partial Order Constraints with Application to Expert Systems in Software Verification. In: Orchard, B., Yang, C., Ali, M. (eds.) IEA/AIE 2004. LNCS (LNAI), vol. 3029, pp. 827-837. Springer, Heidelberg (2004)
  • 19
    • 38049003457 scopus 로고    scopus 로고
    • Marché, C, Zantema, H.: The Termination Competition. In: Baader, F. (ed.) RTA 2007. LNCS, 4533, pp. 303-313. Springer, Heidelberg (2007) (To appear)
    • Marché, C, Zantema, H.: The Termination Competition. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 303-313. Springer, Heidelberg (2007) (To appear)
  • 20
    • 58449084314 scopus 로고    scopus 로고
    • MiniSAT solver. Viewed( December 2005), http://www.cs.Chalmers.se/Cs/ Reseaxch/FormalMethods/MiniSat
    • MiniSAT solver. Viewed( December 2005), http://www.cs.Chalmers.se/Cs/ Reseaxch/FormalMethods/MiniSat
  • 22
    • 38049083693 scopus 로고    scopus 로고
    • Schneider-Kamp, P., Thiemann, R., Annov, E., Codish, M., Giesl, J.: Proving Termination Using Recursive Path Orders and SAT Solving. In: Konev, B., Wolter,F. (eds.) FroCos 2007. LNCS (LNAI), 4720, pp. 267-282. Springer, Heidelberg (2007)
    • Schneider-Kamp, P., Thiemann, R., Annov, E., Codish, M., Giesl, J.: Proving Termination Using Recursive Path Orders and SAT Solving. In: Konev, B., Wolter,F. (eds.) FroCos 2007. LNCS (LNAI), vol. 4720, pp. 267-282. Springer, Heidelberg (2007)
  • 23
    • 35048857505 scopus 로고    scopus 로고
    • Talupur, M., Sinha, N., Strichman, O., Pnueli, A.: Range allocation for separation logic. In: CAV, pp. 148-161 (2004)
    • Talupur, M., Sinha, N., Strichman, O., Pnueli, A.: Range allocation for separation logic. In: CAV, pp. 148-161 (2004)
  • 26
    • 38049169152 scopus 로고    scopus 로고
    • Middeldorp, A., Zankl, H.: Satisfying KBO Constraints. In: Baader, F. (ed.) RTA 2007. LNCS, 4533, pp. 389-403. Springer, Heidelberg (2007)
    • Middeldorp, A., Zankl, H.: Satisfying KBO Constraints. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 389-403. Springer, Heidelberg (2007)


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