Sciweavers

556 search results - page 54 / 112
» Checking Interval Properties of Computations
Sort
View
ICALP
2003
Springer
15 years 9 months ago
Quantitative Analysis of Probabilistic Lossy Channel Systems
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
Alexander Moshe Rabinovich
NSDI
2007
15 years 6 months ago
WiDS Checker: Combating Bugs in Distributed Systems
Despite many efforts, the predominant practice of debugging a distributed system is still printf-based log mining, which is both tedious and error-prone. In this paper, we present...
Xuezheng Liu, Wei Lin, Aimin Pan, Zheng Zhang
182
Voted
CSFW
2000
IEEE
15 years 8 months ago
Information Flow Analysis in a Discrete-Time Process Algebra
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably Æ , are reformulated here in a realtime setting. This is...
Riccardo Focardi, Roberto Gorrieri, Fabio Martinel...
DAM
2006
88views more  DAM 2006»
15 years 4 months ago
NP-completeness results for edge modification problems
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Pablo Burzyn, Flavia Bonomo, Guillermo Durá...
LICS
2007
IEEE
15 years 10 months ago
A computable approach to measure and integration theory
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
Abbas Edalat