1226 search results - page 162 / 246 » Proofs, Programs and Abstract Complexity |
132
click to vote
CADE
2007
Springer
16 years 3 months 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...
115
click to vote
MIDDLEWARE
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Existing middleware is based on control-flow centric interaction models such as remote method invocations, poorly matching the structure of applications that process con...
TCS
2002
15 years 2 months ago
2002
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
142
click to vote
EXPERT
2006
15 years 3 months ago
2006
abstraction rules that hide the complexity of systems of components. We've begun this process in the domain of sensor/actuator network applications, observing that in manyappl...
218
click to vote
ASPLOS
2009
ACM
16 years 3 months ago
2009
ACM
Abstract: Modeling the interactions of biological molecules, or docking, is critical to both understanding basic life processes and to designing new drugs. Here we describe the GPU...