메뉴 건너뛰기




Volumn , Issue , 2006, Pages 134-141

Assume-guarantee reasoning for deadlock

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC FAILURE AUTOMATON; FAILURE AUTOMATA; REGULAR FAILURE SETS;

EID: 34547476152     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2006.8     Document Type: Conference Paper
Times cited : (11)

References (27)
  • 1
    • 23844438475 scopus 로고    scopus 로고
    • Compositionality: The Significant Difference, International Symposium, COMPOS'97, Revised Lectures
    • W. P. de Roever, H. Langmaack, and A. Pnueli, Eds, Springer
    • W. P. de Roever, H. Langmaack, and A. Pnueli, Eds., Compositionality: The Significant Difference, International Symposium, COMPOS'97, Revised Lectures, ser. LNCS, vol. 1536. Springer, 1998.
    • (1998) ser. LNCS , vol.1536
  • 2
    • 0002869231 scopus 로고    scopus 로고
    • A compositional rule for hardware design refinement
    • K. McMillan, "A compositional rule for hardware design refinement," in Proc. of CAV, 1997.
    • (1997) Proc. of CAV
    • McMillan, K.1
  • 3
    • 0028427381 scopus 로고
    • Model checking and modular verification
    • May
    • O. Grumberg and D. E. Long, "Model checking and modular verification," TOPLAS, vol. 16, no. 3, pp. 843-871, May 1994.
    • (1994) TOPLAS , vol.16 , Issue.3 , pp. 843-871
    • Grumberg, O.1    Long, D.E.2
  • 4
    • 0038357007 scopus 로고
    • In transition from global to modular temporal reasoning about programs
    • A. Pnueli, "In transition from global to modular temporal reasoning about programs," Logics and models of concurrent systems, vol. 13, pp. 123-144, 1985.
    • (1985) Logics and models of concurrent systems , vol.13 , pp. 123-144
    • Pnueli, A.1
  • 7
    • 0023453626 scopus 로고
    • Learning regular sets from queries and counterexamples
    • D. Angluin, "Learning regular sets from queries and counterexamples," Information and Computation, vol. 75, no. 2, pp. 87-106, 1987.
    • (1987) Information and Computation , vol.75 , Issue.2 , pp. 87-106
    • Angluin, D.1
  • 8
    • 26444568101 scopus 로고    scopus 로고
    • Automated assume-guarantee reasoning for simulation conformance
    • S. Chaki, E. M. Clarke, N. Sinha, and P. Thati, "Automated assume-guarantee reasoning for simulation conformance," in Proc. of CAV, 2005, pp. 534-547.
    • (2005) Proc. of CAV , pp. 534-547
    • Chaki, S.1    Clarke, E.M.2    Sinha, N.3    Thati, P.4
  • 13
    • 29144521934 scopus 로고    scopus 로고
    • Synthesis of interface specifications for Java classes
    • R. Alur, P. Cerný, P. Madhusudan, and W. Nam, "Synthesis of interface specifications for Java classes." in Proc. of POPL, 2005, pp. 98-109.
    • (2005) Proc. of POPL , pp. 98-109
    • Alur, R.1    Cerný, P.2    Madhusudan, P.3    Nam, W.4
  • 14
    • 26444609276 scopus 로고    scopus 로고
    • Regular model checking using inference of regular languages
    • P. Habermehl and T. Vojnar, "Regular model checking using inference of regular languages," in Proc. of INFINITY'04, 2004.
    • (2004) Proc. of INFINITY'04
    • Habermehl, P.1    Vojnar, T.2
  • 15
    • 0032639445 scopus 로고    scopus 로고
    • Dynamically discovering likely program invariants to support program evolution
    • M. Ernst, J. Cockrell, W. Griswold, and D. Notkin, "Dynamically discovering likely program invariants to support program evolution," in Proc. of ICSE, 1999.
    • (1999) Proc. of ICSE
    • Ernst, M.1    Cockrell, J.2    Griswold, W.3    Notkin, D.4
  • 16
    • 33745769158 scopus 로고    scopus 로고
    • Symbolic compositional verification by learning assumptions
    • R. Alur, P. Madhusudan, and W. Nam, "Symbolic compositional verification by learning assumptions," in Proc. of CAV, 2005.
    • (2005) Proc. of CAV
    • Alur, R.1    Madhusudan, P.2    Nam, W.3
  • 18
    • 0031125520 scopus 로고    scopus 로고
    • Supervisory control using failure semantics and partial specifications
    • April
    • A. Overkamp, "Supervisory control using failure semantics and partial specifications," Automatic Control, IEEE Transactions on, vol. 42, no. 4, pp. 498-510, April 1997.
    • (1997) Automatic Control, IEEE Transactions on , vol.42 , Issue.4 , pp. 498-510
    • Overkamp, A.1
  • 19
    • 26444601186 scopus 로고    scopus 로고
    • Static deadlock detection for Java libraries
    • A. Williams, W. Thies, and M. D. Ernst, "Static deadlock detection for Java libraries," in Proc. of ECOOP, 2005, pp. 602-629.
    • (2005) Proc. of ECOOP , pp. 602-629
    • Williams, A.1    Thies, W.2    Ernst, M.D.3
  • 20
    • 26444440346 scopus 로고    scopus 로고
    • Reasoning about threads communicating via locks
    • V. Kahlon, F. Ivancic, and A. Gupta, "Reasoning about threads communicating via locks." in Proc. of CAV, 2005, pp. 505-518.
    • (2005) Proc. of CAV , pp. 505-518
    • Kahlon, V.1    Ivancic, F.2    Gupta, A.3
  • 23
    • 0042353271 scopus 로고
    • Deadlock analysis in networks of communicating processes
    • S. D. Brookes and A. W. Roscoe, "Deadlock analysis in networks of communicating processes." Distributed Computing, vol. 4, pp. 209-230, 1991.
    • (1991) Distributed Computing , vol.4 , pp. 209-230
    • Brookes, S.D.1    Roscoe, A.W.2
  • 25
    • 34547476152 scopus 로고    scopus 로고
    • Software Engineering Institute, Pittsburgh, PA, Technical note CMU/SEI-2006-TN-028
    • S. Chaki and N. Sinha, "Assume-guarantee reasoning for dead-lock," Software Engineering Institute, Pittsburgh, PA, Technical note CMU/SEI-2006-TN-028, 2006.
    • (2006) Assume-guarantee reasoning for dead-lock
    • Chaki, S.1    Sinha, N.2
  • 27
    • 5044232533 scopus 로고    scopus 로고
    • Automata on guarded strings and applications
    • D. Kozen, "Automata on guarded strings and applications," in Matematica Contempornea 24 (2003), pp. 117-139.
    • (2003) Matematica Contempornea , vol.24 , pp. 117-139
    • Kozen, D.1


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