Invariant Preservation
Invariant Preservation is a formal correctness criterion in refinement calculus that ensures a designated predicate remains true throughout the execution of a program transformation by guaranteeing its validity before and after each computational step.
75
Publications
3.5K
Citations
173
Authors
101
Institutions
Publications per year
2017–2026
17
Parents
75
Translation validation for an optimizing compiler
George C. Necula · 2000 · 487 citations
Fast, effective dynamic compilation
Joel Auslander, Matthai Philipose, Craig Chambers et al. · 1996 · 189 citations · Full text
A survey of linear preserver problems contents
Linear and Multilinear Algebra · 1992 · 156 citations
1–5 of 75
173
5
h-index
4
h-index
3
h-index
Institut national de recherche en sciences et technologies du numérique, France
3 publications · 165 citations
3
h-index
3
h-index
1–5 of 173
101
University of California, Berkeley
Berkeley, United States
5 h-index
9 publications
764 citations
Microsoft (United States)
Redmond, United States
4 h-index
4 publications
70 citations

Universidade Nova de Lisboa
Lisbon, Portugal
4 h-index
15 publications
772 citations

Stevens Institute of Technology
Hoboken, United States
3 h-index
3 publications
58 citations
University of Washington
Seattle, United States
3 h-index
12 publications
1.1K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
3 h-index
6 publications
330 citations

University of Central Florida
Orlando, United States
2 h-index
4 publications
88 citations

University of British Columbia
Vancouver, Canada
2 h-index
3 publications
280 citations
1–8 of 101
3 publications · 189 citations
3
h-index
PACMPL · 3 publications · 59 citations
3
h-index
Repository · 2 publications · 91 citations
2
h-index
TSE · 2 publications · 32 citations
2
h-index
2 publications · 44 citations
2
h-index
1–5