16844 search results - page 439 / 3369 » How to Design Programs |
192
click to vote
SP
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper describes a specification-based approach to detect exploitations of vulnerabdities in securitycritical programs. The approach utilizes security specifications that desc...
200
click to vote
CAI
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
193
click to vote
COCOA
2007
Springer
16 years 1 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
234
click to vote
CL
2000
Springer
15 years 12 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
209
click to vote
PPDP
1999
Springer
15 years 12 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...