2137 search results - page 80 / 428 » Proving Abstract Non-interference |
CIE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
CIE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
CSR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— In the framework of the ISS Lyapunov formulation a small gain theorem has recently been proved which allows the explicit construction of Lyapunov functions for intercon...
FMCAD
2007
Springer
15 years 4 months ago
2007
Springer
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...