288 search results - page 27 / 58 » Interactive Termination Proofs Using Termination Cores |
164
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
PERVASIVE
2005
Springer
15 years 3 months ago
2005
Springer
This article outlines two techniques that allow the mobile phone to be used as a pointing device for public terminals and large public displays. Our research has produced two comp...
105
Voted
AIML
2006
14 years 11 months ago
2006
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...
IAT
2007
IEEE
15 years 3 months ago
2007
IEEE
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
ESOP
2010
Springer
15 years 24 days ago
2010
Springer
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...