Defining Software by Continuous, Smooth Functions
暂无分享,去创建一个
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. >
[1] David Lorge Parnas,et al. Software aspects of strategic defense systems , 1985, CACM.
[2] Richard J. Lipton,et al. Social processes and proofs of theorems and programs , 1977, POPL.
[3] M. Stone. The Generalized Weierstrass Approximation Theorem , 1948 .