Standard

Analysis of the equality relations for the program terms. / Emelianov, P. G.

Static Analysis - 3rd International Symposium, SAS 1996, Proceedings. Springer-Verlag GmbH and Co. KG, 1996. p. 174-188 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1145).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Emelianov, PG 1996, Analysis of the equality relations for the program terms. in Static Analysis - 3rd International Symposium, SAS 1996, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1145, Springer-Verlag GmbH and Co. KG, pp. 174-188, 3rd International Static Analysis Symposium, SAS 1996, Aachen, Germany, 24.09.1996.

APA

Emelianov, P. G. (1996). Analysis of the equality relations for the program terms. In Static Analysis - 3rd International Symposium, SAS 1996, Proceedings (pp. 174-188). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1145). Springer-Verlag GmbH and Co. KG.

Vancouver

Emelianov PG. Analysis of the equality relations for the program terms. In Static Analysis - 3rd International Symposium, SAS 1996, Proceedings. Springer-Verlag GmbH and Co. KG. 1996. p. 174-188. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Author

Emelianov, P. G. / Analysis of the equality relations for the program terms. Static Analysis - 3rd International Symposium, SAS 1996, Proceedings. Springer-Verlag GmbH and Co. KG, 1996. pp. 174-188 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{e8d263d6771c455aad45b12e0acf03d6,
title = "Analysis of the equality relations for the program terms",
abstract = "In this article an abstract interpretation and formal language based analysis for imperative programs is presented. This analysis makes a lower approximation of the equality relations for the program terms, i.e. for a given program point our analysis produces a set of equalities t1=t2 where t1 and t2 represent program expressions such that their values are equal for any behavior of the program if this program point is reached. The results of the analysis can be used for debugging, verification, optimization and specialization of programs. An abstract semantics of Pascal-like language is described and some examples of the analysis are given.",
author = "Emelianov, {P. G.}",
year = "1996",
month = jan,
day = "1",
language = "English",
isbn = "3540617396",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "174--188",
booktitle = "Static Analysis - 3rd International Symposium, SAS 1996, Proceedings",
address = "Germany",
note = "3rd International Static Analysis Symposium, SAS 1996 ; Conference date: 24-09-1996 Through 26-09-1996",

}

RIS

TY - GEN

T1 - Analysis of the equality relations for the program terms

AU - Emelianov, P. G.

PY - 1996/1/1

Y1 - 1996/1/1

N2 - In this article an abstract interpretation and formal language based analysis for imperative programs is presented. This analysis makes a lower approximation of the equality relations for the program terms, i.e. for a given program point our analysis produces a set of equalities t1=t2 where t1 and t2 represent program expressions such that their values are equal for any behavior of the program if this program point is reached. The results of the analysis can be used for debugging, verification, optimization and specialization of programs. An abstract semantics of Pascal-like language is described and some examples of the analysis are given.

AB - In this article an abstract interpretation and formal language based analysis for imperative programs is presented. This analysis makes a lower approximation of the equality relations for the program terms, i.e. for a given program point our analysis produces a set of equalities t1=t2 where t1 and t2 represent program expressions such that their values are equal for any behavior of the program if this program point is reached. The results of the analysis can be used for debugging, verification, optimization and specialization of programs. An abstract semantics of Pascal-like language is described and some examples of the analysis are given.

UR - http://www.scopus.com/inward/record.url?scp=0347349159&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0347349159

SN - 3540617396

SN - 9783540617396

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 174

EP - 188

BT - Static Analysis - 3rd International Symposium, SAS 1996, Proceedings

PB - Springer-Verlag GmbH and Co. KG

T2 - 3rd International Static Analysis Symposium, SAS 1996

Y2 - 24 September 1996 through 26 September 1996

ER -

ID: 14280606