Parallel program design: a foundation
Parallel program design: a foundation
Programming from specifications
Programming from specifications
Concurrency without toil: a systematic method for parallel program design
Science of Computer Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Evolving algebras 1993: Lipari guide
Specification and validation methods
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
A Discipline of Programming
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Introduction to Algorithms
Incremental Proof of the Producer/Consumer Property for the PCI Protocol
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Introducing Dynamic Constraints in B
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
A Formal Approach To Large Software Construction
Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University
Refinement-based verification of local synchronization algorithms
FM'11 Proceedings of the 17th international conference on Formal methods
Multi-process systems analysis using event b: application to group communication systems
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
A stepwise development of the peterson's mutual exclusion algorithm using b abstract systems
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Time constraint patterns for event b development
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Model-Driven security policy deployment: property oriented approach
ESSoS'10 Proceedings of the Second international conference on Engineering Secure Software and Systems
Formal verification of coalescing graph-coloring register allocation
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
Graphs algorithms and graph-theoretical problems provide a challenging battle field for the incremental development of proved models. The B event-based approach implements the incremental and proved development of abstract models which are translated into algorithms; we focus our methodology on the minimum spanning tree problem and on Prim's algorithm. The correctness of the resulting solution is based on properties over trees and we show how the greedy strategy is efficient in this case. We compare properties proven mechanically to the properties found in a classical algorithms textbook.