메뉴 건너뛰기




Volumn 2987, Issue , 2004, Pages 211-225

Angelic semantics of fine-grained concurrency

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES;

EID: 35048861889     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_16     Document Type: Article
Times cited : (34)

References (16)
  • 5
  • 9
    • 84937683871 scopus 로고    scopus 로고
    • A π-calculus process semantics of Concurrent Idealized Algol
    • Proceedings of FOSSACS
    • Röckl, C., Sangiorgi, D.: A π-calculus process semantics of Concurrent Idealized Algol. In: Proceedings of FOSSACS, Volume 1578 of LNCS (1999) 306-322
    • (1999) LNCS , vol.1578 , pp. 306-322
    • Röckl, C.1    Sangiorgi, D.2
  • 10
    • 0022920182 scopus 로고
    • A formal model for defining and classifying delay-insensitive circuits and systems
    • lidding, J.T.: A formal model for defining and classifying delay-insensitive circuits and systems. Distributed Computing 1(4) (1986) 197-204
    • (1986) Distributed Computing , vol.1 , Issue.4 , pp. 197-204
    • Lidding, J.T.1
  • 13
    • 17044367182 scopus 로고    scopus 로고
    • Angelic semantics of fine-grained concurrency
    • Oxford University Computing Laboratory
    • Ghica, D. R., Murawski, A. S.: Angelic semantics of fine-grained concurrency. Technical Report PRG-RR-03-20. Oxford University Computing Laboratory (2003)
    • (2003) Technical Report , vol.PRG-RR-03-20
    • Ghica, D.R.1    Murawski, A.S.2
  • 14
    • 84974574919 scopus 로고    scopus 로고
    • Reasoning about Idealized ALGOL using regular languages
    • Proceedings of ICALP.
    • Ghica, D. R., McCusker, G.: Reasoning about Idealized ALGOL using regular languages. In: Proceedings of ICALP. Volume 1853 of LNCS (2000) 103-116
    • (2000) LNCS , vol.1853 , pp. 103-116
    • Ghica, D.R.1    McCusker, G.2
  • 16
    • 0032597491 scopus 로고    scopus 로고
    • A fully abstract game semantics for finite nondeterminism
    • Harmer, R., McCusker, G.: A fully abstract game semantics for finite nondeterminism. In: Proceedings of LICS (1999) 422-430
    • (1999) Proceedings of LICS , pp. 422-430
    • Harmer, R.1    McCusker, G.2


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