Sciweavers

2060 search results - page 7 / 412
» The Composition of Event-B Models
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
13 years 9 months ago
Incremental Parametric Development of Greedy Algorithms
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
Dominique Cansell, Dominique Méry
IC3
2009
13 years 7 months ago
Verification of Liveness Properties in Distributed Systems
Abstract. This paper presents liveness properties that need to be preserved by Event-B models of distributed systems. Event-B is a formal technique for development of models of dis...
Divakar Yadav, Michael Butler
VSTTE
2010
Springer
13 years 7 months ago
An Approach of Requirements Tracing in Formal Refinement
Formal modeling of computing systems yields models that are intended to be correct with respect to the requirements that have been formalized. The complexity of typical computing s...
Michael Jastram, Stefan Hallerstede, Michael Leusc...
ICECCS
2010
IEEE
153views Hardware» more  ICECCS 2010»
13 years 10 months ago
Patterns for Modelling Time and Consistency in Business Information Systems
Abstract— Maintaining semantic consistency of data is a significant problem in distributed information systems, particularly those on which a business may depend. Our current wo...
Jeremy W. Bryans, John S. Fitzgerald, Alexander Ro...
POPL
1995
ACM
14 years 1 months ago
Default Timed Concurrent Constraint Programming
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta