34 search results - page 5 / 7 » Transactional Reduction of Component Compositions |
109
Voted
ICSE
2003
IEEE-ACM
16 years 3 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
155
Voted
BIRTHDAY
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
120
Voted
ICSE
2009
IEEE-ACM
15 years 10 months ago
2009
IEEE-ACM
The wide diffusion of reliable Internet is pushing two key novelties in the conception of modern software applications: the Software as a Service paradigm and the idea of the Inte...
166
Voted
TACAS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
115
Voted
SIGSOFT
2003
ACM
16 years 4 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...