Automatic Refinement of Split Binary Semaphore

TitleAutomatic Refinement of Split Binary Semaphore
Publication TypeConference Paper
Year of Publication2007
AuthorsBarsotti, D, Blanco, JO
EditorJones, CB, Liu, Z, Woodcock, J
Conference NameTheoretical Aspects of Computing - ICTAC 2007, 4th International Colloquium, Macau, China, September 26-28, 2007, Proceedings
PublisherSpringer
ISBN Number978-3-540-75290-5
AbstractBinary semaphores can be used to implement conditional critical regions by using the split binary semaphore (SBS) technique. Given a specification of a conditional critical regions problem, the SBS technique provides not only the resulting programs but also some invariants which ensure the correctness of the solution. The programs obtained in this way are generally not efficient. However, they can be optimized by strengthening these invariants and using them to eliminate unnecessary tests. We present a mechanical method to perform these optimizations. The idea is to use the backward propagation technique over a guarded transition system that models the behavior of the programs generated by the SBS. This process needs proving heavy implications and simplifying growing invariants. Our method automatically entrusts these tasks to the Isabelle theorem prover and the CVC Lite validity checker. We have tested our method on a number of classical examples from concurrent programming.
DOI10.1007/978-3-540-75292-9_5
Powered by Drupal