메뉴 건너뛰기




Volumn 2, Issue , 2008, Pages 175-186

Abstraction refinement for games with incomplete information

Author keywords

Automatic abstraction refinement; Synthesis

Indexed keywords

ABSTRACTION REFINEMENT; AUTOMATIC ABSTRACTIONS; COUNTEREXAMPLE-GUIDED ABSTRACTION REFINEMENT; FINITE-STATE ABSTRACTION; GAMES WITH INCOMPLETE INFORMATION; INCOMPLETE INFORMATION; INFINITE STATE SYSTEMS; SUFFICIENT CONDITIONS;

EID: 84868228097     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (14)

References (10)
  • 1
    • 35048831388 scopus 로고    scopus 로고
    • Refining approximations in software predicate abstraction
    • Springer
    • T. Ball, B. Cook, S. Das, and S. K. Rajamani. Refining approximations in software predicate abstraction. In TACAS, Volume 2988 of LNCS, pages 388-403. Springer, 2004.
    • (2004) TACAS, Volume 2988 of LNCS , pp. 388-403
    • Ball, T.1    Cook, B.2    Das, S.3    Rajamani, S.K.4
  • 3
    • 84948134383 scopus 로고    scopus 로고
    • Counter-example based predicate discovery in predicate abstraction
    • London, UK Springer-Verlag
    • S. Das and D. L. Dill. Counter-example based predicate discovery in predicate abstraction. In Proc. FMCAD, pages 19-32, London, UK, 2002. Springer-Verlag.
    • (2002) Proc. FMCAD , pp. 19-32
    • Das, S.1    Dill, D.L.2
  • 4
    • 38149129342 scopus 로고    scopus 로고
    • Solving games via three-valued abstraction refinement
    • Springer-Verlag
    • L. de Alfaro and P. Roy. Solving games via three-valued abstraction refinement. In Proc. CONCUR, volume 4703, pages 74-89. Springer-Verlag, 2007.
    • (2007) Proc. CONCUR , vol.4703 , pp. 74-89
    • De Alfaro, L.1    Roy, P.2
  • 5
    • 33745798431 scopus 로고    scopus 로고
    • A lattice theory for solving games of imperfect information
    • LNCS Springer-Verlag
    • M. De Wulf, L. Doyen, and J.-F. Raskin. A lattice theory for solving games of imperfect information. In Proc. HSCC, LNCS, pages 153-168. Springer-Verlag, 2006.
    • (2006) Proc. HSCC , pp. 153-168
    • De Wulf, M.1    Doyen, L.2    Raskin, J.-F.3
  • 8
    • 33745777418 scopus 로고    scopus 로고
    • A practical and complete approach to predicate refinement
    • Springer-Verlag
    • R. Jhala and K. L. McMillan. A practical and complete approach to predicate refinement. In Proc. TACAS, volume 3920, pages 459-473. Springer-Verlag, 2006.
    • (2006) Proc. TACAS , vol.3920 , pp. 459-473
    • Jhala, R.1    McMillan, K.L.2
  • 9
    • 0021504983 scopus 로고
    • The complexity of two-player games of incomplete information
    • J. H. Reif. The complexity of two-player games of incomplete information. J. Comput. Syst. Sci., 29(2): 274-301, 1984.
    • (1984) J. Comput. Syst. Sci. , vol.29 , Issue.2 , pp. 274-301
    • Reif, J.H.1


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