Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
10
click to vote
TPHOL
2005
IEEE
favorite
Email
discuss
report
92
views
Automated Reasoning
»
more
TPHOL 2005
»
Proving Bounds for Real Linear Programs in Isabelle/HOL
13 years 10 months ago
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
more »
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)
Researcher Info
Automated Reasoning Study Group
Computer Vision