Sciweavers

76 search results - page 11 / 16
» Reusing Proofs
Sort
View
FM
2003
Springer
160views Formal Methods» more  FM 2003»
15 years 2 months ago
Translation-Based Compositional Reasoning for Software Systems
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
Fei Xie, James C. Browne, Robert P. Kurshan
87
Voted
ECOOP
2000
Springer
15 years 1 months ago
Generic Wrappers
Abstract. Component software means reuse and separate marketing of pre-manufactured binary components. This requires components from different vendors to be composed very late, pos...
Martin Büchi, Wolfgang Weck
ENTCS
2007
121views more  ENTCS 2007»
14 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
CORR
2012
Springer
232views Education» more  CORR 2012»
13 years 5 months ago
A Formal Comparison of Approaches to Datatype-Generic Programming
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
José Pedro Magalhães, Andres Lö...
ASM
2010
ASM
15 years 4 months ago
Using Event-B to Verify the Kmelia Components and Their Assemblies
and formal model, named Kmelia [1,2], with an associated language to specify components, their provided and required services and their assemblies; we also developed a framework na...
Pascal André, Gilles Ardourel, Christian At...