Sciweavers

107 search results - page 9 / 22
» Specifying the Correctness of Binding-Time Analysis
Sort
View
HF
2002
95views more  HF 2002»
13 years 7 months ago
Formal Verification of Human-Automation Interaction
This paper discusses a formal and rigorous approach to the analysis of operator interaction with machines. It addresses the acute problem of detecting design errors in human-machi...
Asaf Degani, Michael Heymann
GLOBECOM
2010
IEEE
13 years 5 months ago
The Information Propagation Speed Upper Bound in Cognitive Radio Networks
Abstract--The information propagation speed (IPS) of a network specifies how fast the information can be transmitted in a network. In this paper, we derive an IPS upper bound in co...
Chuan Han, Yaling Yang
ICPR
2010
IEEE
13 years 5 months ago
Rectifying Non-Euclidean Similarity Data Using Ricci Flow Embedding
Similarity based pattern recognition is concerned with the analysis of patterns that are specified in terms of object dissimilarity or proximity rather than ordinal values. For man...
Weiping Xu, Edwin R. Hancock, Richard C. Wilson
SIGSOFT
2003
ACM
14 years 8 months ago
Deadline analysis of interrupt-driven software
Real-time, reactive, and embedded systems are increasingly used throughout society (e.g., flight control, railway signaling, vehicle management, medical devices, and many others)....
Dennis Brylow, Jens Palsberg
POPL
2005
ACM
14 years 7 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...