2137 search results - page 127 / 428 » Proving Abstract Non-interference |
132
click to vote
ECSQARU
1993
Springer
15 years 7 months ago
1993
Springer
Abstract. This paper discusses the relationship between incidence calculus and the ATMS. It shows that managing labels for statements in an ATMS is similar to producing the inciden...
MFCS
1993
Springer
15 years 7 months ago
1993
Springer
Abstract This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models...
163
Voted
ESOP
1992
Springer
15 years 7 months ago
1992
Springer
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated comp...
128
Voted
NIXDORF
1992
15 years 7 months ago
1992
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...
108
click to vote
FPCA
1989
15 years 7 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...