Sciweavers

301 search results - page 50 / 61
» On extensions of a theorem of Baxter
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
A Formal Framework for Specifying and Verifying Time Warp Optimizations
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...
Victoria Chernyakhovsky, Peter Frey, Radharamanan ...
TACS
1994
Springer
13 years 11 months ago
Full Abstraction for PCF
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
Samson Abramsky, Pasquale Malacaria, Radha Jagadee...
CONCUR
2009
Springer
13 years 11 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
ESORICS
2004
Springer
13 years 11 months ago
Information Flow Control Revisited: Noninfluence = Noninterference + Nonleakage
Abstract. We revisit the classical notion of noninterference for statebased systems, as presented by Rushby in 1992. We strengthen his results in several ways, in particular clarif...
David von Oheimb
RTA
1995
Springer
13 years 11 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi