Sciweavers

2137 search results - page 270 / 428
» Proving Abstract Non-interference
Sort
View
TOPLAS
1998
133views more  TOPLAS 1998»
15 years 6 months ago
A Systematic Study of Functional Language Implementations
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
Rémi Douence, Pascal Fradet
ICFEM
2010
Springer
15 years 5 months ago
Verifying Heap-Manipulating Programs with Unknown Procedure Calls
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...
Shengchao Qin, Chenguang Luo, Guanhua He, Florin C...
INFOCOM
2010
IEEE
15 years 4 months ago
Cross-layer Optimization for Wireless Networks with Deterministic Channel Models
Abstract—Existing work on cross-layer optimization for wireless networks adopts simple physical-layer models, i.e., treating interference as noise. In this paper, we adopt a dete...
Ziyu Shao, Minghua Chen, Salman Avestimehr, Shuo-Y...
STTT
2010
122views more  STTT 2010»
15 years 4 months ago
Rodin: an open toolset for modelling and reasoning in Event-B
Event-B is a formal method for system-level modelling and analysis. Key features of Event-B are the use of set theory as a modelling notation, the use of ent to represent systems a...
Jean-Raymond Abrial, Michael J. Butler, Stefan Hal...
PPOPP
2009
ACM
16 years 7 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha