The Community for Technology Leaders
Green Image
Issue No. 04 - April (1991 vol. 17)
ISSN: 0098-5589
pp: 383-384
<p>A simple proof is given, showing that for every operational description of a software system expressed as a discrete state transition function on a virtual machine, there is a continuous smooth function on the reals that agrees with the state transition function on all legal states and has exactly the same complexity. It is suggested that an implication of this result is that there is no reason, in principle, that the methods of classical analysis cannot be used in software engineering.</p>
software system; discrete state transition function; virtual machine; continuous smooth function; legal states; complexity; classical analysis; software engineering; computational complexity; software engineering
R.A. DeMillo, R.J. Lipton, "Defining Software by Continuous, Smooth Functions", IEEE Transactions on Software Engineering, vol. 17, no. , pp. 383-384, April 1991, doi:10.1109/32.90437
86 ms
(Ver 3.3 (11022016))