Sciweavers

328 search results - page 39 / 66
» Simple Termination Revisited
Sort
View
POPL
2012
ACM
12 years 3 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
TLCA
2005
Springer
14 years 1 months ago
L3: A Linear Language with Locations
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
Greg Morrisett, Amal J. Ahmed, Matthew Fluet
CCCG
2006
13 years 9 months ago
Polygons Flip Finitely: Flaws and a Fix
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, ...
LCN
2008
IEEE
14 years 2 months ago
Modeling of two-flow interactions under SINR model in Multi-hop Wireless Networks
—Carrier Sense Multiple Access (CSMA) protocols in Multi-hop Wireless Networks (MHWN) are known to suffer from different forms of the hidden and exposed terminal problems, leadin...
Saquib Razak, Nael B. Abu-Ghazaleh, Vinay Kolar
WOWMOM
2005
ACM
184views Multimedia» more  WOWMOM 2005»
14 years 1 months ago
ALCA: A New Scheme for Power Control on 802.11 Ad Hoc Networks
— This paper presents the ALCA (Asymmetric Link Collision Avoidance) protocol. ALCA was designed to deal with a known deficiency of the Basic Scheme [1] for power control in 802...
Alexandre Andrade Pires, José Ferreira de R...