535 search results - page 38 / 107 » Checking Computations in Polylogarithmic Time |
142
click to vote
FORMATS
2009
Springer
16 years 16 days ago
2009
Springer
In this paper, we focus on the synthesis of secure timed systems which are given by timed automata. The security property that the system must satisfy is a non-interference propert...
158
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
This text is dedicated to modelling of real-time applications running under multitasking operating system. Theoretical background is based on timed automata by Alur and Dill. As th...
149
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
212
click to vote
CSFW
2000
IEEE
15 years 10 months ago
2000
IEEE
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably Æ , are reformulated here in a realtime setting. This is...
175
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...