메뉴 건너뛰기




Volumn , Issue , 2003, Pages 28-37

A strategy for efficiently verifying requirements specifications using composition and invariants

Author keywords

compositional verification; formal methods; invariants; model checking; requirements specification; software tools

Indexed keywords

AUTOMATICALLY GENERATED; COMPOSITIONAL VERIFICATION; CRUISE CONTROL SYSTEMS; MODEL CHECKER; NAVY SYSTEMS; PARALLEL COMPOSITION; PROOF STRATEGY; REAL-WORLD; REQUIREMENTS SPECIFICATIONS; SOFTWARE COST REDUCTIONS; SOFTWARE TOOL; STATE-BASED; TABULAR NOTATION; THEOREM PROVERS; VERIFICATION PROBLEMS;

EID: 34748843540     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/940071.940077     Document Type: Conference Paper
Times cited : (12)

References (37)
  • 4
    • 0034558156 scopus 로고    scopus 로고
    • TAME: Using PVS strategies for special-purpose theorem proving
    • February
    • M. Archer. TAME: Using PVS strategies for special-purpose theorem proving. Annals of Mathematics and Artificial Intelligence, 29(1-4), February 2001.
    • (2001) Annals of Mathematics and Artificial Intelligence , vol.29 , Issue.1-4
    • Archer, M.1
  • 5
    • 0026953373 scopus 로고
    • The Esterel synchronous programming language: Design, semantics, implementation
    • G. Berry and G. Gonthier. The Esterel synchronous programming language: Design, semantics, implementation. Science of Computer Programming, 19, 1992.
    • (1992) Science of Computer Programming , vol.19
    • Berry, G.1    Gonthier, G.2
  • 7
    • 0032674648 scopus 로고    scopus 로고
    • Model checking complete requirements specifications using abstraction
    • Jan.
    • R. Bharadwaj and C. Heitmeyer. Model checking complete requirements specifications using abstraction. Automated Software Engineering Journal, 6(1), Jan. 1999.
    • (1999) Automated Software Engineering Journal , vol.6 , Issue.1
    • Bharadwaj, R.1    Heitmeyer, C.2
  • 9
    • 0019596077 scopus 로고
    • Proofs of networks of processes
    • Apr.
    • K. M. Chandy and J. Misra. Proofs of networks of processes. IEEE Trans. Softw. Engin., SE-7(4):417-426, Apr. 1981.
    • (1981) IEEE Trans. Softw. Engin. , vol.SE-7 , Issue.4 , pp. 417-426
    • Chandy, K.M.1    Misra, J.2
  • 14
    • 0026912203 scopus 로고
    • Programming and verifying real-time systems by means of the synchronous data-flow language LUSTRE
    • Sept.
    • N. Halbwachs, F. Lagnier, and C. Ratel. Programming and verifying real-time systems by means of the synchronous data-flow language LUSTRE. IEEE Trans. Softw. Engin., 18(9):785-793, Sept. 1992.
    • (1992) IEEE Trans. Softw. Engin. , vol.18 , Issue.9 , pp. 785-793
    • Halbwachs, N.1    Lagnier, F.2    Ratel, C.3
  • 15
    • 0037955055 scopus 로고    scopus 로고
    • Software Cost Reduction
    • In J. J. Marciniak, editor, John Wiley & Sons, Inc., New York, NY, second edition
    • C. Heitmeyer. Software Cost Reduction. In J. J. Marciniak, editor, Encyclopedia of Software Engineering. John Wiley & Sons, Inc., New York, NY, second edition, 2002.
    • (2002) Encyclopedia of Software Engineering
    • Heitmeyer, C.1
  • 17
    • 0032203845 scopus 로고    scopus 로고
    • Using abstraction and model checking to detect safety violations in requirements specifications
    • Nov.
    • C. Heitmeyer, J. Kirby, B. Labaw, M. Archer, and R. Bharadwaj. Using abstraction and model checking to detect safety violations in requirements specifications. IEEE Trans. on Softw. Eng., 24(11), Nov. 1998.
    • (1998) IEEE Trans. on Softw. Eng. , vol.24 , Issue.11
    • Heitmeyer, C.1    Kirby, J.2    Labaw, B.3    Archer, M.4    Bharadwaj, R.5
  • 25
    • 84903187338 scopus 로고    scopus 로고
    • Incremental verification by abstraction
    • In T. Margaria and W. Yi, editors, Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS'01), Springer-Verlag, Apr.
    • Y. Lakhnech, S. Bensalem, S. Berezin, and S. Owre. Incremental verification by abstraction. In T. Margaria and W. Yi, editors, Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS'01), number 2031 in LNCS, pages 98-112. Springer-Verlag, Apr. 2001.
    • (2001) LNCS , vol.2031 , pp. 98-112
    • Lakhnech, Y.1    Bensalem, S.2    Berezin, S.3    Owre, S.4
  • 26
    • 0003579895 scopus 로고
    • Technical Report STAN-CS-TR-94-1518, Stanford Univ., Stanford, CA, June
    • Z. Manna et al. STeP: the Stanford Temporal Prover. Technical Report STAN-CS-TR-94-1518, Stanford Univ., Stanford, CA, June 1994.
    • (1994) STeP: The Stanford Temporal Prover
    • Manna, Z.1
  • 30
    • 0033731380 scopus 로고    scopus 로고
    • A methodology for hardware verification using compositional model checking
    • K. L.McMillan. A methodology for hardware verification using compositional model checking. Science of Comput. Prog., 37:279-309, 2000.
    • (2000) Science of Comput. Prog. , vol.37 , pp. 279-309
    • McMillan, K.L.1
  • 31
    • 84944386630 scopus 로고    scopus 로고
    • On the completeness of compositional reasoning
    • In E. A. Emerson and A. P. Sistla, editors, Proc. Computer-Aided Verification (CAV'00), Chicago, IL, July 2000. Springer-Verlag
    • K. S. Namjoshi and R. J. Trefler. On the completeness of compositional reasoning. In E. A. Emerson and A. P. Sistla, editors, Proc. Computer-Aided Verification (CAV'00), Chicago, IL, July 2000. LNCS 1855, Springer-Verlag.
    • LNCS , vol.1855
    • Namjoshi, K.S.1    Trefler, R.J.2
  • 32
    • 0029387560 scopus 로고
    • Functional documentation for computer systems
    • Oct.
    • D. L. Parnas and J. Madey. Functional documentation for computer systems. Science of Computer Programming, 25(1):41-61, Oct. 1995.
    • (1995) Science of Computer Programming , vol.25 , Issue.1 , pp. 41-61
    • Parnas, D.L.1    Madey, J.2


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