861 search results - page 33 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
104
click to vote
SIGADA
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we describe an approach to automatically creating C++ bindings to Ada libraries utilizing capabilities of the Ada Semantic Interface Specification (ASIS). We discus...
107
Voted
PLDI
2010
ACM
15 years 12 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
118
click to vote
AOSD
2007
ACM
15 years 6 months ago
2007
ACM
Most current software systems contain undocumented high-level ideas implemented across multiple files and modules. When developers perform program maintenance tasks, they often wa...
116
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...
256
Voted
PLDI
2009
ACM
16 years 3 months ago
2009
ACM
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...