Sciweavers

2814 search results - page 348 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
TACAS
2009
Springer
101views Algorithms» more  TACAS 2009»
14 years 5 months ago
Parametric Trace Slicing and Monitoring
Analysis of execution traces plays a fundamental role in many program analysis approaches. Execution traces are frequently parametric, i.e., they contain events with parameter bind...
Feng Chen, Grigore Rosu
SDM
2009
SIAM
113views Data Mining» more  SDM 2009»
14 years 8 months ago
Graph Generation with Prescribed Feature Constraints.
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
Xiaowei Ying, Xintao Wu
APN
2003
Springer
14 years 4 months ago
Model Checking Safety Properties in Modular High-Level Nets
Model checking by exhaustive state space enumeration is one of the most developed analysis methods for distributed event systems. Its main problem—the size of the state spaces—...
Marko Mäkelä
SIGMETRICS
2008
ACM
130views Hardware» more  SIGMETRICS 2008»
13 years 10 months ago
Using probabilistic model checking in systems biology
Probabilistic model checking is a formal verification framework for systems which exhibit stochastic behaviour. It has been successfully applied to a wide range of domains, includ...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
CAV
2009
Springer
176views Hardware» more  CAV 2009»
14 years 11 months ago
PAT: Towards Flexible Verification under Fairness
Recent development on distributed systems has shown that a variety of fairness constraints (some of which are only recently defined) play vital roles in designing self-stabilizing ...
Jun Sun 0001, Yang Liu 0003, Jin Song Dong, Jun Pa...