Name
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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/3-540-60692-0_55 | FSTTCS |
Keywords | Field | DocType |
object code optimization,"on the fly" bisimulation,observational equivalence,binary branchings,code optimization | Object code,Discrete mathematics,Combinatorics,Computer science,Observational equivalence,Algorithm,Equivalence (measure theory),Binary number | Conference |
ISBN | Citations | PageRank |
3-540-60692-0 | 6 | 0.64 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Caspi | 1 | 55 | 6.23 |
| Jean-Claude Fernandez | 2 | 395 | 29.17 |
| Alain Girault | 3 | 547 | 40.88 |