AbstractPaper discusses some issues related to the utility of finite games for early formal methods teaching and for validation of automatic tools which implement formal methods. In particular, some experience with (1) undergraduate teaching model checking via finite games, (2) solving game-based constraints via model checking, (3) testing model checkers against game test suits is presented. Basic ideas are illustrated by a model checking based solution for a complicated puzzle how to identify a unique false coin among given ones balancing them limited times
The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to s...
Abstract. Teaching formal methods is notoriously difficult but it is also often argued that formal m...
In today's computer engineering, requirements for generally high reliability have pushed the notion ...
AbstractPaper discusses some issues related to the utility of finite games for early formal methods ...
In spite of the importance of Formal Methods for development of a reliable hard- and software this d...
2 Abstract This dissertation deals with a number of algorithmic problems motivated bycomputer aided ...
Automatic formal verification methods for finite-state systems, also known as model-checking, succes...
The key tool in proving inexpressibility results in finite-model theory is EhrenfeuchtFra iss'e...
Interactive theorem proving provides a general approach to modeling and verification of both finite-...
It is well-known that various propo-sitional program logics (like Computa-tional Tree Logic CTL [1])...
Game semantics has emerged as a paradigm for giving semantics to a wide range of programming languag...
Computer programs keep finding their ways into new safety-critical applications, while at the same t...
Many practical problems where the environment is not in the system's control such as service orchest...
Every logic comes with several decision problems. One of them is the model checking problem: does a ...
Abstract. In this article we apply the technique of model checking to puzzle games. We develop a too...
The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to s...
Abstract. Teaching formal methods is notoriously difficult but it is also often argued that formal m...
In today's computer engineering, requirements for generally high reliability have pushed the notion ...
AbstractPaper discusses some issues related to the utility of finite games for early formal methods ...
In spite of the importance of Formal Methods for development of a reliable hard- and software this d...
2 Abstract This dissertation deals with a number of algorithmic problems motivated bycomputer aided ...
Automatic formal verification methods for finite-state systems, also known as model-checking, succes...
The key tool in proving inexpressibility results in finite-model theory is EhrenfeuchtFra iss'e...
Interactive theorem proving provides a general approach to modeling and verification of both finite-...
It is well-known that various propo-sitional program logics (like Computa-tional Tree Logic CTL [1])...
Game semantics has emerged as a paradigm for giving semantics to a wide range of programming languag...
Computer programs keep finding their ways into new safety-critical applications, while at the same t...
Many practical problems where the environment is not in the system's control such as service orchest...
Every logic comes with several decision problems. One of them is the model checking problem: does a ...
Abstract. In this article we apply the technique of model checking to puzzle games. We develop a too...
The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to s...
Abstract. Teaching formal methods is notoriously difficult but it is also often argued that formal m...
In today's computer engineering, requirements for generally high reliability have pushed the notion ...