716 search results - page 16 / 144 » Semilinear Program Feasibility |
180
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
APN
2006
Springer
14 years 11 months ago
2006
Springer
Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verif...
115
click to vote
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
IFL
2005
Springer
15 years 3 months ago
2005
Springer
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
AMC
2006
14 years 9 months ago
2006
Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In th...