Sciweavers

26 search results - page 3 / 6
» Metric Spaces and Termination Analyses
Sort
View
ENTCS
2007
85views more  ENTCS 2007»
13 years 6 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch
LCPC
2007
Springer
14 years 12 days ago
Using ZBDDs in Points-to Analysis
Binary Decision Diagrams (BDDs) have recently become widely accepted as a space-efficient method of representing relations in points-to analyses. When BDDs are used to represent re...
Ondrej Lhoták, Stephen Curial, José ...
CSFW
2011
IEEE
12 years 6 months ago
Formal Analysis of Protocols Based on TPM State Registers
—We present a Horn-clause-based framework for analysing security protocols that use platform configuration registers (PCRs), which are registers for maintaining state inside the...
Stéphanie Delaune, Steve Kremer, Mark Dermo...
IFIPTCS
2010
13 years 4 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
WSC
2004
13 years 7 months ago
Stream Option Manager
Stream Option Manager (SOM) is a set of mathematical tools developed at The MITRE Corporation's Center for Advanced Aviation System Development (CAASD). While still under dev...
William P. Niedringhaus, Michael J. White, Patrick...