Laser scanning of MOS IC's reveals internal logic states nondestructively
A laser scanning system has been used to observe the internal logic pattern in a MOS LSI device in a nondestructive manner. The laser scanner has also been used to selectively change logic states deep within the device. Pictures of the logic patterns revealed by the scanner are discussed.
LOGIC FAILUREANALYSIS OF CMOS VLSIUSINGA LASER PROBE
An improvedtechniquefor usinga focused laser beam to extract logical levels of internalIC transistorsin a non-contactand non-destructivemanner is introduced and described.Advances in the detection scheme coupled with computer control and signal processingallowautomatedoperation. Various tests were performed on CMOS microprocessorsto exemplifythe frequency, noise, and drift insensitivityof the detection scheme. These results will be presented,along with a discussion on the practical use of the techniqueand its extension for testing NMOS and bipolar technologies. - I 1940's , 1950's A 1960's 5 1970's 1980's , 1990's Time 'V
Decidability of some intuitionistic predicate theories
Suppose T is a first order intuitionistic theory (more precisely, a theory of Heyting's predicate calculus, e.g., abelian groups, one unary function, dense linear order, etc.) presented to us by a set of axioms (denoted also by) T. Question. Is T decidable? One knows that if the classical counterpart of T (i.e., take the same axioms but with the classical predicate calculus as the underlying logic) is not decidable, then T cannot be decidable. The problem remains for theories whose classical counterpart is decidable. In [8], sufficient conditions for undecidability were given, and several intuitionistic theories such as abelian groups and unary functions (both with decidable equality) were shown to be undecidable. In this note we show decidability results (see Theorems 1 and 2 below), and compare these results with the undecidability results previously obtained. The method we use is the reduction-method, described fully in [12] and widely applied in [3], which is applied here roughly as follows: Let T be a given theory of Heyting's predicate calculus. We know that Heyting's predicate calculus is complete for the Kripke-model type of semantics. We choose a class M of Kripke models for which T is complete, i.e., all axioms of T are valid in any model of the class and whenever φ is not a theorem of T, φ is false in some model of M.