93 search results - page 8 / 19 » Making numerical program analysis fast |
CGO
2011
IEEE
13 years 1 months ago
2011
IEEE
—Memory corruption, reading uninitialized memory, using freed memory, and other memory-related errors are among the most difficult programming bugs to identify and fix due to t...
ICSE
2004
IEEE-ACM
14 years 10 months ago
2004
IEEE-ACM
Financial companies, engineering firms and even scientists create increasingly larger spreadsheets and spreadsheet programs. The creators of large spreadsheets make errors and mus...
DAC
2002
ACM
14 years 10 months ago
2002
ACM
In the last decade, instruction-set simulators have become an essential development tool for the design of new programmable architectures. Consequently, the simulator performance ...
EUROSYS
2010
ACM
14 years 6 months ago
2010
ACM
Bugs in concurrent programs are extremely difficult to find and fix during testing. In this paper, we propose Kivati, which can efficiently detect and prevent atomicity violat...
SAS
2001
Springer
14 years 2 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...