5090 search results - page 244 / 1018 » Constructing Strategies for Programming |
128
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We consider the verification of parameterized Boolean proabstractions of shared-memory concurrent programs with an unbounded number of threads. We propose that such prog...
121
click to vote
IASTEDSEA
2004
15 years 5 months ago
2004
Software engineering is hampered by the fact that software systems quickly become so complex that they are hard to understand, evolve and maintain. Closer integration of code and ...
118
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
178
click to vote
ENTCS
2006
15 years 4 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
104
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...