1204 search results - page 60 / 241 » Termination of Polynomial Programs |
90
Voted
ASPDAC
2010
ACM
14 years 10 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
183
Voted
POPL
2007
ACM
16 years 27 days ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
105
Voted
ICFP
2005
ACM
15 years 6 months ago
2005
ACM
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
114
Voted
CORR
2004
Springer
15 years 13 days ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
115
Voted
STOC
2003
ACM
16 years 27 days ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...