Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
d Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA We explore an axiomatize...
Brian E. Aydemir, Aaron Bohannon, Stephanie Weiric...
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...