Sciweavers

1410 search results - page 88 / 282
» Proving theorems by reuse
Sort
View
JAPLL
2006
104views more  JAPLL 2006»
13 years 10 months ago
A proof-centric approach to mathematical assistants
We present an approach to mathematical assistants which uses readable, executable proof scripts as the central language for interaction. We examine an implementation that combines...
Lucas Dixon, Jacques D. Fleuriot
DAM
2007
82views more  DAM 2007»
13 years 10 months ago
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
Baogang Xu, Haihui Zhang
ENTCS
2007
88views more  ENTCS 2007»
13 years 10 months ago
Mothers of Pipelines
We present a method for pipeline verification using SMT solvers. It is based on a non-deterministic “mother pipeline” machine (MOP) that abstracts the instruction set archite...
Sava Krstic, Robert B. Jones, John O'Leary
SIAMCO
2008
80views more  SIAMCO 2008»
13 years 10 months ago
Optimal Transportation Problem by Stochastic Optimal Control
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theore...
Toshio Mikami, Michèle Thieullen
APAL
2005
89views more  APAL 2005»
13 years 10 months ago
Softness of hypercoherences and MALL full completeness
We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's -autonomous category of hype...
Richard Blute, Masahiro Hamano, Philip J. Scott