Sciweavers

564 search results - page 22 / 113
» Proof General: A Generic Tool for Proof Development
Sort
View
POPL
2009
ACM
14 years 8 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
LPAR
2004
Springer
14 years 1 months ago
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
Jürgen Giesl, René Thiemann, Peter Sch...
CIE
2008
Springer
13 years 9 months ago
Extraction in Coq: An Overview
The extraction mechanism of Coq allows one to transform Coq proofs and functions into functional programs. We illustrate the behavior of this tool by reviewing several variants of ...
Pierre Letouzey
CCS
2009
ACM
14 years 2 months ago
Battle of Botcraft: fighting bots in online games with human observational proofs
The abuse of online games by automated programs, known as game bots, for gaining unfair advantages has plagued millions of participating players with escalating severity in recent...
Steven Gianvecchio, Zhenyu Wu, Mengjun Xie, Hainin...
NJC
2006
86views more  NJC 2006»
13 years 7 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...