Mixing with Mozart
Singularity Design Motivation
Transition Invariants
Proof rules for the temporal verification of concurrent programs rely on auxiliary assertions. We propose a (sound and relatively complete) proof rule whose auxiliary assertions are transition invariants. A transition invariant of a program is…
Secure Sessions for Web Services
Comega compiler preview
Comega is an experimental language which extends C# with new constructs for relational and semi-structured data access and asynchronous concurrency. Last published: October 28, 2004.
Squeeze the Screen
By Suzanne Ross, Writer, Microsoft Research If you’ve never seen some of the ingenious ways that researchers have invented to make viewing data on a small screen easy, you might say, “I’ll never do all…
First Line Worm Defense
We don’t like worms, in any incarnation. Not the crawly ones, not the human ones, not the computer ones. Especially not the computer ones. We can usually avoid the other kinds. That’s why Helen Wang…