3 papers
cs.LO2024
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…
math.LO2019
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…
math.LO2016
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…