An *(OS), by Greg Law, based on the idea of building an entire _(Operating System) from software components (based on _(CORBA) and its ORB) that can be replaced and recycled; it also introduces an x86-specific _(security) model based on <b>segmentation</b> and <b>code scanning</b> (an example of a _(no-kernel) system).

<ul class="implementations">
<li>_("GO! homepage"|http://goos.sourceforge.net/)
</ul>

<hr>

<span class="comment">
It seems as if code scanning can be reduced to the "Halt problem" and is therefore not determinable. In this context, that actually means you can always write a program which will make the code scanner run forever or if it stops at some point, execute a "illegal" instruction.
<br>-- _(Dante)</span>

<span class="comment">
Your is a strong statement without a proof. It seems you are artificially complicating the issue: <i>code scanning</i> here simply means to search for occurrences of protect-mode instruction opcodes (regarding, in particular, segment registers). Other _(security) mechanisms are implemented in the Object Request Broker (ORB). Also it is sensible to combine </i>code scanning</i> with other techniques: for example, Typed Assembly Language (_(TAL)), _(Language-Based Security), _(Information-Flow Security), _(Capability) and so on.
<br>-- _(MaD70)</span>
