Sciweavers

1320 search results - page 229 / 264
» A View Based Analysis of Workflow Modeling Languages
Sort
View
KBSE
2010
IEEE
14 years 10 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
ICRA
1998
IEEE
148views Robotics» more  ICRA 1998»
15 years 4 months ago
Position Estimation Using Principal Components of Range Data
1 sensors is to construct a structural description from sensor data and to match this description to a previously acquired model [Crowley 85]. An alternative is to project individu...
James L. Crowley, Frank Wallner, Bernt Schiele
TLCA
2005
Springer
15 years 5 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
SIGSOFT
2007
ACM
16 years 16 days ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
DATE
2002
IEEE
119views Hardware» more  DATE 2002»
15 years 4 months ago
UML for Embedded Systems Specification and Design: Motivation and Overview
The specification, design and implementation of embedded systems demands new approaches which go beyond traditional hardware-based notations such as HDLs. The growing dominance of...
Grant Martin