메뉴 건너뛰기




Volumn 2, Issue 1, 1998, Pages 13-28

Behavior analysis for validating communication patterns

Author keywords

Concurrent ML; Process algebras; Type and effect systems; Validation of safety conditions

Indexed keywords

BEHAVIOR ANALYSIS; COMMUNICATION PATTERN; CONCURRENT ML; CONCURRENT PROGRAM; PROCESS ALGEBRAS; REACTIVE PROGRAMS; SAFETY CONDITION; TYPE AND EFFECT SYSTEMS;

EID: 84896693891     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090050015     Document Type: Article
Times cited : (4)

References (34)
  • 1
    • 0031534035 scopus 로고    scopus 로고
    • Type and behavior reconstruction for higher-order concurrent programs
    • May
    • Amtoft, T., Nielson, F., Nielson, H. R.: Type and behavior reconstruction for higher-order concurrent programs. Journal of Functional Programming 7(3): 321-347, May 1997.
    • (1997) Journal of Functional Programming , vol.7 , Issue.3 , pp. 321-347
    • Amtoft, T.1    Nielson, F.2    Nielson, H.R.3
  • 5
    • 84955617342 scopus 로고
    • Determining storage properties of sequential and concurrent programs with assignment and structured data
    • In:, SLNCS 983
    • Colby, C.: Determining storage properties of sequential and concurrent programs with assignment and structured data. In: Proc. SAS '95, SLNCS 983, 1995, pp. 64-81.
    • (1995) Proc. SAS '95 , pp. 64-81
    • Colby, C.1
  • 6
    • 85033685732 scopus 로고
    • Polymorphic subtype inference: Closing the theory-practice gap
    • In:, SLNCS 352
    • You-Chin Fuh, Mishra, P.: Polymorphic subtype inference: Closing the theory-practice gap. In: Proc. TAPSOFT'89, SLNCS 352, 1989, pp. 167-183.
    • (1989) Proc. TAPSOFT'89 , pp. 167-183
    • Fuh, Y.-C.1    Mishra, P.2
  • 8
    • 0030645011 scopus 로고    scopus 로고
    • Systematic realisation of control flow analyzes for CML
    • In:, ACM Press
    • Gasser, K. L. S., Nielson, F., Nielson, H. R.: Systematic realisation of control flow analyzes for CML. In: Proc. ICFP'97, ACM Press, 1997, pp. 38-51.
    • (1997) Proc. ICFP'97 , pp. 38-51
    • Gasser, K.L.S.1    Nielson, F.2    Nielson, H.R.3
  • 9
    • 0003844091 scopus 로고
    • Berlin, Heidelberg, NewYork: Springer-Verlag
    • Gries, D.: The Science of Programming. Berlin, Heidelberg, NewYork: Springer-Verlag, 1981.
    • (1981) The Science of Programming
    • Gries, D.1
  • 10
    • 84959656610 scopus 로고
    • A theory of qualified types
    • In:, SLNCS 582
    • Jones M. P.: A theory of qualified types. In: Proc. ESOP'92, SLNCS 582, 1992, pp. 287-306.
    • (1992) Proc. ESOP'92 , pp. 287-306
    • Jones, M.P.1
  • 11
    • 85030052649 scopus 로고
    • Algebraic reconstruction of types and effects
    • In:, ACM Press
    • Jouvelot, P., Gifford, D. K.: Algebraic reconstruction of types and effects. In: Proc. POPL'91, ACM Press, 1991, pp. 303-310.
    • (1991) Proc. POPL'91 , pp. 303-310
    • Jouvelot, P.1    Gifford, D.K.2
  • 13
    • 0018105622 scopus 로고
    • A theory of type polymorphism in programming
    • Milner, R.: A theory of type polymorphism in programming. Journal of Computer and System Sciences 17: 348-375, 1978.
    • (1978) Journal of Computer and System Sciences , vol.17 , pp. 348-375
    • Milner, R.1
  • 15
    • 0038180469 scopus 로고
    • A formal type system for comparing partial evaluators
    • In: Bjørner, D., Ershov, A.P., Jones, N.D. (eds.), North-Holland
    • Nielson, F.: A formal type system for comparing partial evaluators. In: Bjørner, D., Ershov, A. P., Jones, N. D. (eds.): Proc. Partial Evaluation and Mixed Computation, North-Holland, 1988, pp. 349-384.
    • (1988) Proc. Partial Evaluation and Mixed Computation , pp. 349-384
    • Nielson, F.1
  • 16
    • 85033665033 scopus 로고
    • The typed λ-calculus with first-class processes
    • In:, SLNCS 366
    • Nielson, F.: The typed λ-calculus with first-class processes. In: Proc. PARLE '89, SLNCS 366, 1989, pp. 357-373.
    • (1989) Proc. PARLE '89 , pp. 357-373
    • Nielson, F.1
  • 17
    • 0030085478 scopus 로고    scopus 로고
    • From CML to process algebras
    • 1993, In:, SLNCS 715, Full version in Theoretical Computer Science
    • Nielson, F., Nielson, H. R.: From CML to process algebras. In: Proc. CONCUR'93, SLNCS 715, 1993. Full version in Theoretical Computer Science 15(1): 179-219, 1996.
    • (1996) Proc. CONCUR'93 , vol.15 , Issue.1 , pp. 179-219
    • Nielson, F.1    Nielson, H.R.2
  • 18
    • 0030676705 scopus 로고    scopus 로고
    • Infinitary control flow analysis: A collecting semantics for closure analysis
    • In
    • Nielson, F., Nielson, H. R.: Infinitary control flow analysis: a collecting semantics for closure analysis. In: Proc. POPL'97. ACM Press, 1997, pp. 332-345.
    • (1997) Proc. POPL'97. ACM Press , pp. 332-345
    • Nielson, F.1    Nielson, H.R.2
  • 20
    • 84957106602 scopus 로고    scopus 로고
    • Behavior analysis and safety conditions: A case study in CML
    • In:, SLNCS 1382
    • Nielson, H. R., Amtoft, T., Nielson, F.: Behavior analysis and safety conditions: a case study in CML. In: Proc. FASE' 98 (part of ETAPS' 98), SLNCS 1382, 1998, pp. 255-269.
    • (1998) Proc. FASE' 98 (part of ETAPS' 98) , pp. 255-269
    • Nielson, H.R.1    Amtoft, T.2    Nielson, F.3
  • 21
    • 0027928356 scopus 로고
    • Higher-order concurrent programs with finite communication topology
    • In:, ACM Press
    • Nielson, H. R., Nielson, F.: Higher-order concurrent programs with finite communication topology. In: Proc. POPL'94, ACM Press, 1994, pp. 84-97.
    • (1994) Proc. POPL'94 , pp. 84-97
    • Nielson, H.R.1    Nielson, F.2
  • 22
    • 84957645396 scopus 로고
    • Static and dynamic processor allocation for higher-order concurrent languages
    • In:, SLNCS 915
    • Nielson, H. R., Nielson, F.: Static and dynamic processor allocation for higher-order concurrent languages. In: Proc. TAPSOFT' 95 (FASE), SLNCS 915, 1995, pp. 590-604.
    • (1995) Proc. TAPSOFT' 95 (FASE) , pp. 590-604
    • Nielson, H.R.1    Nielson, F.2
  • 23
    • 0343909132 scopus 로고    scopus 로고
    • Communication analysis for Concurrent ML
    • In:, Analysis, Implementation and Application (editor: Flemming Nielson), Springer-Verlag, Monographs in Computer Science
    • Nielson, H. R., Nielson, F.: Communication analysis for Concurrent ML. In: ML with Concurrency: Design, Analysis, Implementation and Application (editor: Flemming Nielson), Springer-Verlag, Monographs in Computer Science, 1997.
    • (1997) ML with Concurrency: Design
    • Nielson, H.R.1    Nielson, F.2
  • 25
    • 0011582560 scopus 로고
    • Concurrent ML: Design, application and semantics
    • In:, Concurrency, Simulation and Automated Reasoning, SLNCS 693
    • Reppy, J. H.: Concurrent ML: Design, application and semantics. In: Proc. Functional Programming, Concurrency, Simulation and Automated Reasoning, SLNCS 693, 1993, pp. 165-198.
    • (1993) Proc. Functional Programming , pp. 165-198
    • Reppy, J.H.1
  • 26
    • 84884668311 scopus 로고    scopus 로고
    • Design and prototyping of real-time systems using CSP and CML
    • In:, Toledo, Spain, IEEE Computer Society Press
    • Rischel, H., Sun, H.: Design and prototyping of real-time systems using CSP and CML. In: Proc. 9th EuromicroWorkshop on Real-Time Systems, Toledo, Spain, IEEE Computer Society Press, 1997, pp. 121-127.
    • (1997) Proc. 9th EuromicroWorkshop on Real-Time Systems , pp. 121-127
    • Rischel, H.1    Sun, H.2
  • 27
    • 84918983692 scopus 로고
    • A machine-oriented logic based on the resolution principle
    • Robinson, J. A.: A machine-oriented logic based on the resolution principle. Journal of the ACM 12(1): 23-41, 1965.
    • (1965) Journal of the ACM , vol.12 , Issue.1 , pp. 23-41
    • Robinson, J.A.1
  • 28
    • 21144478692 scopus 로고
    • Polymorphic type inference with overloading and subtyping
    • In:, SLNCS 668, 1993, Also see: Principal type schemes for functional programs with overloading and subtyping: Science of Computer Programming 23671-685
    • Smith, G. S.: Polymorphic type inference with overloading and subtyping. In: Proc. TAPSOFT'93, SLNCS 668, 1993, pp. 671-685. Also see: Principal type schemes for functional programs with overloading and subtyping: Science of Computer Programming 23, 1994, pp. 197-226.
    • (1994) Proc. TAPSOFT'93 , pp. 197-226
    • Smith, G.S.1
  • 32
    • 84867823067 scopus 로고    scopus 로고
    • Nielson, In:, F. (ed): ML with Concurrency: Design, Analysis, Implementation and Application, Berlin, Heidelberg, NewYork: Springer-Verlag, Monographs in Computer Science
    • Thomsen, B., Leth, L., Tsung-Min Kuo: FACILE-from Toy to Tool. In: Nielson, F. (ed): ML with Concurrency: Design, Analysis, Implementation and Application, Berlin, Heidelberg, NewYork: Springer-Verlag, Monographs in Computer Science, 1997.
    • (1997) FACILE-from Toy to Tool
    • Thomsen, B.1    Leth, L.2    Kuo, T.-M.3
  • 33
    • 0028015018 scopus 로고
    • Implementation of the typed call-byvalue λ-calculus using a stack of regions
    • In:, ACM Press
    • Tofte, M., Talpin, J.-P.: Implementation of the typed call-byvalue λ-calculus using a stack of regions. In: Proc. POPL'94, ACM Press, 1994, pp. 188-201.
    • (1994) Proc. POPL'94 , pp. 188-201
    • Tofte, M.1    Talpin, J.-P.2
  • 34
    • 85006239926 scopus 로고
    • The Mobility Workbench-A Tool for the π-calculus
    • In:, SLNCS 818
    • Victor, B., Moller, F.: The Mobility Workbench-A Tool for the π-calculus. In: Proc. CAV'94: Computer Aided Verification, SLNCS 818, 1994, pp. 428-440.
    • (1994) Proc. CAV'94: Computer Aided Verification , pp. 428-440
    • Victor, B.1    Moller, F.2


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