메뉴 건너뛰기




Volumn 11, Issue 3, 2004, Pages 245-288

Formulae meet programs over the net: A framework for correct network aware programming

Author keywords

Concurrency; Mobile agents; Modal logics; Network aware programming; Programming languages; Verification

Indexed keywords

CONCURRENCY; MOBILE AGENT SYSTEMS; MODEL LOGIC; NETWORK AWARE PROGRAMMING; VERIFICATION;

EID: 3543116093     PISSN: 09288910     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:AUSE.0000028536.34044.47     Document Type: Article
Times cited : (3)

References (39)
  • 1
    • 85029693703 scopus 로고
    • Persistent linda: Linda + transactions + query processing
    • J.P. Banatre and D. Le Metayer editors, vol. 574 of LNCS. Springer
    • Andersen, B.G. and Shasha, D. 1992. Persistent Linda: Linda + Transactions + Query processing. In J.P. Banatre and D. Le Metayer editors, Proc. of Research Directions in High-Level Parallel Programming Languages, vol. 574 of LNCS. Springer, pp. 93-109.
    • (1992) Proc. of Research Directions in High-level Parallel Programming Languages , pp. 93-109
    • Andersen, B.G.1    Shasha, D.2
  • 6
    • 84944041942 scopus 로고    scopus 로고
    • Coordinating mobile object-oriented code
    • (Arbarb and Talcott, 2002). Springer
    • Bettini, L., Bono, V., and Venneri, B. 2002a. Coordinating mobile object-oriented code. In (Arbarb and Talcott, 2002), vol. 2315 of LNCS. Springer, pp. 56-71.
    • (2002) LNCS , vol.2315 , pp. 56-71
    • Bettini, L.1    Bono, V.2    Venneri, B.3
  • 8
    • 84948138844 scopus 로고    scopus 로고
    • Translating strong mobility into weak mobility
    • G.P. Picco, editor, vol. 2240 of LNCS. Springer
    • Bettini, L. and De Nicola, R. 2001. Translating strong mobility into weak mobility, In G.P. Picco, editor, Mobile Agents, vol. 2240 of LNCS. Springer, pp. 182-197.
    • (2001) Mobile Agents , pp. 182-197
    • Bettini, L.1    De Nicola, R.2
  • 11
    • 23044532036 scopus 로고    scopus 로고
    • Formalizing properties of mobile agent systems
    • (Arbarb and Talcott, 2002). Springer
    • Bettini, L., De Nicola, R., and Loreti, M. 2002c. Formalizing properties of mobile agent systems. In (Arbarb and Talcott, 2002), vol. 2315 of LNCS. Springer, pp. 72-87.
    • (2002) LNCS , vol.2315 , pp. 72-87
    • Bettini, L.1    De Nicola, R.2    Loreti, M.3
  • 13
    • 0037175501 scopus 로고    scopus 로고
    • KLAVA: A Java package for distributed and mobile applications
    • Bettini, L., De Nicola, R., and Pugliese, R. 2002e. KLAVA: A Java package for distributed and mobile applications. Software - Practice and Experience, 32(14):1365-1394.
    • (2002) Software - Practice and Experience , vol.32 , Issue.14 , pp. 1365-1394
    • Bettini, L.1    De Nicola, R.2    Pugliese, R.3
  • 16
    • 1442284575 scopus 로고    scopus 로고
    • A spatial logic for concurrency (part I)
    • N. Kobayashi and B.C. Pierce, editors
    • Caires, L. and Cardelli, L. 2001. A spatial logic for concurrency (Part I). In N. Kobayashi and B.C. Pierce, editors, Proc. of TACS2001.
    • (2001) Proc. of TACS2001
    • Caires, L.1    Cardelli, L.2
  • 18
    • 0000637884 scopus 로고    scopus 로고
    • Anytime, anywhere: Modal logics for mobile ambients
    • Cardelli, L. and Gordon, A.D. 2000. Anytime, anywhere: Modal logics for mobile ambients. In Proc. of POPL.
    • (2000) Proc. of POPL
    • Cardelli, L.1    Gordon, A.D.2
  • 19
    • 0005505928 scopus 로고    scopus 로고
    • Logical properties of name restriction
    • S. Abramsky, editor. Springer
    • Cardelli, L. and Gordon, A.D. 2001. Logical properties of name restriction. In S. Abramsky, editor, Proc. of TLCA'01. Springer.
    • (2001) Proc. of TLCA'01
    • Cardelli, L.1    Gordon, A.D.2
  • 20
    • 0024738868 scopus 로고
    • How to write parallel programs: A guide to the perplexed
    • Carriero, N. and Gelernter, D. 1989. How to write parallel programs: A guide to the perplexed. ACM Computing Surveys, 21(3):323-351.
    • (1989) ACM Computing Surveys , vol.21 , Issue.3 , pp. 323-351
    • Carriero, N.1    Gelernter, D.2
  • 24
  • 30
    • 0021974161 scopus 로고
    • Algebraic laws for nondeterminism and concurrency
    • Hennessy, M. and Milner, R. 1985. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137-161.
    • (1985) Journal of the ACM , vol.32 , Issue.1 , pp. 137-161
    • Hennessy, M.1    Milner, R.2
  • 35
  • 37
    • 0031232912 scopus 로고    scopus 로고
    • Programming languages for mobile code
    • Thorn, T. 1997. Programming languages for mobile code. ACM Computing Surveys, 29(3):213-239. Also Technical Report 1083, University of Rennes IRISA.
    • (1997) ACM Computing Surveys , vol.29 , Issue.3 , pp. 213-239
    • Thorn, T.1
  • 38
    • 0031232912 scopus 로고    scopus 로고
    • University of Rennes IRISA
    • Thorn, T. 1997. Programming languages for mobile code. ACM Computing Surveys, 29(3):213-239. Also Technical Report 1083, University of Rennes IRISA.
    • Technical Report , vol.1083
  • 39
    • 0000133669 scopus 로고    scopus 로고
    • Mobile agents
    • J. Bradshaw, editor. AAAI Press and MIT Press
    • White, J.E. 1996. Mobile agents. In J. Bradshaw, editor, Software Agents, AAAI Press and MIT Press.
    • (1996) Software Agents
    • White, J.E.1


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