메뉴 건너뛰기




Volumn 1680, Issue , 1999, Pages 168-183

Assume-guarantee model checking of software: A comparative case study

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84948133628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48234-2_14     Document Type: Conference Paper
Times cited : (65)

References (29)
  • 2
    • 0027147976 scopus 로고
    • State-based model checking of event-driven system requirements
    • June
    • J. Atlee and J. Gannon. State-based model checking of event-driven system requirements. IEEE Transactions on Software Engineering, 19(1):24-40, June 1993.
    • (1993) IEEE Transactions on Software Engineering , vol.19 , Issue.1 , pp. 24-40
    • Atlee, J.1    Gannon, J.2
  • 4
    • 0003392260 scopus 로고    scopus 로고
    • An Empirical Comparison of Static Concurrency Analysis Techniques
    • University of Massachusetts at Amherst, May
    • A.T. Chamillard. An Empirical Comparison of Static Concurrency Analysis Techniques. PhD thesis, University of Massachusetts at Amherst, May 1996.
    • (1996) PhD thesis
    • Chamillard, A.T.1
  • 6
    • 0022706656 scopus 로고
    • Automatic verification of finite-state concurrent systems using temporal logic specifications
    • April
    • E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, April 1986.
    • (1986) ACM Transactions on Programming Languages and Systems , vol.8 , Issue.2 , pp. 244-263
    • Clarke, E.M.1    Emerson, E.A.2    Sistla, A.P.3
  • 7
    • 0000706110 scopus 로고    scopus 로고
    • Evaluating deadlock detection methods for concurrent software
    • March
    • J.C. Corbett. Evaluating deadlock detection methods for concurrent software. IEEE Transactions on Software Engineering, 22(3), March 1996.
    • (1996) IEEE Transactions on Software Engineering , vol.22 , Issue.3
    • Corbett, J.C.1
  • 10
    • 84948134048 scopus 로고    scopus 로고
    • Model checking generic container implementations
    • Lecture Notes in Computer Science, Dagstuhl Castle, Germany, to appear
    • M.B. Dwyer and C.S. Păsăreanu. Model checking generic container implementations. In Generic Programing: Proceedings of a Dagstuhl Seminar, Lecture Notes in Computer Science, Dagstuhl Castle, Germany, 1998. to appear.
    • (1998) Generic Programing: Proceedings of a Dagstuhl Seminar
    • Dwyer, M.B.1    Păsăreanu, C.S.2
  • 11
    • 0343134253 scopus 로고    scopus 로고
    • Translating ada programs for model checking: A tutorial
    • Kansas State University, Department of Computing and Information Sciences
    • M.B. Dwyer, C.S. Păsăreanu, and J.C. Corbett. Translating ada programs for model checking: A tutorial. Technical Report 98-12, Kansas State University, Department of Computing and Information Sciences, 1998.
    • (1998) Technical Report 98-12
    • Dwyer, M.B.1    Păsăreanu, C.S.2    Corbett, J.C.3
  • 17
    • 84948148534 scopus 로고    scopus 로고
    • A concurrency analysis tool for java programs
    • Polytechnic University of Turin, August
    • R. Iosef. A concurrency analysis tool for java programs. Master’s thesis, Polytechnic University of Turin, August 1997.
    • (1997) Master’s thesis
    • Iosef, R.1
  • 19
    • 84947733929 scopus 로고
    • On the complexity of branching modular model checking (extended abstract)
    • sup Lee and Scott A. Smolka, editors, Lecture Notes in Computer Science, Philadelphia, Pennsylvania, 21-24 August, Springer-Verlag
    • O. Kupferman and M.Y. Vardi. On the complexity of branching modular model checking (extended abstract). In Insup Lee and Scott A. Smolka, editors, CONCUR '95: Concurrency Theory, 6th International Conference, volume 962 of Lecture Notes in Computer Science, pages 408-422, Philadelphia, Pennsylvania, 21-24 August 1995. Springer-Verlag.
    • (1995) CONCUR '95: Concurrency Theory, 6th International Conference , vol.962 , pp. 408-422
    • Kupferman, O.1    Vardi, M.Y.2
  • 23
    • 84949450928 scopus 로고    scopus 로고
    • Applying static analysis to software architectures
    • 1301. The 6th European Software Engineering Conference held jointly with the 5th ACM SIGSOFT Symposium on the Foundations of Software Engineering, September
    • G.N. Naumovich, G.S. Avrunin, L.A. Clarke, and L.J. Osterweil. Applying static analysis to software architectures. In LNCS 1301. The 6th European Software Engineering Conference held jointly with the 5th ACM SIGSOFT Symposium on the Foundations of Software Engineering, September 1997.
    • (1997) LNCS
    • Naumovich, G.N.1    Avrunin, G.S.2    Clarke, L.A.3    Osterweil, L.J.4
  • 24
    • 84948180216 scopus 로고    scopus 로고
    • Modular Verification of Software Units
    • Kansas State University, Department of Computing and Information Sciences
    • C.S. Păsăreanu, M.B. Dwyer, and M. Huth. Modular Verification of Software Units. Technical Report 98-15, Kansas State University, Department of Computing and Information Sciences, 1998.
    • (1998) Technical Report 98-15
    • Păsăreanu, C.S.1    Dwyer, M.B.2    Huth, M.3
  • 26
    • 0038357007 scopus 로고
    • In transition from global to modular temporal reasoning about programs
    • K. Apt, editor, Springer-Verlag
    • A. Pnueli. In transition from global to modular temporal reasoning about programs. In K. Apt, editor, Logics and Models of Concurrent Systems, pages 123-144. Springer-Verlag, 1985.
    • (1985) Logics and Models of Concurrent Systems , pp. 123-144
    • Pnueli, A.1
  • 27
    • 0029181195 scopus 로고
    • On the complexity of modular model checking
    • San Diego, California, 26-29 June, IEEE Computer Society Press
    • M.Y. Vardi. On the complexity of modular model checking. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 101-111, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.
    • (1995) Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science , pp. 101-111
    • Vardi, M.Y.1
  • 28
    • 85051051500 scopus 로고
    • Specifying interesting properties of programs in propositional temporal logics
    • St. Petersburg, Fla., January
    • P. Wolper. Specifying interesting properties of programs in propositional temporal logics. In Proceedings of the 13th ACM Symposium on Principles of Programming Languages, pages 184-193, St. Petersburg, Fla., January 1986.
    • (1986) Proceedings of the 13th ACM Symposium on Principles of Programming Languages , pp. 184-193
    • Wolper, P.1


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