Sciweavers

662 search results - page 121 / 133
» Model Checking Procedures for Infinite State Systems
Sort
View
178
Voted
POPL
2008
ACM
15 years 9 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
ASE
2002
160views more  ASE 2002»
14 years 9 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
CONCUR
2003
Springer
15 years 2 months ago
Abstract Patterns of Compositional Reasoning
Patterns of Compositional Reasoning Nina Amla1 , E. Allen Emerson2 , Kedar Namjoshi3 , and Richard Trefler4 1 Cadence Design Systems 2 Univ. of Texas at Austin 3 Bell Labs, Lucent...
Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Ri...
JFR
2008
148views more  JFR 2008»
14 years 9 months ago
Terrain-based vehicle orientation estimation combining vision and inertial measurements
A novel method for estimating vehicle roll, pitch and yaw using machine vision and inertial sensors is presented that is based on matching images captured from an on-vehicle camer...
Vishisht Gupta, Sean Brennan
ENTCS
2007
105views more  ENTCS 2007»
14 years 9 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...