Sciweavers

256 search results - page 40 / 52
» Recursive Lattice Reduction
Sort
View
POPL
2009
ACM
14 years 8 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 1 months ago
Low Complexity Adaptive Turbo Frequency-Domain Channel Estimation for Single-Carrier Multi-User Detection with Unknown Co-Channe
—Adaptive Turbo frequency-domain channel estimation is investigated for single-carrier (SC) multi-user detection in the presence of unknown co-channel interference (CCI). We prop...
Ye Wu, Xu Zhu, Asoke K. Nandi
TPHOL
2007
IEEE
14 years 1 months ago
Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
Tom Ridge
IFIP
2004
Springer
14 years 27 days ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
GI
2009
Springer
14 years 4 days ago
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
David Sabel, Manfred Schmidt-Schauß, Frederi...