3221 search results - page 336 / 645 » Termination of Linear Programs |
191
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
199
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
228
click to vote
ACL2
2006
ACM
16 years 18 days ago
2006
ACM
A verifying compiler is one that emits both object code and a proof of correspondence between object and source code.1 We report the use of ACL2 in building a verifying compiler f...
156
click to vote
MIDDLEWARE
2004
Springer
15 years 12 months ago
2004
Springer
The very nature of implementing and evaluating fully distributed algorithms or protocols in application-layer overlay networks involves certain programming tasks that are at best m...
201
click to vote
JAR
2006
15 years 6 months ago
2006
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...