1226 search results - page 21 / 246 » Proofs, Programs and Abstract Complexity |
124
click to vote
ENTCS
2008
15 years 2 months ago
2008
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
111
click to vote
ICTAC
2004
Springer
15 years 7 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
126
click to vote
ENTCS
2008
15 years 2 months ago
2008
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
101
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
136
click to vote
ICLP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...