Sciweavers

140 search results - page 16 / 28
» Verifying timing properties of concurrent algorithms
Sort
View
91
Voted
ISAAC
2001
Springer
87views Algorithms» more  ISAAC 2001»
15 years 6 months ago
On Removing the Pushdown Stack in Reachability Constructions
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
Oscar H. Ibarra, Zhe Dang
131
Voted
KDD
2010
ACM
217views Data Mining» more  KDD 2010»
15 years 7 days ago
Mining program workflow from interleaved traces
Successful software maintenance is becoming increasingly critical due to the increasing dependence of our society and economy on software systems. One key problem of software main...
Jian-Guang Lou, Qiang Fu, Shengqi Yang, Jiang Li, ...
IPPS
2010
IEEE
14 years 11 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Tarun Bansal, Neeraj Mittal
ASE
2002
160views more  ASE 2002»
15 years 1 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
FDL
2004
IEEE
15 years 5 months ago
A Formal Verification Approach for IP-based Designs
This paper proposes a formal verification methodology which is smoothly integrated with component-based system-level design, using a divide and conquer approach. The methodology a...
Daniel Karlsson, Petru Eles, Zebo Peng