Sciweavers

2467 search results - page 338 / 494
» Finite State Machines
Sort
View
111
Voted
VSTTE
2005
Springer
15 years 6 months ago
Linking the Meaning of Programs to What the Compiler Can Verify
We formulate some research and development challenges that relate what a verifying compiler can verify to the definition and analysis of the application-content of programs, where...
Egon Börger
135
Voted
ICPR
2002
IEEE
15 years 6 months ago
3D Tracking of Human Locomotion: A Tracking as Recognition Approach
Estimating mode (walking/running/standing) and phases of human locomotion is important for video understanding. We present a new ”tracking as recognition” approach. A hierarch...
Tao Zhao, Ramakant Nevatia
108
Voted
ISRR
2001
Springer
119views Robotics» more  ISRR 2001»
15 years 5 months ago
Field Robots
Field Robots are machines that work in unstructured environments, including under water, in mines, in forests and on farms, and in the air. These applications involve both advance...
Chuck Thorpe, Hugh F. Durrant-Whyte
110
Voted
AC
2000
Springer
15 years 5 months ago
Operational Semantics and Program Equivalence
This tutorial paper discusses a particular style of operational semantics that enables one to give a ‘syntax-directed’ inductive definition of termination which is very useful...
Andrew M. Pitts
97
Voted
ASM
2000
ASM
15 years 5 months ago
An ASM Dynamic Semantics for Standard ML
Abstract. The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the ...
Steven C. Cater, James K. Huggins