Rewriting-based symbolic methods for distributed system verification
Skeirik, Stephen
Loading…
Permalink
https://hdl.handle.net/2142/106224
Description
Title
Rewriting-based symbolic methods for distributed system verification
Author(s)
Skeirik, Stephen
Issue Date
2019-12-01
Director of Research (if dissertation) or Advisor (if thesis)
Meseguer, José
Doctoral Committee Chair(s)
Meseguer, José
Committee Member(s)
Agha, Gul
Roșu, Grigore
Ölveczky, Peter
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
rewriting logic
verification
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
