This article, assuming that player motivations are the outcome of continuous player-environment interactions, applies the needs framework of Murray (1938) to a computer game and i...
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
The interplay back and forth between software model checking and hardware model checking has been fruitful for both. Originally intended for the analysis of concurrent software, mo...
Edmund M. Clarke, Anubhav Gupta, Himanshu Jain, He...
Much recent research has focused on the applications of games with ω-regular objectives in the control and verification of reactive systems. However, many of the game-based model...