Harish Devarajan

Learn More
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 initiate a probabilistic study of configuration functions of moving points. In our probabilistic model, a particle is given an initiaf 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 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 operations on the category of Chu spaces on a two-letter alphabet. This is the online version of the(More)
<lb>The thesis considers formal veri cation of computerized systems. In formal veri cation, we<lb>verify that a system meets a desired behavior by checking that a mathematical model of the<lb>system satis es a formal speci cation that describes the behavior. The special method of<lb>formal veri cation that we consider is branching-time model checking. In(More)
We describe the Stanford Temporal Prover (STeP), a system being developed to support the computer-aided formal veri cation of concurrent and reactive systems based on temporal speci cations. Unlike systems based on model-checking, STeP is not restricted to nite-state systems. It combines model checking and deductive methods to allow the veri cation of a(More)
  • 1