Sciweavers

756 search results - page 32 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
ASPLOS
2006
ACM
14 years 1 months ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro
CONCUR
1991
Springer
13 years 11 months ago
A Method for the Development of Totally Correct Shared-State Parallel Programs
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
Ketil Stølen
KR
2010
Springer
14 years 22 days ago
I Don't Want to Think About it Now: Decision Theory with Costly Computation
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
Joseph Y. Halpern
CORR
2011
Springer
209views Education» more  CORR 2011»
12 years 11 months ago
I Don't Want to Think About it Now:Decision Theory With Costly Computation
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
Joseph Y. Halpern, Rafael Pass
DALT
2004
Springer
14 years 1 months ago
Theories of Intentions in the Framework of Situation Calculus
Abstract. We propose an extension of action theories to intention theories in the framework of situation calculus. Moreover the method for implementing action theories is adapted t...
Maria del Pilar Pozos Parra, Abhaya C. Nayak, Robe...