Dear all,
I have some confusion on David and Philip's PLDI paper, "The nesC Language:
A Holistic Approach to Networked Embedded Systems":
(1) What is the exact meaning of "whole program analysis"? Does it mean
the compiler can take all the interleavings into account?
(2) Could some data race situations escape the race-free invariant (any
update to shared state is either not a data race condition (SC only), or
occurs within an atomic section)? If so, could you give me an example?
Thank you very much for your attention.
Best regards,
Yours,
Zhifeng Lai
_______________________________________________
Tinyos-help mailing list
Tinyos-help@Millennium.Berkeley.EDU
https://mail.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help
