2137 search results - page 106 / 428 » Proving Abstract Non-interference |
135
Voted
JAR
2002
15 years 2 months ago
2002
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
147
Voted
MFCS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
132
Voted
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
121
Voted
ICFP
2008
ACM
16 years 2 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
107
Voted
CONCUR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are...