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.
This work has been partially supported by GRECO Automatique Action C2A, Ministère de l'Enseignement Supérieur et de la Recherche and Schneider Electric.
Vermag is a joint laboratory of CNRS, INPG, UJF and Verilog S.A. associated with IMAG
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Austry and G. Boudol. Algèbre de processus et synchronisation. Theoretical Computer Science, 30:91–131, April 1984.
D. Callahan and K. Kennedy. Compiling programs for distributed memory multiprocessors. Journal of Supercomputing, 2(2):151–169, June 1988.
P. Caspi, J.C. Fernandez, and A. Girault. An algorithm for reducing binary branchings: implementation and formal proof. Research Report INRIA, France, 1994.
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.
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.
D.E. Knuth. The Art of Computer Programming, volume III: Sorting and Searching of Computer Science and Information Processing. Addison-Wesley, Reading, Massachussets, 1973.
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.
R. Milner. A calculus of communicating systems. LNCS, 92, 1980.
D. Park. Concurrency and automata on infinite sequences. In 5th GI-Conference on Theorical Computer Science. Springer Verlag, 1981. LNCS 104.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caspi, P., Fernandez, J.C., Girault, A. (1995). An algorithm for reducing binary branchings. In: Thiagarajan, P.S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1995. Lecture Notes in Computer Science, vol 1026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60692-0_55
Download citation
DOI: https://doi.org/10.1007/3-540-60692-0_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60692-5
Online ISBN: 978-3-540-49263-4
eBook Packages: Springer Book Archive