13383 search results - page 293 / 2677 » Abstractions from proofs |
169
click to vote
ARTS
1997
Springer
15 years 11 months ago
1997
Springer
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
177
click to vote
ACNS
2009
Springer
15 years 10 months ago
2009
Springer
Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicio...
180
click to vote
ESOP
2007
Springer
15 years 10 months ago
2007
Springer
Non-interference is a semantical condition on programs that guarantees the absence of illicit information flow throughout their execution, and that can be enforced by appropriate i...
184
click to vote
ESORICS
2007
Springer
15 years 10 months ago
2007
Springer
We present a new technique for generating a formal proof that an access request satisfies accesscontrol policy, for use in logic-based access-control frameworks. Our approach is t...
148
click to vote
DM
2010
15 years 6 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...