Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
A novel machine language genetic programming system that uses one-dimensional core memories is proposed and simulated. The core is compared to a biochemical reaction space, and in ...
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...