Sciweavers

9 search results - page 2 / 2
» Formalizing Dijkstra
Sort
View
PVLDB
2010
146views more  PVLDB 2010»
13 years 5 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
Michael Rice, Vassilis J. Tsotras
APSEC
2007
IEEE
14 years 1 months ago
Towards Instant Automatic Model Refinement Based on OCL
Model refinement is a complex task. It is difficult for developers to refine models all by themselves. A good modeling tool should not only do routine refinement work for develope...
Hui Song, Yanchun Sun, Li Zhou, Gang Huang
ESOP
2004
Springer
14 years 26 days ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
SAC
2010
ACM
13 years 5 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...