Sciweavers

1686 search results - page 132 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ICIDS
2010
Springer
15 years 27 days ago
Emohawk: Learning Virtual Characters by Doing
Emohawk is a narrative-based serious game designed to be a supportive tool for teaching basics of virtual agents development at universities and high-schools. Emohawk is built util...
Michal Bída, Cyril Brom
160
Voted
CONCUR
2011
Springer
14 years 3 months ago
Tractable Reasoning in a Fragment of Separation Logic
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
Byron Cook, Christoph Haase, Joël Ouaknine, M...
151
Voted
JAIR
2010
160views more  JAIR 2010»
15 years 2 months ago
Reasoning About the Transfer of Control
We present DCL-PC: a logic for reasoning about how the abilities of agents and coalitions of agents are altered by transferring control from one agent to another. The logical foun...
Wiebe van der Hoek, Dirk Walther, Michael Wooldrid...
246
Voted
POPL
2006
ACM
16 years 3 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
126
Voted
PADL
2010
Springer
16 years 13 days ago
Skeleton Composition Using Remote Data
Abstract. Skeletons simplify parallel programming by providing general patterns of parallel computations. When several skeletons are used inside the same program, skeleton composit...
Mischa Dieterle, Thomas Horstmeyer, Rita Loogen