Sciweavers

5 search results - page 1 / 1
» Solving Games Via Three-Valued Abstraction Refinement
Sort
View
CONCUR
2007
Springer
13 years 11 months ago
Solving Games Via Three-Valued Abstraction Refinement
Games via Three-Valued Abstraction Refinement Luca de Alfaro, Pritam Roy PII: S0890-5401(10)00018-0 DOI: 10.1016/j.ic.2009.05.007 Reference: YINCO 3711 To appear in: Information an...
Luca de Alfaro, Pritam Roy
ANTSW
2010
Springer
13 years 3 months ago
A Cooperative Network Game Efficiently Solved via an Ant Colony Optimization Approach
Abstract. In this paper, a Cooperative Network Game (CNG) is introduced. In this game, all players have the same goal: display a video content in real time, with no cuts and low bu...
Pablo Romero, Franco Robledo, Pablo Rodrígu...
FORMATS
2010
Springer
13 years 3 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
SDMW
2004
Springer
13 years 10 months ago
Abstracting and Refining Authorization in SQL
ing and Refining Authorization in SQL Arnon Rosenthal, Edward Sciore1 The SQL standard specifies authorization via a large set of rather opaque rules, which are difficult to unders...
Arnon Rosenthal, Edward Sciore
IFIP
2010
Springer
13 years 3 days ago
Information Flow Analysis via Path Condition Refinement
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
Mana Taghdiri, Gregor Snelting, Carsten Sinz