Sciweavers

24554 search results - page 169 / 4911
» Dependable distributed systems
Sort
View
RTA
2009
Springer
15 years 11 months ago
Dependency Pairs and Polynomial Path Orders
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
Martin Avanzini, Georg Moser
CSFW
2007
IEEE
15 years 11 months ago
Dynamic Dependency Monitoring to Secure Information Flow
Although static systems for information flow security are well-studied, few works address run-time information flow monitoring. Run-time information flow control offers distinc...
Paritosh Shroff, Scott F. Smith, Mark Thober
LISA
2008
15 years 7 months ago
Dynamic Dependencies and Performance Improvement
The art of performance tuning is, alas, still an art; there are few tools to help predict the effects of changes that are motivated by performance needs. In this work, we present ...
Marc Chiarini, Alva L. Couch
136
Voted
CSL
2010
Springer
15 years 5 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann
137
Voted
IPPS
1999
IEEE
15 years 9 months ago
A Parallel Phoneme Recognition Algorithm Based on Continuous Hidden Markov Model
This paper presents a parallel phoneme recognition algorithm based on the continuous Hidden Markov Model (HMM). The parallel phoneme recognition algorithm distributes 3-state HMMs...
Sang-Hwa Chung, Min-Uk Park, Hyung-Soon Kim