4722 search results - page 493 / 945 » Encoding Program Executions |
193
click to vote
NFM
2011
15 years 6 hour ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
204
click to vote
ICLP
2011
Springer
14 years 8 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
156
click to vote
EVOW
2012
Springer
14 years 22 days ago
2012
Springer
We are using bandit-based adaptive operator selection while autotuning parallel computer programs. The autotuning, which uses evolutionary algorithm-based stochastic sampling, take...
177
click to vote
ICFP
2004
ACM
16 years 5 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
168
click to vote
ESOP
2010
Springer
16 years 2 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...