Sciweavers

128 search results - page 17 / 26
» Ensuring Termination by Typability
Sort
View
ICC
2000
IEEE
151views Communications» more  ICC 2000»
13 years 12 months ago
Channel-Hopping Multiple Access
— The medium-access control (MAC) protocols for wireless networks proposed or implemented to date based on collision-avoidance handshakes between sender and receiver either requi...
Asimakis Tzamaloukas, J. J. Garcia-Luna-Aceves
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
14 years 2 months ago
MPC for tracking with optimal closed-loop performance
— This paper deals with the tracking problem for constrained linear systems using a model predictive control (MPC) law. As it is well known, MPC provides a control law suitable f...
Antonio Ferramosca, Daniel Limón, Ignacio A...
TABLEAUX
2009
Springer
14 years 2 months ago
Tableaux and Model Checking for Memory Logics
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
Carlos Areces, Diego Figueira, Daniel Gorín...
POPL
2009
ACM
14 years 8 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
POPL
2007
ACM
14 years 7 months ago
Proving that programs eventually do something good
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
Byron Cook, Alexey Gotsman, Andreas Podelski, Andr...