메뉴 건너뛰기




Volumn 125, Issue 2, 2005, Pages 45-65

PVS strategies for proving abstraction properties of automata

Author keywords

Abstraction; Forward Simulation; I O Automata; Mechanical Theorem Proving; Refinement; Strategies

Indexed keywords

ABSTRACTING; AUTOMATION; COMPUTER SIMULATION; INTERACTIVE COMPUTER SYSTEMS; INVARIANCE; LARGE SCALE SYSTEMS; SPECIFICATIONS; THEOREM PROVING;

EID: 14744268098     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.01.005     Document Type: Conference Paper
Times cited : (14)

References (17)
  • 2
    • 0034558156 scopus 로고    scopus 로고
    • TAME: Using PVS strategies for special-purpose theorem proving
    • Myla Archer. TAME: Using PVS strategies for special-purpose theorem proving. Annals of Math. and Artif. Intel., 29(1-4):139-181, 2000.
    • (2000) Annals of Math. and Artif. Intel. , vol.29 , Issue.1-4 , pp. 139-181
    • Archer, M.1
  • 4
    • 0034205467 scopus 로고    scopus 로고
    • Verification of a leader election protocol - Formal methods applied to IEEE 1394
    • June
    • M. Devillers, D. Griffioen, J. Romijn, and F. Vaandrager. Verification of a leader election protocol - formal methods applied to IEEE 1394. Formal Methods in System Design, 16(3):307-320, June 2000.
    • (2000) Formal Methods in System Design , vol.16 , Issue.3 , pp. 307-320
    • Devillers, M.1    Griffioen, D.2    Romijn, J.3    Vaandrager, F.4
  • 5
    • 14744269695 scopus 로고    scopus 로고
    • A PVS prover strategy package for common manipulations
    • NASA Langley Research Center, Hampton, VA, April
    • B. Di Vito. A PVS prover strategy package for common manipulations. Technical Memorandum NASA/TM-2002-211647, NASA Langley Research Center, Hampton, VA, April 2002.
    • (2002) Technical Memorandum , vol.NASA-TM-2002-211647
    • Di Vito, B.1
  • 7
    • 14744275819 scopus 로고    scopus 로고
    • The theory of timed I/O automata
    • MIT Laboratory for Computer Science
    • Dilsun Kaynar, Nancy Lynch, Roberto Segala, and Frits Vaandrager. The theory of timed I/O automata. Technical Report MIT/LCS/TR-917a, MIT Laboratory for Computer Science, 2004. Available at http://theory.lcs.mit.edu/tds/reflist. html.
    • (2004) Technical Report , vol.MIT-LCS-TR-917A
    • Kaynar, D.1    Lynch, N.2    Segala, R.3    Vaandrager, F.4
  • 9
    • 0002658813 scopus 로고    scopus 로고
    • Forward and backward simulations - Part II: Timing-based systems
    • July
    • N. Lynch and F. Vaandrager. Forward and backward simulations - Part II: Timing-based systems. Information and Computation, 128(1):1-25, July 1996.
    • (1996) Information and Computation , vol.128 , Issue.1 , pp. 1-25
    • Lynch, N.1    Vaandrager, F.2
  • 11
    • 84936039193 scopus 로고
    • Time constrained automata
    • J. C. M. Baeten and J. F. Goote, eds., CONCUR'91: 2nd Intern. Conference on Concurrency Theory, Springer-Verlag
    • M. Merritt, F. Modugno, and M. R. Tuttle. Time constrained automata. In J. C. M. Baeten and J. F. Goote, eds., CONCUR'91: 2nd Intern. Conference on Concurrency Theory, vol. 527 of Lect. Notes in Comp. Sci. Springer-Verlag, 1991.
    • (1991) Lect. Notes in Comp. Sci. , vol.527
    • Merritt, M.1    Modugno, F.2    Tuttle, M.R.3
  • 12
  • 13
    • 14744281673 scopus 로고    scopus 로고
    • Real automation in the field
    • NASA/CR-2001-211271, ICASE, Mail Stop 132C, NASA Langley Research Center, Hampton, VA 23681-2199, USA, December
    • C. Muñoz and M. Mayero. Real automation in the field. Technical Report Interim ICASE Report No. 39, NASA/CR-2001-211271, ICASE, Mail Stop 132C, NASA Langley Research Center, Hampton, VA 23681-2199, USA, December 2001.
    • (2001) Technical Report Interim ICASE Report No. 39 , vol.39
    • Muñoz, C.1    Mayero, M.2
  • 15
    • 14744275497 scopus 로고    scopus 로고
    • Theory Interpretations in PVS
    • Computer Science Lab., SRI Intl., Menlo Park, CA, April Draft
    • S. Owre and N. Shankar. Theory Interpretations in PVS. Technical report, Computer Science Lab., SRI Intl., Menlo Park, CA, April 2001. Draft.
    • (2001) Technical Report
    • Owre, S.1    Shankar, N.2
  • 16
    • 0009982476 scopus 로고    scopus 로고
    • Tackling the RPC-Memory Specification Problem with I/O automata
    • Formal Systems Specification - The RPC-Memory Specification Case, . Springer-Verlag
    • J. Romijn. Tackling the RPC-Memory Specification Problem with I/O automata. In Formal Systems Specification - The RPC-Memory Specification Case, volume 1169 of Lect. Notes in Comp. Sci., pages 437-476. Springer-Verlag, 1996.
    • (1996) Lect. Notes in Comp. Sci. , vol.1169 , pp. 437-476
    • Romijn, J.1
  • 17
    • 0003575852 scopus 로고    scopus 로고
    • PVS Prover Guide, Version 2.4
    • Computer Science Lab., SRI Intl., Menlo Park, CA, November
    • N. Shankar, S. Owre, J. M. Rushby, and D. W. J. Stringer-Calvert. PVS Prover Guide, Version 2.4. Technical report, Computer Science Lab., SRI Intl., Menlo Park, CA, November 2001.
    • (2001) Technical Report
    • Shankar, N.1    Owre, S.2    Rushby, J.M.3    Stringer-Calvert, D.W.J.4


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