Results 231 to 240 of about 2,335,361 (286)
Some of the next articles are maybe not open access.
Communications of the ACM, 1976
Most present systems for verification of computer programs are incomplete in that intermediate inductive assertions must be provided manually by the user, termination is not proven, and incorrect programs are not treated. As a unified solution to these problems, this paper suggests conducting a logical analysis of programs by using invariants which ...
Shmuel Katz, Zohar Manna
openaire +2 more sources
Most present systems for verification of computer programs are incomplete in that intermediate inductive assertions must be provided manually by the user, termination is not proven, and incorrect programs are not treated. As a unified solution to these problems, this paper suggests conducting a logical analysis of programs by using invariants which ...
Shmuel Katz, Zohar Manna
openaire +2 more sources
An Application of Logic to Analysis
Canadian Journal of Mathematics, 1976Let F be a complex analytic subvariety of an open subset of Cn and p ϵ V let be the germs at p of holomorphic, weakly holomorphic, infinitely differentiable, and k times continuously differentiate functions respectively. Spallek [15] has shown that for any p £ V there exists an integer such that , generalizing the result of Malgrange [12] that .In ...
Becker, Joseph, Lipshitz, Leonard
openaire +1 more source
2017
Before that a real architecture of system could be defined, by selecting some suitable components, available on the market, it is suggested to describe the Logical architecture of the system, to investigate the most promising solutions available in terms of exploitable technology.
Brusa E., Cala A., Ferretto D.
openaire +2 more sources
Before that a real architecture of system could be defined, by selecting some suitable components, available on the market, it is suggested to describe the Logical architecture of the system, to investigate the most promising solutions available in terms of exploitable technology.
Brusa E., Cala A., Ferretto D.
openaire +2 more sources
The logical analysis of the electroenterogram
The American Journal of Digestive Diseases, 1978Simple--and inexpensive--logic circuitry is described which will discriminate three types of spike activity in the canine electroenterogram. Used during high-speed replay of tape-recorded myoelectric activity, it provides a numerical analysis of the duration and spike content of the three types of activity, without the need for sophisticated (and ...
D L, Wingate, T, Barnett
openaire +2 more sources
Description logics for shape analysis
Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05), 2005Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such programs involves reasoning about unbounded sets of graphs. Three-valued shape analysis (Sagiv et. al.) is an approach based on explicit manipulation of 3-valued shape graphs, which
Georgieva, L., Maier, P.
openaire +2 more sources