메뉴 건너뛰기




Volumn 5160 LNCS, Issue , 2008, Pages 81-95

Symbolic reachability for process algebras with recursive data types

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; OPEN SYSTEMS; RECURSIVE FUNCTIONS;

EID: 51849134509     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85762-4_6     Document Type: Conference Paper
Times cited : (22)

References (24)
  • 1
    • 38149115280 scopus 로고    scopus 로고
    • Garavel, H., Mateescu, R., Lang, F., Serwe, W.: CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, 4590, pp. 158-163. Springer, Heidelberg (2007)
    • Garavel, H., Mateescu, R., Lang, F., Serwe, W.: CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 158-163. Springer, Heidelberg (2007)
  • 2
    • 84957379824 scopus 로고    scopus 로고
    • Fernandez, J.C., Garavel, H., Kerbrat, A., Mounier, L., Mateescu, R., Sighireanu, M.: CADP - A Protocol Validation and Verification Toolbox. In: Alur, R., Hen-zinger, T.A. (eds.) CAV 1996. LNCS, 1102, pp. 437-440. Springer, Heidelberg (1996)
    • Fernandez, J.C., Garavel, H., Kerbrat, A., Mounier, L., Mateescu, R., Sighireanu, M.: CADP - A Protocol Validation and Verification Toolbox. In: Alur, R., Hen-zinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 437-440. Springer, Heidelberg (1996)
  • 3
    • 51849117527 scopus 로고    scopus 로고
    • Roscoe, B.: The theory and practice of concurrency. Prentice-Hall, Englewood Cliffs (amended, 1998) (2005)
    • Roscoe, B.: The theory and practice of concurrency. Prentice-Hall, Englewood Cliffs (amended, 1998) (2005)
  • 4
    • 84958758114 scopus 로고    scopus 로고
    • Blom, S., Fokkink, W., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.: μCRL: A Toolset for Analysing Algebraic Specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, 2102, pp. 250-254. Springer, Heidelberg (2001)
    • Blom, S., Fokkink, W., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.: μCRL: A Toolset for Analysing Algebraic Specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 250-254. Springer, Heidelberg (2001)
  • 5
    • 16244369748 scopus 로고    scopus 로고
    • SMART: The Stochastic Model checking Analyzer for Reliability and Timing. In: QEST
    • Los Alamitos
    • Ciardo, G., Miner, A.S.: SMART: The Stochastic Model checking Analyzer for Reliability and Timing. In: QEST, pp. 338-339. IEEE Computer Society, Los Alamitos (2004)
    • (2004) IEEE Computer Society , pp. 338-339
    • Ciardo, G.1    Miner, A.S.2
  • 6
    • 33646392714 scopus 로고    scopus 로고
    • Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning
    • Borrione, D, Paul, W, eds, CHARME 2005, Springer, Heidelberg
    • Ciardo, G., Yu, A.J.: Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 146-161. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3725 , pp. 146-161
    • Ciardo, G.1    Yu, A.J.2
  • 7
    • 84943237509 scopus 로고    scopus 로고
    • Deriving Symbolic Representations from Stochastic Process Algebras
    • Hermanns, H, Segala, R, eds, PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002, Springer, Heidelberg
    • Kuntz, M., Siegle, M.: Deriving Symbolic Representations from Stochastic Process Algebras. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, pp. 188-206. Springer, Heidelberg (2002)
    • (2002) LNCS , vol.2399 , pp. 188-206
    • Kuntz, M.1    Siegle, M.2
  • 8
    • 33845214157 scopus 로고    scopus 로고
    • Symbolic Performance and Dependability Evaluation with the Tool CASPA
    • Núñez, M, Maamar, Z, Pelayo, F.L, Pousttchi, K, Rubio, F, eds, FORTE 2004, Springer, Heidelberg
    • Kuntz, M., Siegle, M., Werner, E.: Symbolic Performance and Dependability Evaluation with the Tool CASPA. In: Núñez, M., Maamar, Z., Pelayo, F.L., Pousttchi, K., Rubio, F. (eds.) FORTE 2004. LNCS, vol. 3236, pp. 293-307. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3236 , pp. 293-307
    • Kuntz, M.1    Siegle, M.2    Werner, E.3
  • 9
    • 31744452111 scopus 로고    scopus 로고
    • The saturation algorithm for symbolic state-space exploration
    • Ciardo, G., Marmorstein, R.M., Siminiceanu, R.: The saturation algorithm for symbolic state-space exploration. STTT 8, 4-25 (2006)
    • (2006) STTT , vol.8 , pp. 4-25
    • Ciardo, G.1    Marmorstein, R.M.2    Siminiceanu, R.3
  • 10
    • 0026107125 scopus 로고
    • On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
    • Bryant, R.E.: On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication. IEEE Trans. Computers 40, 205-213 (1991)
    • (1991) IEEE Trans. Computers , vol.40 , pp. 205-213
    • Bryant, R.E.1
  • 14
    • 0022769976 scopus 로고
    • Graph-Based Algorithms for Boolean Function Manipulation
    • Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Computers 35, 677-691 (1986)
    • (1986) IEEE Trans. Computers , vol.35 , pp. 677-691
    • Bryant, R.E.1
  • 18
    • 0011857394 scopus 로고    scopus 로고
    • Description and formal specification of the link layer of P1394
    • Technical Report SEN-R9706, Amsterdam, The Netherlands
    • Luttik, S.: Description and formal specification of the link layer of P1394. In: Technical Report SEN-R9706, Amsterdam, The Netherlands (1997)
    • (1997)
    • Luttik, S.1
  • 19
    • 84896692745 scopus 로고    scopus 로고
    • Verification of the Link Layer Protocol of the IEEE-1394 Serial Bus (FireWire). An Experiment with E-LOTOS
    • Sighireanu, M., Mateescu, R.: Verification of the Link Layer Protocol of the IEEE-1394 Serial Bus (FireWire). An Experiment with E-LOTOS. STTT 2, 68-88 (1998)
    • (1998) STTT , vol.2 , pp. 68-88
    • Sighireanu, M.1    Mateescu, R.2
  • 20
    • 48249153390 scopus 로고    scopus 로고
    • Bakhshi, R., Fokkink, W., Pang, J., van de Pol, J.: Leader Election in Anonymous Rings: Franklin Goes Probabilistic. In: Accepted for 5th IFIP International Conference on Theoretical Computer Science (2008)
    • Bakhshi, R., Fokkink, W., Pang, J., van de Pol, J.: Leader Election in Anonymous Rings: Franklin Goes Probabilistic. In: Accepted for 5th IFIP International Conference on Theoretical Computer Science (2008)
  • 21
    • 84976727289 scopus 로고
    • On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors
    • Franklin, W.R.: On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors. Commun. ACM 25, 336-337 (1982)
    • (1982) Commun. ACM , vol.25 , pp. 336-337
    • Franklin, W.R.1
  • 22
    • 33845289745 scopus 로고    scopus 로고
    • Model checking a cache coherence protocol of a Java DSM implementation
    • Pang, J., Fokkink, W.J., Hofman, R.F., Veldema, R.: Model checking a cache coherence protocol of a Java DSM implementation. JLAP 71, 1-43 (2007)
    • (2007) JLAP , vol.71 , pp. 1-43
    • Pang, J.1    Fokkink, W.J.2    Hofman, R.F.3    Veldema, R.4
  • 23
    • 38149079613 scopus 로고    scopus 로고
    • An Embeddable Virtual Machine for State Space Generation
    • Bosnacki, D, Edelkamp, S, eds, SPIN, Springer, Heidelberg
    • Weber, M.: An Embeddable Virtual Machine for State Space Generation. In: Bosnacki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 168-186. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4595 , pp. 168-186
    • Weber, M.1


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