Sciweavers

367 search results - page 56 / 74
» Temporal Reasoning for Procedural Programs
Sort
View
LOGCOM
1998
126views more  LOGCOM 1998»
13 years 8 months ago
Engineering AgentSpeak(L): A Formal Computational Model
Perhaps the most successful agent architectures, and certainly the best known, are those based on the Belief-Desire-Intention (BDI) framework. Despite the wealth of research that ...
Mark d'Inverno, Michael Luck
COGSCI
2008
90views more  COGSCI 2008»
13 years 8 months ago
Using fMRI to Test Models of Complex Cognition
This article investigates the potential of fMRI to test assumptions about different components in models of complex cognitive tasks. If the components of a model can be associated...
John R. Anderson, Cameron S. Carter, Jon M. Fincha...
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
14 years 1 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
POPL
2004
ACM
14 years 9 months ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival
KBSE
2005
IEEE
14 years 2 months ago
Automated test generation for engineering applications
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
Songtao Xia, Ben Di Vito, César Muño...