Static analysis of arithmetical congruences

In this paper, a new kind of static (or semantic) analysis is defined: congruence analysis, which is conceived to discover the properties of the following type: "the integer valued variable X is congruent to c modulo m", where c and m are automatically determined integers. This analysis is...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of computer mathematics Ročník 30; číslo 3-4; s. 165 - 190
Hlavný autor:	Granger, Philippe
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Abingdon Gordon and Breach Science Publishers 01.01.1989 Taylor and Francis
Predmet:	Abstract interpretation Applied sciences automatic vectorization Computer science; control theory; systems D.1.2 [Programming Techniques]: Automatic Programming D.3.4 [Processors]: Optimization Exact sciences and technology F.3.1 [Specifying and Verifying and Reasoning about Programs]: Invariants, Mechanical Verification F.3.2. [Semantics of Programming Languages]: Operational Semantics Programming theory semantic analysis Theoretical computing
ISSN:	0020-7160, 1029-0265
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!