Sciweavers

6960 search results - page 1134 / 1392
» Continuity Analysis of Programs
Sort
View
SCP
2010
108views more  SCP 2010»
15 years 2 months ago
Combining dynamic and static slicing for analysing assembler
One of the most challenging tasks a programmer can face is attempting to analyse and understand a legacy assembler system. Many features of assembler make analysis difficult, and ...
Martin P. Ward, Hussein Zedan
SPIN
2010
Springer
15 years 2 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
TMC
2010
139views more  TMC 2010»
15 years 2 months ago
Optimize Storage Placement in Sensor Networks
—Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introdu...
Bo Sheng, Qun Li, Weizhen Mao
TON
2010
119views more  TON 2010»
15 years 2 months ago
Thwarting zero-day polymorphic worms with network-level length-based signature generation
—It is crucial to detect zero-day polymorphic worms and to generate signatures at network gateways or honeynets so that we can prevent worms from propagating at their early phase...
Lanjia Wang, Zhichun Li, Yan Chen, Zhi Fu, Xing Li
TPLP
2010
102views more  TPLP 2010»
15 years 2 months ago
As time goes by: Constraint Handling Rules
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers,...
Jon Sneyers, Peter Van Weert, Tom Schrijvers, Lesl...
« Prev « First page 1134 / 1392 Last » Next »