메뉴 건너뛰기




Volumn 26, Issue , 2004, Pages 635-644

Heuristic-based model refinement for FLAVERS

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; CONSTRAINT THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

EID: 4544373208     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (28)
  • 1
    • 0003595275 scopus 로고    scopus 로고
    • Comparing finite-state verification techniques for concurrent software
    • Department of Computer Science, U. of Massachusetts Amherst, Nov.
    • G. S. Avrunin, J. C. Corbett, M. B. Dwyer, C. S. Pǎsǎreanu, and S. F. Siegel. Comparing finite-state verification techniques for concurrent software. TR UM-CS-1999-069, Department of Computer Science, U. of Massachusetts Amherst, Nov. 1999.
    • (1999) TR , vol.UM-CS-1999-069
    • Avrunin, G.S.1    Corbett, J.C.2    Dwyer, M.B.3    Pǎsǎreanu, C.S.4    Siegel, S.F.5
  • 3
    • 4243189286 scopus 로고    scopus 로고
    • Counterexample-guided abstraction refinement for symbolic model checking
    • Sep.
    • E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement for symbolic model checking. Journal of the ACM, 50(5):752-794, Sep. 2003.
    • (2003) Journal of the ACM , vol.50 , Issue.5 , pp. 752-794
    • Clarke, E.M.1    Grumberg, O.2    Jha, S.3    Lu, Y.4    Veith, H.5
  • 5
    • 0035001143 scopus 로고    scopus 로고
    • The right algorithm at the right time: Comparing data flow analysis algorithms for finite state verification
    • IEEE Computer Society, May
    • J. M. Cobleigh, L. A. Clarke, and L. J. Osterweil. The right algorithm at the right time: Comparing data flow analysis algorithms for finite state verification. In Proc. of the 23rd Int. Conf. on Software Engineering, pages 37-46. IEEE Computer Society, May 2001.
    • (2001) Proc. of the 23rd Int. Conf. on Software Engineering , pp. 37-46
    • Cobleigh, J.M.1    Clarke, L.A.2    Osterweil, L.J.3
  • 11
    • 4544353200 scopus 로고    scopus 로고
    • Flow analysis for verifying properties of concurrent systems
    • Department of Computer Science, U. of Massachusetts Amherst, Sep.
    • M. B. Dwyer, L. A. Clarke, J. M. Cobleigh, and G. Naumovich. Flow analysis for verifying properties of concurrent systems. TR UM-CS-2003-030, Department of Computer Science, U. of Massachusetts Amherst, Sep. 2003.
    • (2003) TR , vol.UM-CS-2003-030
    • Dwyer, M.B.1    Clarke, L.A.2    Cobleigh, J.M.3    Naumovich, G.4
  • 15
    • 0032203845 scopus 로고    scopus 로고
    • Using abstraction and model checking to detect safety violations in requirements specifications
    • Nov.
    • C. Heitmeyer, J. Kirby, Jr., B. Labaw, M. Archer, and R. Bharadwaj. Using abstraction and model checking to detect safety violations in requirements specifications. IEEE Trans. on Software Engineering, 24(11):927-948, Nov. 1998.
    • (1998) IEEE Trans. on Software Engineering , vol.24 , Issue.11 , pp. 927-948
    • Heitmeyer, C.1    Kirby Jr., J.2    Labaw, B.3    Archer, M.4    Bharadwaj, R.5
  • 18
    • 0025548384 scopus 로고
    • Properties of data flow frameworks: A unified model
    • Dec.
    • T. J. Marlowe and B. G. Ryder. Properties of data flow frameworks: a unified model. Acta Informatica, 28(2):121-163, Dec. 1990.
    • (1990) Acta Informatica , vol.28 , Issue.2 , pp. 121-163
    • Marlowe, T.J.1    Ryder, B.G.2
  • 26
    • 4544374766 scopus 로고    scopus 로고
    • Heuristic-based model refinement for FLAVERS
    • Department of Computer Science, U. of Massachusetts Amherst, Sep.
    • J. Tan, G. S. Avrunin, and L. A. Clarke. Heuristic-based model refinement for FLAVERS. TR UM-CS-2003-029, Department of Computer Science, U. of Massachusetts Amherst, Sep. 2003.
    • (2003) TR , vol.UM-CS-2003-029
    • Tan, J.1    Avrunin, G.S.2    Clarke, L.A.3


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