FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
Abstract. We propose syntax and semantics for systems of intuitionistic and classical first order dependently sorted logic, with and withlity, retaining type dependency, but other...
Abstract. The verification formalism / modeling and simulation language hybrid Chi is defined. The semantics of hybrid Chi is formally specified using Structured Operational Sem...
Ramon R. H. Schiffelers, D. A. van Beek, Ka L. Man...
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...
We introduce a Control Flow Analysis, that statically approximates the dynamic behaviour of processes, expressed in the Beta-Binders calculus. Our analysis of a system is able to ...