4719 search results - page 769 / 944 » Newtonian program analysis |
175
click to vote
ENTCS
2007
15 years 4 months ago
2007
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
185
click to vote
AI
2005
Springer
15 years 4 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
175
click to vote
COMPSAC
2010
IEEE
15 years 2 months ago
2010
IEEE
The advent of emerging technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effect...
126
click to vote
SAS
2009
Springer
16 years 5 months ago
2009
Springer
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
155
click to vote
SAS
2009
Springer
16 years 5 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...