2137 search results - page 84 / 428 » Proving Abstract Non-interference |
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— This paper examines the stability of quantum feedback networks. We introduce a novel characterization, in terms of equivalence classes of operators, that may be used to...
MFCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
LPAR
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
SAFECOMP
1999
Springer
15 years 2 months ago
1999
Springer
During the last decade, the synchronous approach has proved to meet industrial needs concerning the development of Distributed Control Systems (DCS): as an example, Schneider Elect...