Sciweavers

248 search results - page 20 / 50
» A Model-Theoretic Approach to the Verification of Situated R...
Sort
View
ASE
2005
137views more  ASE 2005»
13 years 8 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
ICCBR
1997
Springer
14 years 23 days ago
Supporting Combined Human and Machine Planning: An Interface for Planning by Analogical Reasoning
Realistic and complex planning situations require a mixed-initiative planning framework in which human and automated planners interact to mutually construct a desired plan. Ideally...
Michael T. Cox, Manuela M. Veloso
IWPC
1996
IEEE
14 years 23 days ago
A Formal Architectural Design Patterns-Based Approach to Software Understanding
Mastering the complexity of programs and systems, particularly distributed systems, should lead to signi cant improvements in program and system understanding. In this paper we pr...
Paulo S. C. Alencar, Donald D. Cowan, Thomas Kunz,...
DAC
2000
ACM
14 years 9 months ago
Formal verification of iterative algorithms in microprocessors
Contemporary microprocessors implement many iterative algorithms. For example, the front-end of a microprocessor repeatedly fetches and decodes instructions while updating interna...
Mark Aagaard, Robert B. Jones, Roope Kaivola, Kath...
FLAIRS
2010
13 years 6 months ago
Using Ontologies in Case-Based Activity Recognition
Pervasive computing requires the ability to detect user activity in order to provide situation-specific services. Case-based reasoning can be used for activity recognition by usin...
Stephen Knox, Lorcan Coyle, Simon Dobson