An algorithm for reducing binary branchings

  • Paul Caspi
  • Jean -Claude Fernandez
  • Alain Girault
Process Algebras
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1026)


In this paper we propose an algorithm suppressing useless boolean tests in object code, for programs translatable into deterministic labeled transition systems. This algorithm is based on the notion of test equivalence, a variant of the classical observational equivalence: a test is useless iff each branch leads to equivalent states, the test labels being considered as invisible actions.

Key words

object code optimization observational equivalence “on the fly” bisimulation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Austry and G. Boudol. Algèbre de processus et synchronisation. Theoretical Computer Science, 30:91–131, April 1984.Google Scholar
  2. [2]
    D. Callahan and K. Kennedy. Compiling programs for distributed memory multiprocessors. Journal of Supercomputing, 2(2):151–169, June 1988.Google Scholar
  3. [3]
    P. Caspi, J.C. Fernandez, and A. Girault. An algorithm for reducing binary branchings: implementation and formal proof. Research Report INRIA, France, 1994.Google Scholar
  4. [4]
    P. Caspi, A. Girault, and D. Pilaud. Distributing reactive systems. In Seventh International Conference on Parallel and Distributed Computing Systems, PDCS'94, Las Vegas, USA, October 1994. ISCA.Google Scholar
  5. [5]
    J.C. Fernandez and L. Mounier. “on the fly” verification of behavioural equivalences and preorders. In K.G. Larsen, editor, Proceedings of the 3rd workshop on computeraided verification, CAV'91, July 1991.Google Scholar
  6. [6]
    D.E. Knuth. The Art of Computer Programming, volume III: Sorting and Searching of Computer Science and Information Processing. Addison-Wesley, Reading, Massachussets, 1973.Google Scholar
  7. [7]
    K.G. Larsen. Efficient local correctness checking. In G.V. Bochmann and D.K. Probst, editors, Proceedings of the 4th workshop on computer-aided verification, CAV'92, July 1992.Google Scholar
  8. [8]
    R. Milner. A calculus of communicating systems. LNCS, 92, 1980.Google Scholar
  9. [9]
    D. Park. Concurrency and automata on infinite sequences. In 5th GI-Conference on Theorical Computer Science. Springer Verlag, 1981. LNCS 104.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Paul Caspi
    • 1
  • Jean -Claude Fernandez
    • 1
  • Alain Girault
    • 2
  1. 1.Verimag, Miniparc - ZIRSTMontbonnotFrance
  2. 2.Centre de Mathématiques AppliquéesINRIA Meije projectSophia Antipolis cedexFrance

Personalised recommendations