Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

88

Voted

TPHOL
2005
IEEE

92views Automated Reasoning» more TPHOL 2005»

Proving Bounds for Real Linear Programs in Isabelle/HOL

15 years 8 months ago

Proving Bounds for Real Linear Programs in Isabelle/HOL

Download types2004.lri.fr

Steven Obua

Real-time Traffic

Artificial Intelligence | TPHOL 2005 |

claim paper

Related Content

» General Bindings and AlphaEquivalence in Nominal Isabelle

» Proof Synthesis and Reflection for Linear Arithmetic

» Asserting Bytecode Safety

» Types bytes and separation logic

» Proving Bounds on RealValued Functions with Computations

» Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

» Improved Lower Bounds for TreeLike Resolution over Linear Inequalities

» Linear Lower Bounds on RealWorld Implementations of Concurrent Objects

» A Linear Round Lower Bound for LovaszSchrijver SDP Relaxations of Vertex Cover

Post Info
More Details (n/a)

Added	25 Jun 2010
Updated	25 Jun 2010
Type	Conference
Year	2005
Where	TPHOL
Authors	Steven Obua

Comments (0)