Sciweavers

4211 search results - page 355 / 843
» Types as Abstract Interpretations
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Goals in agent systems: a unifying framework
In the literature on agent systems, the proactive behavior of agents is often modeled in terms of goals that the agents pursue. We review a number of commonly-used existing goal t...
M. Birna van Riemsdijk, Mehdi Dastani, Michael Win...
ECOOP
2008
Springer
15 years 8 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
ICFP
2010
ACM
15 years 7 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
IEEESP
2008
89views more  IEEESP 2008»
15 years 6 months ago
Virtual Machine Introspection: Observation or Interference?
hardware, eliminating an abstraction layer and often improving efficiency as a result. Examples of type 1 systems include VMware ESX,3 Xen (www. xensource.com/xen/xen/nfamily/virtu...
Kara L. Nance, Matt Bishop, Brian Hay
LISP
2006
105views more  LISP 2006»
15 years 6 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy