Faculty Advisor

Dougherty, Daniel J.


This paper describes an algorithm, referred to as The Chase that nondeterministically generates models for a geometric theory. A set of jointly universal models is a set of models for which there exists a homomorphism from one or more models in the set to any other model that can satisfy the theory. Such sets are useful in solutions to problems in many practical applications, including but not limited to firewall configuration examination, protocol analysis, and access control evaluation. The set of all models The Chase can generate is jointly universal. A Haskell implementation of The Chase and its development process and design decisions are documented. The implementation can determine all possible outputs of The Chase given any input theory.


Worcester Polytechnic Institute

Date Accepted

October 2010


Computer Science

Project Type

Major Qualifying Project



Advisor Department

Computer Science