Dept. of Computer Science

 

The Department of Computer Science is recognized throughout the world as a leader in education and research. The department and its graduates have long been at the forefront of modern computing beginning with the ILLIAC in 1952, and continuing with the creation of Mosaic, the first graphic web browser, through the most recent Internet era.

Browse Sub-communities

Browse Collections of Items

Recent AdditionsRSS feed

  • KEVM: A Complete Semantics of the Ethereum Virtual Machine 
    Everett Hildenbrandt; Manasvi Saxena; Xiaoran Zhu; Nishant Rodrigues; Philip Daian; Dwight Guth; Grigore Rosu (2017-08-01)
    A developing field of interest for the distributed systems and applied cryptography community is that of smart contracts: self-executing financial instruments that synchronize their state, often through a blockchain. One ...

    application/pdf

    application/pdfPDF (426kB)
  • Design, Formal Modeling, and Validation of Cloud Storage Systems using Maude 
    Bobba, Rakesh; Grov, Jon; Gupta, Indranil; Liu, Si; Meseguer, Jose; Olveczky, Peter C.; Skeirik, Stephen (2017-06-28)
    To deal with large amounts of data while offering high availability, throughput and low latency, cloud computing systems rely on distributed, partitioned, and replicated data stores. Such cloud storage systems ...

    application/pdf

    application/pdfPDF (1MB)
  • Variant-Based Decidable Satisfiability in Initial Algebras with Predicates 
    Gutierrez, Raul; Meseguer, Jose (2017-06-27)
    Decision procedures can be either theory specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability is a theory-generic procedure ...

    application/pdf

    application/pdfPDF (439kB)
  • Extending Parikh's Theorem to Weighted and Probabilistic Context-Free Grammars 
    Bhattiprolu, Vijay; Gordon, Spencer; Viswanathan, Mahesh (2017-06-23)
    We prove an analog of Parikh's theorem for weighted context-free grammars over commutative, idempotent semirings, and exhibit a stochastic context-free grammar with behavior that cannot be realized by any stochastic ...

    application/pdf

    application/pdfPDF (299kB)
  • Modular Verification of Protocol Equivalence in the Presence of Randomness 
    Bauer, Matthew S; Chadha, Rohit; Viswanathan, Mahesh (2017)
    Security protocols that provide privacy and anonymity guarantees are growing increasingly prevalent in the online world. The highly intricate nature of these protocols makes them vulnerable to subtle design flaws. Formal ...

    application/pdf

    application/pdfPDF (558kB)

Community Statistics