Sciweavers

197
Voted
ECOOP
2005
Springer
15 years 12 months ago
Towards Type Inference for JavaScript
Object-oriented scripting languages like JavaScript and Python are popular partly because of their dynamic features. These include the runtime modification of objects and classes ...
Christopher Anderson, Paola Giannini, Sophia Dross...
155
Voted
CASSIS
2005
Springer
15 years 12 months ago
Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks
Abstract. We study secure information flow in a stack based Typed Assembly Language (TAL). We define a TAL with an execution stack and establish the soundness of its type system ...
Eduardo Bonelli, Adriana B. Compagnoni, Ricardo Me...
161
Voted
LICS
2005
IEEE
15 years 12 months ago
Certifying Compilation for a Language with Stack Allocation
This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack allocation. The type system uses linear logic and a ...
Limin Jia, Frances Spalding, David Walker, Neal Gl...
173
Voted
ICNP
2005
IEEE
15 years 12 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
158
Voted
PLDI
2006
ACM
16 years 10 days ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
216
Voted
HASKELL
2006
ACM
16 years 10 days ago
Statically typed linear algebra in Haskell
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
Frederik Eaton
APLAS
2006
ACM
16 years 10 days ago
A Bytecode Logic for JML and Types
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
Lennart Beringer, Martin Hofmann
155
Voted
LICS
2006
IEEE
16 years 11 days ago
On Typability for Rank-2 Intersection Types with Polymorphic Recursion
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
Tachio Terauchi, Alex Aiken
178
Voted
TLCA
2007
Springer
16 years 14 days ago
A Substructural Type System for Delimited Continuations
We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression or evaluation context as a structure in a linear log...
Oleg Kiselyov, Chung-chieh Shan
170
Voted
GPCE
2007
Springer
16 years 16 days ago
A type-centric framework for specifying heterogeneous, large-scale, component-oriented, architectures
Maintaining integrity, consistency, and enforcing conformance in architectures of large-scale systems requires specification and enforcement of many different forms of structural...
Georg Jung, John Hatcliff