2271 search results - page 263 / 455 » Scalable Software Libraries |
165
click to vote
ASE
2005
15 years 4 months ago
2005
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
172
click to vote
TOSEM
2008
15 years 3 months ago
2008
Modern programs make extensive use of reusable software libraries. For example, a study of a number of large Java applications shows that between 17% and 30% of the classes in tho...
147
click to vote
PEPM
2011
ACM
14 years 6 months ago
2011
ACM
Writing deterministic programs is often difficult for problems whose optimal solutions depend on unpredictable properties of the programs’ inputs. Difficulty is also encounter...
151
click to vote
PPOPP
2012
ACM
13 years 11 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
255
Voted
PLDI
2009
ACM
16 years 4 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...