4940 search results - page 693 / 988 » On the Complexity of Universal Programs |
180
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
167
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
In efforts to overcome the complexity of the syntax and the lack of formal semantics of conventional hardware description languages, a number of functional hardware description la...
176
click to vote
VEE
2009
ACM
16 years 1 months ago
2009
ACM
Today’s web applications are pushing the limits of modern web browsers. The emergence of the browser as the platform of choice for rich client-side applications has shifted the ...
188
click to vote
KBSE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Automated debugging is becoming increasingly important as the size and complexity of software increases. This paper makes a case for using constraint-based data structure repair...
189
click to vote
CGO
2007
IEEE
16 years 29 days ago
2007
IEEE
This paper proposes the use of empirical modeling techniques for building microarchitecture sensitive models for compiler optimizations. The models we build relate program perform...