Sciweavers

16883 search results - page 309 / 3377
» Generalized Non-Reducible Descriptors
Sort
View
196
Voted
ICFP
2003
ACM
16 years 6 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
MOBIHOC
2008
ACM
16 years 6 months ago
Exploring semantic interference in heterogeneous sensor networks
As the use of wireless sensor networks expands, there will be multiple, independent networks operating in the same physical space. These networks will run heterogeneous applicatio...
Laura Marie Feeney
MOBIHOC
2008
ACM
16 years 6 months ago
Finding popular categories for RFID tags
As RFID tags are increasingly attached to everyday items, it quickly becomes impractical to collect data from every tag in order to extract useful information. In this paper, we c...
Bo Sheng, Chiu Chiang Tan, Qun Li, Weizhen Mao
TLDI
2009
ACM
140views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Design patterns in separation logic
Object-oriented programs are notable for making use of both rder abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the com...
Neelakantan R. Krishnaswami, Jonathan Aldrich, Lar...
PEPM
2009
ACM
16 years 3 months ago
Designing aspects for side-effect localization
Computation performed in many typical aspects involve side effects. In a purely functional setting, adding such aspects using techniques such as monadification will generally lea...
Kung Chen, Jia-Yin Lin, Shu-Chun Weng, Siau-Cheng ...