메뉴 건너뛰기




Volumn , Issue , 2013, Pages 26-36

Proving MCAPI executions are correct using SMT

Author keywords

Abstraction; Message Passing; Refinement; SMT

Indexed keywords

ABSTRACTION; ENCODING STRATEGY; HETEROGENEOUS MULTI-CORE SYSTEMS; MULTICORE TECHNOLOGY; PROGRAM EXECUTION; REFERENCE SOLUTION; REFINEMENT; SATISFIABILITY MODULO THEORIES;

EID: 84893583964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2013.6693063     Document Type: Conference Paper
Times cited : (12)

References (29)
  • 1
    • 67650509253 scopus 로고    scopus 로고
    • Communication-sensitive static dataflow for parallel message passing applications
    • IEEE Computer Society
    • Bronevetsky, G.: Communication-sensitive static dataflow for parallel message passing applications. In: CGO. IEEE Computer Society (2009)
    • (2009) CGO
    • Bronevetsky, G.1
  • 2
    • 35448932808 scopus 로고    scopus 로고
    • Checkfence: Checking consistency of concurrent data types on relaxed memory models
    • San Diego, California, USA (June 10-13)
    • Burckhardt, S., Alur, R., Martin, M.M.K.: Checkfence: Checking consistency of concurrent data types on relaxed memory models. In: ACM SIGPLAN PLDI. San Diego, California, USA (June 10-13, 2007)
    • (2007) ACM SIGPLAN PLDI
    • Burckhardt, S.1    Alur, R.2    Martin, M.M.K.3
  • 3
    • 22944480517 scopus 로고    scopus 로고
    • The complexity of verifying memory coherence and consistency
    • DOI 10.1109/TPDS.2005.86
    • Cantin, J.F., Lipasti, M.H., Smith, J.E.: The complexity of verifying memory coherence and consistency. IEEE Trans. Parallel Distrib. Syst. 16(7), 663-671 (Jul 2005), http://dx.doi.org/10.1109/TPDS.2005.86 (Pubitemid 41046833)
    • (2005) IEEE Transactions on Parallel and Distributed Systems , vol.16 , Issue.7 , pp. 663-671
    • Cantin, J.F.1    Lipasti, M.H.2    Smith, J.E.3
  • 4
    • 84861624565 scopus 로고    scopus 로고
    • Exploiting step semantics for efficient bounded model checking of asynchronous systems
    • Dubrovin, J., Junttila, T., Heljanko, K.: Exploiting step semantics for efficient bounded model checking of asynchronous systems. In: Science of Computer Programming. pp. 77(10-11):1095-1121 (2012)
    • (2012) Science of Computer Programming , vol.77 , Issue.10-11 , pp. 1095-1121
    • Dubrovin, J.1    Junttila, T.2    Heljanko, K.3
  • 8
    • 29144439944 scopus 로고    scopus 로고
    • Dynamic partial-order reduction for modeling checking software
    • ACM Press, New York, NY, USA
    • Flanagan, C., Godefroid, P.: Dynamic partial-order reduction for modeling checking software. In: POPL. pp. 110-121. ACM Press, New York, NY, USA (2005)
    • (2005) POPL , pp. 110-121
    • Flanagan, C.1    Godefroid, P.2
  • 9
    • 79955667876 scopus 로고    scopus 로고
    • Targeting complex embedded architectures by combining the multicore communications API (MCAPI) with compiletime virtualisation
    • ACM, Chicago, Illinois, USA
    • Gray, I., Audsley, N.: Targeting complex embedded architectures by combining the multicore communications API (MCAPI) with compiletime virtualisation. In: LCTES. ACM, Chicago, Illinois, USA (2011)
    • (2011) LCTES
    • Gray, I.1    Audsley, N.2
  • 11
    • 70350228798 scopus 로고    scopus 로고
    • Monotonic partial order reduction: An optimal symbolic partial order reduction technique
    • Springer, Berlin/Heidelberg, Grenoble, France (June 26-July 02)
    • Kahlon, V., Wang, C., Gupta, A.: Monotonic partial order reduction: An optimal symbolic partial order reduction technique. In: ACM CAV. pp. 398-413. Springer, Berlin/Heidelberg, Grenoble, France (June 26-July 02, 2009)
    • (2009) ACM CAV , pp. 398-413
    • Kahlon, V.1    Wang, C.2    Gupta, A.3
  • 12
    • 84893541953 scopus 로고    scopus 로고
    • SMT-based modular analysis of sequential systems code
    • Springer-Verlag
    • Lahiri, S.: SMT-based modular analysis of sequential systems code. In: CAV. Springer-Verlag (2011)
    • (2011) CAV
    • Lahiri, S.1
  • 13
    • 84865662354 scopus 로고    scopus 로고
    • Back to the future revisiting precise program verification using SMT solvers
    • ACM, San Francisco, California, USA
    • Lahiri, S., Qadeer, S.: Back to the future revisiting precise program verification using SMT solvers. In: POPL. ACM, San Francisco, California, USA (2008)
    • (2008) POPL
    • Lahiri, S.1    Qadeer, S.2
  • 17
    • 45749085681 scopus 로고    scopus 로고
    • Z3: An efficient SMT solver
    • Springer, Heidelberg
    • de Moura, L., Bjrner, N.: Z3: An efficient SMT solver. In: TACAS. vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
    • (2008) TACAS , vol.4963 , pp. 337-340
    • De Moura, L.1    Bjrner, N.2
  • 21
    • 76649125925 scopus 로고    scopus 로고
    • MCC - A runtime verification tool for MCAPI user applications
    • Sharma, S., Gopalakrishanan, G., Mercer, E., Holt, J.: MCC - a runtime verification tool for MCAPI user applications. In: FMCAD (2009)
    • (2009) FMCAD
    • Sharma, S.1    Gopalakrishanan, G.2    Mercer, E.3    Holt, J.4
  • 22
    • 38449085075 scopus 로고    scopus 로고
    • Verifying parallel programs with MPI-Spin
    • Cappello, F., Hérault, T., Dongarra, J. (eds.) Recent Advances in Parallel Virtual Machine and Message Passing Interface, 14th European PVM/MPI User's Group Meeting, Paris, France, September 30 - October 3, 2007, Proceedings. Springer
    • Siegel, S.F.: Verifying parallel programs with MPI-Spin. In: Cappello, F., Hérault, T., Dongarra, J. (eds.) Recent Advances in Parallel Virtual Machine and Message Passing Interface, 14th European PVM/MPI User's Group Meeting, Paris, France, September 30 - October 3, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4757, pp. 13-14. Springer (2007)
    • (2007) Lecture Notes in Computer Science , vol.4757 , pp. 13-14
    • Siegel, S.F.1
  • 23
    • 79251572342 scopus 로고    scopus 로고
    • Formal analysis of message passing
    • Jhala, R., Schmidt, D. (eds.) Verification, Model Checking, and Abstract Interpretation: 12th International Conference, VMCAI 2011, Austin, TX, January 23-25, 2011, Proceedings
    • Siegel, S.F., Gopalakrishnan, G.: Formal analysis of message passing. In: Jhala, R., Schmidt, D. (eds.) Verification, Model Checking, and Abstract Interpretation: 12th International Conference, VMCAI 2011, Austin, TX, January 23-25, 2011, Proceedings. Lecture Notes in Computer Science, vol. 6538, pp. 2-18 (2011)
    • (2011) Lecture Notes in Computer Science , vol.6538 , pp. 2-18
    • Siegel, S.F.1    Gopalakrishnan, G.2
  • 25
    • 84856138072 scopus 로고    scopus 로고
    • Loop invariant symbolic execution for parallel program
    • Kuncak, V., Rybalchenko, A. (eds.) Verification, Model Checking, and Abstract Interpretation: 13th International Conference, VMCAI 2012. Springer
    • Siegel, S.F., Zirkel, T.K.: Loop invariant symbolic execution for parallel program. In: Kuncak, V., Rybalchenko, A. (eds.) Verification, Model Checking, and Abstract Interpretation: 13th International Conference, VMCAI 2012. Lecture Notes in Computer Science, vol. 7148, pp. 412- 427. Springer (2012)
    • (2012) Lecture Notes in Computer Science , vol.7148 , pp. 412-427
    • Siegel, S.F.1    Zirkel, T.K.2
  • 26
    • 70649105406 scopus 로고    scopus 로고
    • Reduced execution semantics of MPI: From theory to pratice
    • Vakkalanka, S., Vo, A., Gopalakrishnan, G., Kirby, R.: Reduced execution semantics of MPI: From theory to pratice. In: FM. pp. 724-740 (2009)
    • (2009) FM , pp. 724-740
    • Vakkalanka, S.1    Vo, A.2    Gopalakrishnan, G.3    Kirby, R.4
  • 27
    • 84885233375 scopus 로고    scopus 로고
    • Isp tool update: Scalable MPI verification
    • Müller, M.S., Resch, M.M., Schulz, A., Nagel, W.E. (eds.). Springer
    • Vo, A., Vakkalanka, S.S., Gopalakrishnan, G.: Isp tool update: Scalable MPI verification. In: Müller, M.S., Resch, M.M., Schulz, A., Nagel, W.E. (eds.) Parallel Tools Workshop. pp. 175-184. Springer (2009)
    • (2009) Parallel Tools Workshop , pp. 175-184
    • Vo, A.1    Vakkalanka, S.S.2    Gopalakrishnan, G.3
  • 28
    • 77949421686 scopus 로고    scopus 로고
    • Symbolic pruning of concurrent program executions
    • ACM, New York, NY, USA
    • Wang, C., Chaudhuri, S., Gupta, A., Yang, Y.: Symbolic pruning of concurrent program executions. In: ESEC/FSE. pp. 23-32. ACM, New York, NY, USA (2009)
    • (2009) ESEC/FSE , pp. 23-32
    • Wang, C.1    Chaudhuri, S.2    Gupta, A.3    Yang, Y.4


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