Sciweavers

446 search results - page 2 / 90
» Abstract Interpretation Using Typed Decision Graphs
Sort
View
POPL
1997
ACM
13 years 9 months ago
Parameterized Types for Java
Java offers the real possibility that most programs can be written in a type-safe language. However, for Java to be broadly useful, it needs additional expressive power. This pape...
Andrew C. Myers, Joseph A. Bank, Barbara Liskov
TOPLAS
2008
138views more  TOPLAS 2008»
13 years 5 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
JOLLI
2006
86views more  JOLLI 2006»
13 years 5 months ago
Types as Graphs: Continuations in Type Logical Grammar
Applying the programming-language concept of continuations, we propose a new multimodal analysis of quantification in Type Logical Grammar. Our approach naturally gives rise to a n...
Chris Barker, Chung-chieh Shan
CIMCA
2006
IEEE
13 years 11 months ago
Probabilistic, Multi-staged Interpretation of Spoken Utterances
Abstract. We describe Scusi?, a multi-stage, spoken language interpretation mechanism designed to be part of a robot-mounted dialogue system. Scusi?’s interpretation process maps...
Ingrid Zukerman, Michael Niemann, Sarah George
ENTCS
2008
129views more  ENTCS 2008»
13 years 5 months ago
The York Abstract Machine
Abstract Machine Greg Manning1 Detlef Plump2 Department of Computer Science The University of York, UK duce the York Abstract Machine (YAM) for implementing the graph programming ...
Greg Manning, Detlef Plump