Research and Tech Reports - Computer Science

Recent AdditionsRSS feed

  • Li, Liyi; Gunter, Elsa L. (2018-06-25)
    K (Roşu and Şerbănuţă, 2010) is a rewrite-based executable semantic framework in which programming languages, type systems and formal analysis tools can be de ned using con gurations, computations and rules. In this paper ...

    application/pdf

    application/pdfPDF (724kB)
  • Stephens, Sam C (2018-05)
    Maude is an equational and rewriting logic specification tool. It allows a unique and simple way of specifying concurrent programs and lends itself nicely to verification. This senior thesis focuses specifically on patterns ...

    application/pdf

    application/pdfPDF (282kB)
  • Duran, Francisco; Meseguer, Jose; Rocha, Camilo (2018-03-20)
    Terminating functional programs should be deterministic, i.e., should evaluate to a unique result, regardless of the evaluation order. For equational functional programs such determinism is exactly captured by ...

    application/pdf

    application/pdfPDF (209kB)
  • Meseguer Jose (2018-03-19)
    A new notion of generalized rewrite theory suitable for symbolic reasoning and generalizing the standard notion is motivated and defined. Also, new requirements for symbolic executability of generalized rewrite theories ...

    application/pdf

    application/pdfPDF (439kB)
  • Sandur, Atul; Elgamal, Tarek; Agha, Gul; Nahrstedt, Klara (2018)
    Internet of Things (IoT) applications generate massive amounts of real-time data. Owners of such data strive to make predictions/inference from large streams of complex input such as video feeds, often by deploying ...

    application/pdf

    application/pdfPDF (324kB)

Collection Statistics