Files in this item



application/pdfSKEIRIK-DISSERTATION-2019.pdf (2MB)
(no description provided)PDF


Title:Rewriting-based symbolic methods for distributed system verification
Author(s):Skeirik, Stephen
Director of Research:Meseguer, José
Doctoral Committee Chair(s):Meseguer, José
Doctoral Committee Member(s):Agha, Gul; Roșu, Grigore; Ölveczky, Peter
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):rewriting logic
reachability logic
Abstract:As computer system complexity increases, new methods and logics are needed to scale up to the complexity of practical systems without sacrificing logical precision and ease of specification. To that end, the goal of this research project is to develop rewriting-based symbolic analysis methods that (1) can analyze systems which need an unbounded amount of time and/or space (2) may be highly distributed (3) use modular specification techniques so that work is never wasted (4) are generic across a possibly infinite number of domain theories. Towards this goal, we present our research on theory-generic satisfiability and rewrite-theory-generic specification and analysis methods, discuss prototype implementations, and consider future directions.
Issue Date:2019-12-01
Rights Information:Copyright 2019 Stephen Skeirik
Date Available in IDEALS:2020-03-02
Date Deposited:2019-12

This item appears in the following Collection(s)

Item Statistics