Sciweavers

1746 search results - page 251 / 350
» A linear implementation of PACMAN
Sort
View
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
15 years 10 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
CODES
2009
IEEE
15 years 10 months ago
A variation-tolerant scheduler for better than worst-case behavioral synthesis
– There has been a recent shift in design paradigms, with many turning towards yield-driven approaches to synthesize and design systems. A major cause of this shift is the contin...
Jason Cong, Albert Liu, Bin Liu
ICC
2009
IEEE
168views Communications» more  ICC 2009»
15 years 10 months ago
Optimal Sleep-Wake Policies for an Energy Harvesting Sensor Node
—We study a sensor node with an energy harvesting source. In any slot, the sensor node is in one of two modes: Wake or Sleep. The generated energy is stored in a buffer. The sens...
Vinay Joseph, Vinod Sharma, Utpal Mukherji
ATAL
2009
Springer
15 years 10 months ago
Team competition
In a team competition, two participating teams have an equal number of players, and each team orders its players linearly based on their strengths. A mechanism then specifies how...
Pingzhong Tang, Yoav Shoham, Fangzhen Lin
ERSHOV
2009
Springer
15 years 10 months ago
Symbolic Bounded Conformance Checking of Model Programs
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
Margus Veanes, Nikolaj Bjørner