442 search results - page 32 / 89 » Proof Abstraction for Imperative Languages |
ESOP
2000
Springer
14 years 9 days ago
2000
Springer
Abstract. We propose a new type discipline for the -calculus in which secure information flow is guaranteed by static type checking. Secrecy levels are assigned to channels and are...
ESOP
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In this article, we present a model and a denotational semantics for hybrid systems. Our model is designed to be used for the verification of large, existing embedded app...
FMOODS
2008
13 years 10 months ago
2008
Abstract. Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing...
MICS
2010
13 years 7 months ago
2010
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
BIRTHDAY
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. This article provides an overview over two constructive approaches to provably correct hard real-time code generation where hard real-time code is generated from abstract...