4722 search results - page 573 / 945 » Representation-independent program analysis |
247
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing ...
173
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
181
click to vote
ICSE
2009
IEEE-ACM
16 years 1 months ago
2009
IEEE-ACM
When programmers develop or maintain software, they instinctively sense that there are fragments of code that other developers implemented somewhere, and these code fragments coul...
145
Voted
COMPSAC
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper, we define and illustrate a new form of attack in the context of software services: the software-based need-to-know (SN2K) attack. SN2K attacks can be carried out...
187
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...