Sciweavers

466 search results - page 19 / 94
» A Theory of Rate-Based Execution
Sort
View
TACAS
2010
Springer
221views Algorithms» more  TACAS 2010»
15 years 4 months ago
Trace-Based Symbolic Analysis for Atomicity Violations
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...
AISB
2008
Springer
14 years 11 months ago
Constructivism in AI: Prospects, Progress and Challenges
This position paper argues the case for the application of constructivist theories to Artificial Intelligence, with particular emphasis on Piaget's theory. The idea of buildin...
Frank Guerin
FLAIRS
2001
14 years 11 months ago
Probabilistic Plan Recognition for Hostile Agents
This paper presents a probabilistic and abductive theory of plan recognition that handles agents that are actively hostile to the inference of their plans. This focus violates a p...
Christopher W. Geib, Robert P. Goldman
FMCO
2003
Springer
144views Formal Methods» more  FMCO 2003»
15 years 2 months ago
Semantic Essence of AsmL
ract State Machine Language, AsmL, is a novel executable specification based on the theory of Abstract State Machines. AsmL is object-oriented, provides high-level mathematical d...
Yuri Gurevich, Benjamin Rossman, Wolfram Schulte
CORR
1999
Springer
139views Education» more  CORR 1999»
14 years 9 months ago
Combinatorics of branchings in higher dimensional automata
ABSTRACT. We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combi...
Philippe Gaucher