The Stanford Temporal Prover, STeP, supports the computer-aided formal veriication of reactive (and, in particular, concurrent) systems based on temporal speciications. Reactive systems maintain an ongoing interaction with their environment; their speciications are typically expressed as constraints on their behavior over time. Unlike most systems for… (More)
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a natural bijection with the binary logical transformations of the corresponding functors on the category of Chu spaces on a two-letter alphabet.
We initiate a probabilistic study of connguration functions of moving points. In our probabilistic model, a particle is given an initial position and a velocity drawn independently at random from the same distribution D. We show that if n particles are drawn independently at random from the uniform distribution on the square, their convex hull undergoes… (More)
We describe the Stanford Temporal Prover (STeP), a system being developed to support the computer-aided formal veriication of concurrent and reactive systems based on temporal speciications. Unlike systems based on model-checking, STeP is not restricted to nite-state systems. It combines model checking and deductive methods to allow the veriication of a… (More)