329 search results - page 64 / 66 » Automatic Proofs for Scalecharts |
200
Voted
POPL
2006
ACM
16 years 26 days ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
110
Voted
CADE
2007
Springer
16 years 26 days ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
107
Voted
ICSE
2004
IEEE-ACM
16 years 19 days ago
2004
IEEE-ACM
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...
122
Voted
ICCAD
2007
IEEE
15 years 9 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
121
click to vote
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...