메뉴 건너뛰기




Volumn , Issue , 2007, Pages 65-74

Programming asynchronous layers with CLARITY

Author keywords

Asynchronous components; Concurrency; Design for analyzability; Event driven programming; Static analysis

Indexed keywords

ASYNCHRONOUS COMPONENTS; DESIGN FOR ANALYZABILITY; EVENT-DRIVEN PROGRAMMING; ANALYSIS PROBLEMS; ASYNCHRONOUS SYSTEMS; C CODES; CONCURRENCY; COORDINATION PROTOCOLS; CURRENT ANALYSIS; EFFECTIVE PROGRAMS; EVENT-DRIVEN; FUNCTION CALLS; HEAP DATUMS; LANGUAGE FEATURES; NETWORK DEVICES; NONBLOCKING; PROGRAM LOGICS; PROGRAMMING LANGUAGES; SEQUENTIAL ANALYSES; SEQUENTIAL CONTROLS;

EID: 37849050602     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1287624.1287636     Document Type: Conference Paper
Times cited : (17)

References (38)
  • 2
    • 35048899679 scopus 로고    scopus 로고
    • Zing: Exploiting program structure for model checking concurrent software
    • CONCUR, of, Invited paper
    • T. Andrews, S. Qadeer, S. K. Rajamani, J. Rehof, and Y. Xie. Zing: Exploiting program structure for model checking concurrent software. In CONCUR, volume 3170 of LNCS, 2004. Invited paper.
    • (2004) LNCS , vol.3170
    • Andrews, T.1    Qadeer, S.2    Rajamani, S.K.3    Rehof, J.4    Xie, Y.5
  • 3
    • 36348969336 scopus 로고    scopus 로고
    • T. Arons, A. Pnueli, S. Ruah, Y. Xu, and L. D. Zuck. Parameterized verification with automatically computed inductive assertions. In CAV, 2102 of LNCS, pages 221-234, 2001.
    • T. Arons, A. Pnueli, S. Ruah, Y. Xu, and L. D. Zuck. Parameterized verification with automatically computed inductive assertions. In CAV, volume 2102 of LNCS, pages 221-234, 2001.
  • 4
    • 84894630000 scopus 로고    scopus 로고
    • Automatically validating temporal safety properties of interfaces
    • SPIN Workshop, of
    • T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In SPIN Workshop, volume 2057 of LNCS, 2001.
    • (2001) LNCS , vol.2057
    • Ball, T.1    Rajamani, S.K.2
  • 5
    • 0038489696 scopus 로고    scopus 로고
    • SLIC: A specification language for interface checking of C
    • Technical Report MSR-TR-2001-21, Microsoft Research, Jan
    • T. Ball and S. K. Rajamani. SLIC: A specification language for interface checking of C. Technical Report MSR-TR-2001-21, Microsoft Research, Jan. 2001.
    • (2001)
    • Ball, T.1    Rajamani, S.K.2
  • 6
    • 0026953373 scopus 로고
    • The Esterel synchronous programming language: Design, semantics, implementation
    • G. Berry and G. Gonthier. The Esterel synchronous programming language: Design, semantics, implementation. Sci. Comput. Programming, 19(2):87-152, 1992.
    • (1992) Sci. Comput. Programming , vol.19 , Issue.2 , pp. 87-152
    • Berry, G.1    Gonthier, G.2
  • 8
    • 0016521875 scopus 로고
    • The programming language Concurrent Pascal
    • P. Brinch Hansen. The programming language Concurrent Pascal. IEEE Trans. Softw. Eng., 1(2):199-207, 1975.
    • (1975) IEEE Trans. Softw. Eng , vol.1 , Issue.2 , pp. 199-207
    • Brinch Hansen, P.1
  • 9
    • 0032594250 scopus 로고    scopus 로고
    • Teapot: A domain-specific language for writing cache coherence protocols
    • S. Chandra, B. Richards, and J. R. Larus. Teapot: A domain-specific language for writing cache coherence protocols. IEEE Trans. Softw. Eng., 25(3):317-333, 1999.
    • (1999) IEEE Trans. Softw. Eng , vol.25 , Issue.3 , pp. 317-333
    • Chandra, S.1    Richards, B.2    Larus, J.R.3
  • 10
    • 37849054397 scopus 로고    scopus 로고
    • Programming asynchronous layers with CLARITY
    • Technical Report MSR-TR-2007-80, Microsoft Research
    • P. Chandrasekaran, C. L. Conway, J. M. Joy, and S. K. Rajamani. Programming asynchronous layers with CLARITY. Technical Report MSR-TR-2007-80, Microsoft Research, 2007.
    • (2007)
    • Chandrasekaran, P.1    Conway, C.L.2    Joy, J.M.3    Rajamani, S.K.4
  • 11
    • 0036040604 scopus 로고    scopus 로고
    • ESP: Path-sensitive program verification in polynomial time
    • M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In PLDI, pages 57-69, 2002.
    • (2002) PLDI , pp. 57-69
    • Das, M.1    Lerner, S.2    Seigle, M.3
  • 12
    • 0035783442 scopus 로고    scopus 로고
    • Interface automata
    • L. de Alfaro and T. A. Henzinger. Interface automata. In FSE, pages 109-120, 2001.
    • (2001) FSE , pp. 109-120
    • de Alfaro, L.1    Henzinger, T.A.2
  • 13
    • 84975277890 scopus 로고    scopus 로고
    • Checking system rules using system-specific, programmer-written compiler extensions
    • D. Engler, B. Chelf, A. Chou, and S. Hallem. Checking system rules using system-specific, programmer-written compiler extensions. In OSDI, 2000.
    • (2000) OSDI
    • Engler, D.1    Chelf, B.2    Chou, A.3    Hallem, S.4
  • 14
    • 3042541926 scopus 로고    scopus 로고
    • SASI enforcement of security policies: A retrospective
    • Technical Report 1999-1758, Cornell University, Ithaca, NY
    • U. Erlingsson and F. B. Schneider. SASI enforcement of security policies: A retrospective. Technical Report 1999-1758, Cornell University, Ithaca, NY, 1999.
    • (1999)
    • Erlingsson, U.1    Schneider, F.B.2
  • 15
    • 0036039550 scopus 로고    scopus 로고
    • Adoption and focus: Practical linear types for imperative programming
    • M. Fähndrich and R. DeLine. Adoption and focus: Practical linear types for imperative programming. In PLDI, pages 13-24, 2002.
    • (2002) PLDI , pp. 13-24
    • Fähndrich, M.1    DeLine, R.2
  • 17
    • 84976721284 scopus 로고
    • MULTILISP: A language for concurrent symbolic computation
    • October
    • R. H. Halstead. MULTILISP: a language for concurrent symbolic computation. ACM Trans. Prog. Lang. Syst., 7(4):501-538, October 1985.
    • (1985) ACM Trans. Prog. Lang. Syst , vol.7 , Issue.4 , pp. 501-538
    • Halstead, R.H.1
  • 19
    • 0016114085 scopus 로고
    • Monitors: An operating system structuring concept
    • Oct
    • C. A. R. Hoare. Monitors: An operating system structuring concept. Commun. ACM, 17(10):549-557, Oct. 1974.
    • (1974) Commun. ACM , vol.17 , Issue.10 , pp. 549-557
    • Hoare, C.A.R.1
  • 20
    • 0018005391 scopus 로고
    • Communicating sequential processes
    • C. A. R. Hoare. Communicating sequential processes. Commun. ACM, 21(8):666-677, 1978.
    • (1978) Commun. ACM , vol.21 , Issue.8 , pp. 666-677
    • Hoare, C.A.R.1
  • 21
    • 37849032755 scopus 로고    scopus 로고
    • Standard - Programming Languages - C, Dec. 1999
    • ISO ISO/IEC 9899
    • ISO Standard - Programming Languages - C, Dec. 1999. ISO/IEC 9899:1999.
    • (1999)
  • 22
    • 0016090932 scopus 로고
    • A new solution of Dijkstra's concurrent programming problem
    • Aug
    • L. Lamport. A new solution of Dijkstra's concurrent programming problem. Commun. ACM, 17(8):453-455, Aug. 1974.
    • (1974) Commun. ACM , vol.17 , Issue.8 , pp. 453-455
    • Lamport, L.1
  • 23
    • 0005260729 scopus 로고    scopus 로고
    • Using cohort scheduling to enhance server performance
    • Technical Report MSR-TR-2001-39, Microsoft Research
    • J. R. Larus and M. Parkes. Using cohort scheduling to enhance server performance. Technical Report MSR-TR-2001-39, Microsoft Research, 2001.
    • (2001)
    • Larus, J.R.1    Parkes, M.2
  • 24
    • 0005259427 scopus 로고
    • On the duality of operating system structures
    • H. C. Lauer and R. M. Needham. On the duality of operating system structures. Operating Systems Review, 13(2):3-19, 1979.
    • (1979) Operating Systems Review , vol.13 , Issue.2 , pp. 3-19
    • Lauer, H.C.1    Needham, R.M.2
  • 26
    • 33845456481 scopus 로고    scopus 로고
    • The problem with threads. Technical Report UCB/EECS-2006-1, EECS Department, University of California, Berkeley
    • January 10
    • E. A. Lee. The problem with threads. Technical Report UCB/EECS-2006-1, EECS Department, University of California, Berkeley, January 10 2006.
    • (2006)
    • Lee, E.A.1
  • 27
    • 35448987688 scopus 로고    scopus 로고
    • Combining events and threads for scalable network services: Implementation and evaluation of monadic, application-level concurrency primitives
    • June
    • P. Li and S. Zdancewic. Combining events and threads for scalable network services: Implementation and evaluation of monadic, application-level concurrency primitives. In PLDI, pages 189-199, June 2007.
    • (2007) PLDI , pp. 189-199
    • Li, P.1    Zdancewic, S.2
  • 29
    • 0003276135 scopus 로고
    • A Calculus of Communicating Systems
    • of, Springer
    • R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer, 1980.
    • (1980) LNCS , vol.92
    • Milner, R.1
  • 30
    • 0004181456 scopus 로고
    • A calculus of mobile processes, parts I and II
    • 89-85, University of Edinburgh, June
    • R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts I and II. Technical Report LFCS Report 89-85, University of Edinburgh, June 1989.
    • (1989) Technical Report LFCS Report
    • Milner, R.1    Parrow, J.2    Walker, D.3
  • 31
    • 21644431760 scopus 로고    scopus 로고
    • Why threads are a bad idea (for most purposes)
    • Invited talk
    • J. K. Ousterhout. Why threads are a bad idea (for most purposes). In Usenix Annual Tech. Conf., 1996. Invited talk.
    • (1996) Usenix Annual Tech. Conf
    • Ousterhout, J.K.1
  • 33
    • 0034829697 scopus 로고    scopus 로고
    • A fast automaton-based method for detecting anomalous program behaviors
    • R. Sekar, M. Bendre, D. Dhurjati, and P. Bollineni. A fast automaton-based method for detecting anomalous program behaviors. Security and Privacy, page 144, 2001.
    • (2001) Security and Privacy , pp. 144
    • Sekar, R.1    Bendre, M.2    Dhurjati, D.3    Bollineni, P.4
  • 34
    • 37849011411 scopus 로고    scopus 로고
    • Analysis of MPI programs
    • Technical Report UM-CS-2003-036, University of Massachusetts
    • S. F. Siegel and G. S. Avrunin. Analysis of MPI programs. Technical Report UM-CS-2003-036, University of Massachusetts, 2004.
    • (2004)
    • Siegel, S.F.1    Avrunin, G.S.2
  • 35
    • 84947255140 scopus 로고    scopus 로고
    • Alias types
    • ESOP, of
    • F. Smith, D. Walker, and J. G. Morrisett. Alias types. In ESOP, volume 1782 of LNCS, pages 366-381, 2000.
    • (2000) LNCS , vol.1782 , pp. 366-381
    • Smith, F.1    Walker, D.2    Morrisett, J.G.3
  • 36
  • 37
    • 85080647599 scopus 로고    scopus 로고
    • Why events are a bad idea (for high-concurrency servers)
    • R. von Behren, J. Condit, and E. Brewer. Why events are a bad idea (for high-concurrency servers). In HotOS, 2003.
    • (2003) HotOS
    • von Behren, R.1    Condit, J.2    Brewer, E.3


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