On Tuesday 11 May 2004 10:06 pm, Greg Ewing wrote: > Just a thought, but is statically verifying the bytecode even > possible in principle? Seems to me it could be equivalent to > the halting problem. I don't see any reason to think them equivalent; we don't need to determine that the code will execute to completion, only that the bytecodes can be decoded without error. Not trivial by any means, but I think it's a more constrained problem. -Fred -- Fred L. Drake, Jr. <fdrake at acm.org> PythonLabs at Zope Corporation
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4