Sciweavers

12981 search results - page 113 / 2597
» Model Checking (Abstract)
Sort
View
BIRTHDAY
2008
Springer
15 years 1 days ago
History Dependent Automata for Service Compatibility
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
Vincenzo Ciancia, Gian Luigi Ferrari, Marco Pistor...
DAC
2006
ACM
15 years 11 months ago
Guiding simulation with increasingly refined abstract traces
Traces Kuntal Nanshi, Fabio Somenzi University of Colorado at Boulder ne abstraction refinement and simulation to provide a more efficient approach to checking invariant properti...
Kuntal Nanshi, Fabio Somenzi
WCNC
2008
IEEE
15 years 4 months ago
Integrated Source-Channel Decoding for Correlated Data-Gathering Sensor Networks
Abstract— This paper explores integrated source-channel decoding, driven by wireless sensor network applications where correlated information acquired by the network is gathered ...
Sheryl L. Howard, Paul G. Flikkema
CORR
2009
Springer
242views Education» more  CORR 2009»
14 years 7 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
POPL
2009
ACM
15 years 10 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi