4 papers
Computational Modelling for Combinatorial Game Strategies
Răzvan Diaconescu
We develop a generic computational model that can be used effectively for establishing the existence of winning strategies for concrete finite combinatorial games. Our modelling is…
Decompositions of Stratified Institutions
Răzvan Diaconescu
The theory of stratified institutions is a general axiomatic approach to model theories where the satisfaction is parameterised by states of the models. In this paper we further de…
Introducing H, an institution-based formal specification and verification language
Răzvan Diaconescu
This is a short survey on the development of the formal specification and verification language H with emphasis on the scientific part. H is a modern highly expressive language sol…
Implicit Kripke Semantics and Ultraproducts in Stratified Institutions
Răzvan Diaconescu
We propose stratified institutions (a decade old generalised version of the theory of institutions of Goguen and Burstall) as a fully abstract model theoretic approach to modal log…