Browse by Subject "concurrency"

  • Kumar, Rajesh (2013-05-28)
    The Actor model is a promising model for programming new computing platforms such as the multicores and cloud computers, primarily due to features such as inherent concurrency and isolation of state. However, the model is ...

    application/pdf

    application/pdfPDF (711Kb)
  • Okur, Semih (2015-01-21)
    Parallel programming is hard. The industry leaders hope to convert the hard problem of using parallelism into the easier problem of using a parallel library. Yet, we know little about how programmers adopt these libraries ...

    application/pdf

    application/pdfPDF (683Kb)
  • Vakilian, Mohsen; Negara, Stas; Tasharofi, Samira; Johnson, Ralph E. (2011-08)
    Developing concurrent software is error prone. Others have cataloged common bug patterns in concurrent Java programs. But, there are no tools for detecting complex concurrency bug patterns accurately, and concurrent programs ...

    application/pdf

    application/pdfPDF (69Kb)
  • Vakilian, Mohsen; Negara, Stas; Tasharofi, Samira; Johnson, Ralph E. (2013-05)
    Bug patterns are coding idioms that may make the code less maintainable or turn into bugs in future. The state-of-the-art tools for detecting concurrency bug patterns (CBPs) perform simple, intraprocedural analyses. While ...

    application/pdf

    application/pdfPDF (392Kb)
  • Șerbănuță, Traian Florin; Roşu, Grigore (2010-09-22)
    Term rewriting proved to be a simple, uniform and powerful computational paradigm. Rewrite rules independently match and apply anywhere, unconstrained by the context. Rewriting is particularly appealing for defining ...

    application/pdf

    application/pdfPDF (755Kb)
  • Radoi, Cosmin; Dig, Danny (2012-11-12)
    Despite significant progress in recent years, the im- portant problem of static race detection remains open. Previous techniques took a general approach and looked for races by analyzing the effects induced by low-level ...

    application/pdf

    application/pdfPDF (415Kb)
  • Stefanescu, Andrei; Ciobaca, Stefan; Moore, Brandon; Serbanuta, Traian Florin; Rosu, Grigore (2013-11)
    This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (concurrent) languages, referred to as reachability logic. The proof system derives partial-correctness ...

    application/pdf

    application/pdfPDF (237Kb)
  • Dig, Danny (2010-07-01)
    In the multicore era, a major programming task will be to make programs more parallel. This is tedious because it requires changing many lines of code, and it is error-prone and non-trivial because programmers need to ...

    application/pdf

    application/pdfPDF (280Kb)
  • Serbanuta, Traian Florin (2011-01-14)
    A plethora of programming languages have been and continue to be developed to keep pace with hardware advancements and the ever more demanding requirements of software development. As these increasingly sophisticated ...

    application/pdf

    application/pdfPDF (4Mb)
  • Mansky, William (2014-05-30)
    Software developers, compiler designers, and formal methods researchers all stand to benefit from improved tools for compiler design and verification. Program correctness for compiled languages depends fundamentally on ...

    application/pdf

    application/pdfPDF (1Mb)
  • Griffith, Dennis; Gunter, Elsa L. (2012-11-30)
    In this paper, we introduce SLeRCN, an extension of Strategy Logic (SL). The extensions syntactic and semantic. The main syntactic extensions include lifting the restrictions in Chatterjee et al. [7] that formulae must be ...

    application/pdf

    application/pdfPDF (256Kb)
  • Lauterburg, Steven T. (2011-08-26)
    The growing use of multicore and networked computing systems is increasing the importance of developing reliable parallel and distributed code. Testing such code is notoriously difficult, especially for shared-memory models ...

    application/pdf

    application/pdfPDF (701Kb)