Now showing items 1-7 of 7

    • Bounded Model Checking of Industrial Code 

      Priya, Siddharth (University of Waterloo, 2021-09-14)
      Abstract: Bounded Model Checking(BMC) is an effective and precise static analysis technique that reduces program verification to satisfiability (SAT) solving. However, with a few exceptions, BMC is not actively used in ...
    • Decompilation of Binaries into LLVM IR for Automated Analysis 

      Toor, Tejvinder (University of Waterloo, 2022-01-25)
      Complexity in malicious software is increasing to avoid detection and mitigation. As such, there is greater interest in using automation for reverse engineering. Current state-of-the-art tools use proprietary intermediate ...
    • Expressive and Efficient Memory Representation for Bounded Model Checking of C programs 

      Zhou, Xiang (University of Waterloo, 2022-12-13)
      Ensuring memory safety in programs has been an important yet difficult topic of research. Most static analysis approaches rely on the theory of arrays to model memory access. The limitation of the theory of arrays in terms ...
    • Hubble Spacer Telescope 

      Ramanathan, Aishwarya (University of Waterloo, 2022-01-19)
      Visualizing a model checker’s run on a model can be useful when trying to gain a deeper understanding of the verification of the particular model. However, it can be difficult to formalize the problem that visualization ...
    • Local Reasoning for Parameterized First Order Protocols 

      Ashmore, Rylo (University of Waterloo, 2019-08-14)
      First Order Logic (FOL) is a powerful reasoning tool for program verification. Recent work on Ivy shows that FOL is well suited for verification of parameterized distributed systems. However, specifying many natural objects, ...
    • Smart Contract Analysis Through Communication Abstractions 

      Wesley, Arthur (University of Waterloo, 2021-09-07)
      Smart contracts are programs that manage interactions between many users. Recently, Solidity smart contract have become a popular way to enforce financial agreements between untrusting users. However, such agreements do ...
    • Strong Induction in Hardware Model Checking 

      Vediramana Krishnan, Hari Govind (University of Waterloo, 2019-08-14)
      Symbolic Model checking is a widely used technique for automated verification of both hardware and software systems. Unbounded SAT-based Symbolic Model Checking (SMC) algorithms are very popular in hardware verification. ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages