Sciweavers

4940 search results - page 334 / 988
» On the Complexity of Universal Programs
Sort
View
HPCA
2006
IEEE
16 years 7 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
AOSD
2010
ACM
16 years 1 months ago
Execution levels for aspect-oriented programming
In aspect-oriented programming languages, advice evaluation is usually considered as part of the base program evaluation. This is also the case for certain pointcuts, such as if p...
Éric Tanter
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
16 years 5 days ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
EPIA
1999
Springer
15 years 11 months ago
Improving Optical Music Recognition by Means of Abductive Constraint Logic Programming
In this paper we propose a hybrid system that bridges the gap between traditional image processing methods, used for low-level object recognition, and abductive constraint logic pr...
Miguel Ferrand, João Alexandre Leite, Am&ia...
ATAL
2006
Springer
15 years 10 months ago
Hierarchical planning in BDI agent programming languages: a formal approach
This paper provides a general mechanism and a solid theoretical basis for performing planning within Belief-Desire-Intention (BDI) agents. BDI agent systems have emerged as one of...
Sebastian Sardiña, Lavindra de Silva, Lin P...