889 search results - page 152 / 178 » Problems in Rewriting III |
313
click to vote
PLDI
2009
ACM
16 years 6 months ago
2009
ACM
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
288
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
165
click to vote
ICCAD
2006
IEEE
16 years 2 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
203
click to vote
HASKELL
2009
ACM
16 years 6 days ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
149
click to vote
MICRO
2007
IEEE
15 years 12 months ago
2007
IEEE
Single-threaded programming is already considered a complicated task. The move to multi-threaded programming only increases the complexity and cost involved in software developmen...