In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
In this paper we explore a generalization of traditional abduction which can simultaneously perform two different tasks: (i) given an unprovable sequent G, find a sentence H such ...
Marcello D'Agostino, Marcelo Finger, Dov M. Gabbay
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...