Name
Abstract | ||
|---|---|---|
Programs are often subjected to significant optimizing and parallelizing transformations based on extensive dependence analysis. Formal validation of such transformations needs modelling paradigms which can capture both control and data dependences in the program vividly. Being value-based with an inherent scope of capturing parallelism, the untimed coloured Petri net (CPN) models, reported in the literature, fit the bill well; accordingly, they are likely to be more convenient as the intermediate representations (IRs) of both the source and the transformed codes for translation validation than strictly sequential variable-based IRs like sequential control flow graphs (CFGs). In this work, an efficient path-based equivalence checking method for CPN models of programs on integers is presented. Extensive experimentation has been carried out on several sequential and parallel examples. Complexity and correctness issues have been treated rigorously for the method. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s00236-022-00419-z | ACTA INFORMATICA |
DocType | Volume | Issue |
Journal | 59 | 6 |
ISSN | Citations | PageRank |
0001-5903 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Soumyadip Bandyopadhyay | 1 | 0 | 0.34 |
| Dipankar Sarkar | 2 | 0 | 0.34 |
| Chittaranjan Mandal | 3 | 0 | 0.34 |
| Holger Giese | 4 | 2345 | 164.90 |