Sciweavers

1204 search results - page 178 / 241
» Termination of Polynomial Programs
Sort
View
TLCA
2005
Springer
15 years 3 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
SENSYS
2004
ACM
15 years 3 months ago
MNP: multihop network reprogramming service for sensor networks
Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper, we propose a multihop reprogram...
Limin Wang
SIGSOFT
2003
ACM
15 years 3 months ago
Fluent model checking for event-based systems
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
Dimitra Giannakopoulou, Jeff Magee
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
15 years 3 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 2 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh