Sciweavers

1322 search results - page 91 / 265
» Unsound Theorem Proving
Sort
View
ENTCS
2007
88views more  ENTCS 2007»
13 years 7 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 7 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 7 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
JAR
2007
85views more  JAR 2007»
13 years 7 months ago
User Interaction with the Matita Proof Assistant
Matita is a new, document-centric, tactic-based interactive theorem prover. This paper focuses on some of the distinctive features of the user interaction with Matita, characterize...
Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tas...
COMBINATORICS
2002
70views more  COMBINATORICS 2002»
13 years 7 months ago
Set-Systems with Restricted Multiple Intersections
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
Vince Grolmusz