Sciweavers

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

56

TPHOL
1998
IEEE

favoriteEmaildiscussreport

104views Automated Reasoning» more TPHOL 1998»

Formalizing Dijkstra

15 years 1 months ago

Formalizing Dijkstra

Download www.cl.cam.ac.uk

John Harrison

Real-time Traffic

Automated Reasoning | TPHOL 1998 |

claim paper

Related Content

» DijkstraScholten Predicate Calculus Concepts and Misconceptions

» The Structure of the Essential Haskell Compiler or Coping with Compiler Complexity

» The Shortcut Problem Complexity and Approximation

» Generalized Committed Choice

» Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions

» Towards Instant Automatic Model Refinement Based on OCL

» Resources Concurrency and Local Reasoning Abstract

» A machinechecked soundness proof for an efficient verification condition generator

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	TPHOL
Authors	John Harrison

Comments (0)