Sciweavers

6167 search results - page 1022 / 1234
» Can Refinement be Automated
Sort
View
ICRA
1994
IEEE
127views Robotics» more  ICRA 1994»
14 years 2 months ago
"RISC" for Industrial Robotics: Recent Results and Open Problems
At the intersection of robotics, computational geometry, and manufacturingengineering, we have identifieda collection of research problems with near-term industrial applications. ...
John F. Canny, Kenneth Y. Goldberg
CONCUR
1993
Springer
14 years 2 months ago
Loop Parallelization in the Polytope Model
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
Christian Lengauer
KDD
1994
ACM
113views Data Mining» more  KDD 1994»
14 years 2 months ago
Exploration of Simulation Experiments by Discovery
: Weexemplify in this paper, howa discovery system is applied to the analysis of simulation experimentsin practical political planning, andshowwhatkind of newknowledgecan be discov...
Willi Klösgen
POPL
1993
ACM
14 years 2 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
SIGSOFT
1994
ACM
14 years 2 months ago
Data Flow Analysis for Verifying Properties of Concurrent Programs
In this paper we present an approach, based on data ow analysis, that can provide cost-e ective analysis of concurrent programs with respect to explicitly stated correctness prope...
Matthew B. Dwyer, Lori A. Clarke
« Prev « First page 1022 / 1234 Last » Next »