메뉴 건너뛰기




Volumn 4595 LNCS, Issue , 2007, Pages 187-203

Scalable multi-core LTL model-checking

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DATA STORAGE EQUIPMENT; SCALABILITY;

EID: 38349063046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73370-6_13     Document Type: Conference Paper
Times cited : (55)

References (22)
  • 2
    • 18544388114 scopus 로고    scopus 로고
    • Property Driven Distribution of Nested DFS. In: Proceedinfs of the 3rd International Workshop on Verification and Computational Logic (VCL'02 - held at the PLI 2002 Symposium), University of Southampton, UK
    • Technical Report DSSE-TR-2002-5 in DSSE, pp
    • Barnat, J., Brim, L., Černá, I.: Property Driven Distribution of Nested DFS. In: Proceedinfs of the 3rd International Workshop on Verification and Computational Logic (VCL'02 - held at the PLI 2002 Symposium), University of Southampton, UK, Technical Report DSSE-TR-2002-5 in DSSE, pp. 1-10 (2002)
    • (2002) , pp. 1-10
    • Barnat, J.1    Brim, L.2    Černá, I.3
  • 3
    • 33749822525 scopus 로고    scopus 로고
    • Barnat, J., Brim, L., Černá, I., Moravec, P., Ročkai, P., Šimeček, P.: DiVinE - A Tool for Distributed Verification (Tool Paper). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, 4144, pp. 278-281. Springer, Heidelberg (2006)
    • Barnat, J., Brim, L., Černá, I., Moravec, P., Ročkai, P., Šimeček, P.: DiVinE - A Tool for Distributed Verification (Tool Paper). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 278-281. Springer, Heidelberg (2006)
  • 4
    • 32044445465 scopus 로고    scopus 로고
    • Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking
    • Hu, A.J, Martin, A.K, eds, FMCAD 2004, Springer, Heidelberg
    • Brim, L., Černá, I., Moravec, P., Šimša, J.: Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 352-366. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3312 , pp. 352-366
    • Brim, L.1    Černá, I.2    Moravec, P.3    Šimša, J.4
  • 5
    • 84944038984 scopus 로고    scopus 로고
    • Brim, L., Černá, I., Krčál, P., Pelánek, R.: Distributed LTL model checking based on negative cycle detection. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. LNCS, 2245, pp. 96-107. Springer, Heidelberg (2001)
    • Brim, L., Černá, I., Krčál, P., Pelánek, R.: Distributed LTL model checking based on negative cycle detection. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 2245, pp. 96-107. Springer, Heidelberg (2001)
  • 7
    • 33745787583 scopus 로고    scopus 로고
    • Distributed explicit fair cycle detection (set based approach)
    • Ball, T, Rajamani, S.K, eds, Model Checking Software, Springer, Heidelberg
    • Černá, I., Pelánek, R.: Distributed explicit fair cycle detection (set based approach). In: Ball, T., Rajamani, S.K. (eds.) Model Checking Software. LNCS, vol. 2648, pp. 49-73. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2648 , pp. 49-73
    • Černá, I.1    Pelánek, R.2
  • 8
    • 26944488076 scopus 로고    scopus 로고
    • Černa I., Pelánek, R.: Relating hierarchy of temporal properties to model checking. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, 2747, pp. 318-327. Springer, Heidelberg (2003)
    • Černa I., Pelánek, R.: Relating hierarchy of temporal properties to model checking. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 318-327. Springer, Heidelberg (2003)
  • 11
    • 84903186573 scopus 로고    scopus 로고
    • Is there a best symbolic cycle-detection algorithm?
    • Margaria, T, Yi, W, eds, ETAPS 2001 and TACAS 2001, Springer, Heidelberg
    • Fisler, K., Fraer, R., Kamhi, G., Vardi, M.Y., Yang, Z.: Is there a best symbolic cycle-detection algorithm? In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 420-434. Springer, Heidelberg (2001)
    • (2001) LNCS , vol.2031 , pp. 420-434
    • Fisler, K.1    Fraer, R.2    Kamhi, G.3    Vardi, M.Y.4    Yang, Z.5
  • 12
    • 38349061293 scopus 로고    scopus 로고
    • Holzmann, G.: The Design of a Distributed Model Checking Algorithm for SPIN. In: FMCAD, Invited Talk (2006)
    • Holzmann, G.: The Design of a Distributed Model Checking Algorithm for SPIN. In: FMCAD, Invited Talk (2006)
  • 15
    • 33748295610 scopus 로고    scopus 로고
    • Ctl* model checking on a shared memory architecture
    • Inggs, C., Barringer, H.: Ctl* model checking on a shared memory architecture. Formal Methods in System Design 29(2), 135-155 (2006)
    • (2006) Formal Methods in System Design , vol.29 , Issue.2 , pp. 135-155
    • Inggs, C.1    Barringer, H.2
  • 16
    • 16244409154 scopus 로고    scopus 로고
    • Simplified distributed LTL model checking by localizing cycles
    • Technical Report 00176, Institut für Informatik, University Freiburg, Germany July
    • Lafuente, A.L.: Simplified distributed LTL model checking by localizing cycles. Technical Report 00176, Institut für Informatik, University Freiburg, Germany (July 2002)
    • (2002)
    • Lafuente, A.L.1
  • 17
    • 0031145222 scopus 로고    scopus 로고
    • An optimal algorithm for global termination detection in shared-memory asynchronous multiprocessor systems
    • Leung, H.-F., Ting, H.-F.: An optimal algorithm for global termination detection in shared-memory asynchronous multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems 8(5), 538-543 (1997)
    • (1997) IEEE Transactions on Parallel and Distributed Systems , vol.8 , Issue.5 , pp. 538-543
    • Leung, H.-F.1    Ting, H.-F.2
  • 19
    • 4544236916 scopus 로고    scopus 로고
    • Scalable lock-free dynamic memory allocation
    • Michael, M.M.: Scalable lock-free dynamic memory allocation. SIGPLAN Not. 39(6), 35-46 (2004)
    • (2004) SIGPLAN Not , vol.39 , Issue.6 , pp. 35-46
    • Michael, M.M.1
  • 20
    • 0029723606 scopus 로고    scopus 로고
    • Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
    • Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Symposium on Principles of Distributed Computing, pp. 267-275 (1996)
    • (1996) Symposium on Principles of Distributed Computing , pp. 267-275
    • Michael, M.M.1    Scott, M.L.2
  • 22
    • 0001790593 scopus 로고
    • Depth First Search and Linear Graph Algorithms
    • Tarjan, R.: Depth First Search and Linear Graph Algorithms. SIAM Journal on Computing, 146-160 (1972)
    • (1972) SIAM Journal on Computing , vol.146-160
    • Tarjan, R.1


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