Abstract

REST is a common architecture for networked applications. Applications that adhere to the REST constraints enjoy significant scaling advantages over other architectures. But REST is not a panacea for the task of building correct software. Algebraic models of computation, particularly CSP, prove useful to describe the composition of applications using REST. CSP enables us to describe and verify the behavior of RESTful systems. The descriptions of each component can be used independently to verify that a system behaves as expected. This thesis demonstrates and develops CSP methodology to verify the behavior of RESTful applications.

Advisor

Byrnes, Denise

Second Advisor

Kelvey, Robert

Department

Computer Science; Mathematics

Disciplines

Algebra | Logic and Foundations | Other Mathematics | Software Engineering | Systems Architecture | Theory and Algorithms

Publication Date

2018

Degree Granted

Bachelor of Arts

Document Type

Senior Independent Study Thesis

Share

COinS
 

© Copyright 2018 Maxwell Taylor