74 search results - page 3 / 15 » Boolean Games Revisited |
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We show how to find and fix faults in Boolean programs by extending the program to a game. In the game, the protagonist can select an alternative implementation for an incorrect st...
CPC
2004
13 years 7 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
APAL
2005
13 years 7 months ago
2005
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
We refine previous analyses of Hyland-Ong game semantics and its relation to - and