Sciweavers

5084 search results - page 217 / 1017
» Proving Possibility Properties
Sort
View
ENTCS
2007
120views more  ENTCS 2007»
15 years 6 months ago
Non-Interference Control Synthesis for Security Timed Automata
In this paper, the problem of synthesizing controllers that ensures non interference for multilevel security dense timed discrete event systems modeled by an extension of Timed Au...
Guillaume Gardey, John Mullins, Olivier H. Roux
MSCS
2008
97views more  MSCS 2008»
15 years 6 months ago
Logical relations for monadic types
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
EOR
2007
111views more  EOR 2007»
15 years 6 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville
LOGCOM
2006
105views more  LOGCOM 2006»
15 years 6 months ago
A Hybrid Intuitionistic Logic: Semantics and Decidability
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate propertie...
Rohit Chadha, Damiano Macedonio, Vladimiro Sassone
SIAMDM
2008
143views more  SIAMDM 2008»
15 years 6 months ago
Coloring Bull-Free Perfectly Contractile Graphs
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
Benjamin Lévêque, Frédé...