In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata...
Mathematical techniques can be used to produce precise, provably complete documentation for computer systems. However, such documents are highly detailed and oversights and other ...
: We give a semantics for a typed object calculus, an extension of System F with object subsumption and method override. We interpret the calculus in a per model, proving the sound...
We present a two dimensional temporal structure that has an ever changing present. Relative to each present, there is a past and future. The main representational advantage our tw...
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...