Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,350,542 papers from all fields of science
Search
Sign In
Create Free Account
Invariant (computer science)
Known as:
Invariant
, Programming invariant
In computer science, an invariant is a condition that can be relied upon to be true during execution of a program, or during some portion of it. It…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
38 relations
AP Computer Science A
AVL tree
Abstract interpretation
Assertion (software development)
Expand
Broader (2)
Computer programming
Formal methods
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
View-centric engineering with synchronized heterogeneous models
Max E. Kramer
,
Erik Burger
,
M. Langhammer
2013
Corpus ID: 1881652
Model-Driven Engineering provides an abstract representation of systems through the use of models and views. For complex systems…
Expand
Highly Cited
2008
Highly Cited
2008
Mitigating Android Software Misuse Before It Happens
W. Enck
,
Machigar Ongtang
,
P. Mcdaniel
2008
Corpus ID: 852499
Mobile phones running open operating systems such as Google Android will soon be the norm in cellular networks. These systems…
Expand
2007
2007
On the Evolution of Wikipedia
Rodrigo B. Almeida
,
Barzan Mozafari
,
Junghoo Cho
International Conference on Web and Social Media
2007
Corpus ID: 12567055
A recent phenomenon on the Web is the emergence and proliferation of new social media systems allowing social interaction between…
Expand
Highly Cited
1998
Highly Cited
1998
Magnetotelluric tensor decomposition: Part I, Theory for a basic procedure
Ted Lilley
1998
Corpus ID: 30701941
The problem of expressing a general 3-D magnetotelluric (MT) impedance tensor in the form of a 2-D tensor that has been distorted…
Expand
Highly Cited
1995
Highly Cited
1995
OnS-duality in Abelian gauge theory
E. Witten
1995
Corpus ID: 16092835
U(1) gauge theory onR4 is known to possess an electric-magnetic duality symmetry that inverts the coupling constant and extends…
Expand
1990
1990
Conditions for Implicit Parallelism
J. Grefenstette
Foundations of Genetic Algorithms
1990
Corpus ID: 14999286
Highly Cited
1988
Highly Cited
1988
A GAUGE INVARIANT ACTION IN TOPOLOGICAL QUANTUM FIELD THEORY
J. Labastida
,
M. Pernici
1988
Corpus ID: 54053958
Highly Cited
1986
Highly Cited
1986
Geometry of GP−V
V. Lakshmibai
,
C. S. Seshadri
1986
Corpus ID: 51762329
Highly Cited
1973
Highly Cited
1973
A minimal realization algorithm for matrix sequences
B. Dickinson
,
M. Morf
,
T. Kailath
IEEE Conference on Decision and Control
1973
Corpus ID: 122081045
We give an algorithm for solving the Pade approximation problem for matrix sequences over an arbitrary field. The algorithm is a…
Expand
Highly Cited
1972
Highly Cited
1972
Automatic computation of exponentials, logarithms, ratios and square roots
T. C. Chen
1972
Corpus ID: 6881449
It is shown how a relatively simple device can evaluate exponentials, logarithms, ratios and square roots for fraction arguments…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required