메뉴 건너뛰기




Volumn , Issue , 2001, Pages 135-143

Monitoring programs using rewriting

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTER CIRCUITS; JAVA PROGRAMMING LANGUAGE; SOFTWARE TESTING; TEMPORAL LOGIC;

EID: 85116922800     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2001.989799     Document Type: Conference Paper
Times cited : (169)

References (28)
  • 4
    • 0032679915 scopus 로고    scopus 로고
    • A deadlock detection tool for concurrent Java programs
    • July
    • C. Demartini, R. Iosif, and R. Sisto. A Deadlock Detection Tool for Concurrent Java Programs. Software Practice and Experience, 29(7):577-603, July 1999.
    • (1999) Software Practice and Experience , vol.29 , Issue.7 , pp. 577-603
    • Demartini, C.1    Iosif, R.2    Sisto, R.3
  • 10
    • 0035417837 scopus 로고    scopus 로고
    • Formal analysis of a space craft controller using SPIN
    • Aug. An earlier version occurred in the Proceedings of the 4th SPIN workshop, 1998, Paris, France
    • K. Havelund, M. R. Lowry, and J. Penix. Formal Analysis of a Space Craft Controller using SPIN. IEEE Transactions on Software Engineering, 27(8):749-765, Aug. 2001. An earlier version occurred in the Proceedings of the 4th SPIN workshop, 1998, Paris, France.
    • (2001) IEEE Transactions on Software Engineering , vol.27 , Issue.8 , pp. 749-765
    • Havelund, K.1    Lowry, M.R.2    Penix, J.3
  • 11
    • 84896693469 scopus 로고    scopus 로고
    • Model checking Java programs using Java PathFinder
    • Apr. Special of STTT containing selected submissions to the 4th SPIN workshop, Paris, France, 1998
    • K. Havelund and T. Pressburger. Model Checking Java Programs using Java PathFinder. International Journal on Software Tools for Technology Transfer, 2(4):366-381, Apr. 2000. Special issue of STTT containing selected submissions to the 4th SPIN workshop, Paris, France, 1998.
    • (2000) International Journal on Software Tools for Technology Transfer , vol.2 , Issue.4 , pp. 366-381
    • Havelund, K.1    Pressburger, T.2
  • 12
    • 33751042050 scopus 로고    scopus 로고
    • Testing linear temporal logic formulae on finite execution traces
    • November
    • K. Havelund and G. Roşu. Testing Linear Temporal Logic Formulae on Finite Execution Traces. RIACS Technical report, http://ase.arc.nasa.gov/pax, November 2000.
    • (2000) RIACS Technical Report
    • Havelund, K.1    Roşu, G.2
  • 19
    • 0027113376 scopus 로고
    • Conditional rewriting logic as a unified model of concurrency
    • J. Meseguer. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science, pages 73-155, 1992.
    • (1992) Theoretical Computer Science , pp. 73-155
    • Meseguer, J.1
  • 25
    • 0242444344 scopus 로고    scopus 로고
    • Synthesizing dynamic programming algorithms from linear temporal logic formulae
    • January
    • G. Roşu and K. Havelund. Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae. RIACS Technical report, http://ase.arc.nasa.gov/pax, January 2001.
    • (2001) RIACS Technical Report
    • Roşu, G.1    Havelund, K.2
  • 26
    • 0008354110 scopus 로고
    • Computer Science Laboratory, SRI International, Menlo Park, CA, Feb. Also Tutorial Notes, Formal Methods Europe 93: Industrial-Strength Formal Methods, Odense, Denmark, April 1993
    • N. Shankar, S. Owre, and J. M. Rushby. PVS Tutorial. Computer Science Laboratory, SRI International, Menlo Park, CA, Feb. 1993. Also appears in Tutorial Notes, Formal Methods Europe '93: Industrial-Strength Formal Methods, pages 357-406, Odense, Denmark, April 1993.
    • (1993) PVS Tutorial , pp. 357-406
    • Shankar, N.1    Owre, S.2    Rushby, J.M.3


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