An algorithm for reducing binary branchings

Abstract

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.

BibTeX entry

@InProceedings{CFG95,
  author = 	 {P. Caspi and J.-C. Fernandez and A. Girault},
  title = 	 {An Algorithm for Reducing Binary Branchings},
  booktitle = 	 {Fifteenth Conference on the Foundations of Software 
		  Technology and Theoretical Computer Science, FST\&TCS'95},
  editor = 	 {P.S. Thiagarajan},
  volume = 	 {1026},
  series = 	 {LNCS},
  year = 	 {1995},
  publisher =    {Springer Verlag},
  address = 	 {Bangalore, India},
  month = 	 {December}
}

© Springer Verlag