Sciweavers

Share
8 search results - page 1 / 2
» ASM Refinement Preserving Invariants
Sort
View
JUCS
2008
166views more  JUCS 2008»
11 years 6 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
ASM
2008
ASM
11 years 8 months ago
The Composition of Event-B Models
The transition from classical B [2] to the Event-B language and method [3] has seen the removal of some forms of model structuring and composition, with the intention of reinventin...
Michael Poppleton
COMBINATORICS
2000
89views more  COMBINATORICS 2000»
11 years 6 months ago
Large Dihedral Symmetry of the Set of Alternating Sign Matrices
We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data aris...
Benjamin Wieland
ASM
2010
ASM
11 years 9 months ago
Starting B Specifications from Use Cases
The B method is one of the most used formal methods, when reactive systems is under question, due to good support for refinement. However, obtaining the formal model from requireme...
Thiago C. de Sousa, Aryldo G. Russo
KBSE
1999
IEEE
11 years 10 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
books