Research and Tech Reports - Computer Science

Recent AdditionsRSS feed

  • Lin, Zhengyao; Chen, Xiaohong; Rosu, Grigore (2021-10-04)
    Matching logic is a uniform logical foundation for K, which is a language semantics framework with the philosophy that all tooling around a language should be automatically generated from a single, rigorous definition of ...

    application/pdf

    application/pdfPDF (124kB)
  • Zhengyao Lin; XIaohong Chen; Minh-Thai Trinh; John Wang; Grigore Rosu (2021-08-22)
    In an ideal language framework, language designers only need to define the formal semantics of their languages. Deductive program verifiers and other language tools are automatically generated by the framework. In this ...

    application/pdf

    application/pdfPDF (1MB)
  • Liang, Lei; Liu, Si (2021-07-23)
    Developing correct, scalable, and fault-tolerant distributed databases is hard and labor-intensive. The increasing complexity of such systems under modern cloud infrastructures, e.g., geo-replicated multi-partitioned ...

    application/pdf

    application/pdfPDF (352kB)
  • Xiaohong Chen; Zhengyao Lin; Minh-Thai Trinh; Grigore Rosu (2021-04)
    We pursue the vision of an ideal language framework, where programming language designers only need to define the formal syntax and semantics of their languages, and all language tools are automatically generated by the ...

    application/pdf

    application/pdfPDF (1MB)
  • Tusil, Jan; Chen, Xiaohong; Rosu, Grigore (2021)
    Matching logic is a uniform logic to specify and reason about programming languages and program properties. Many important logics and/or formal systems have been shown to be definable in matching logic as logical theories. ...

    application/pdf

    application/pdfPDF (847kB)

Collection Statistics