Sciweavers

365 search results - page 15 / 73
» Types for Safe Locking
Sort
View
APLAS
2009
ACM
14 years 3 months ago
Fractional Ownerships for Safe Memory Deallocation
We propose a type system for a programming language with memory allocation/deallocation primitives, which prevents memory-related errors such as double-frees and memory leaks. The ...
Kohei Suenaga, Naoki Kobayashi
DATE
2007
IEEE
105views Hardware» more  DATE 2007»
14 years 3 months ago
Scratchpad memories vs locked caches in hard real-time systems: a quantitative comparison
We propose in this paper an algorithm for off-line selection of the contents of on-chip memories. The algorithm supports two types of on-chip memories, namely locked caches and sc...
Isabelle Puaut, Christophe Pais
ICTAC
2009
Springer
14 years 3 months ago
A Deadlock-Free Semantics for Shared Memory Concurrency
Abstract. We design a deadlock-free semantics for a concurrent, functional and imperative programming language where locks are implicitly and univocally associated with pointers. T...
Gérard Boudol
POPL
2001
ACM
14 years 9 months ago
Secure safe ambients
Secure Safe Ambients (SSA) are a typed variant of Safe Ambients [9], whose type system allows behavioral invariants of ambients to be expressed and verified. The most significant a...
Michele Bugliesi, Giuseppe Castagna
ASPDAC
2007
ACM
156views Hardware» more  ASPDAC 2007»
14 years 25 days ago
PLLSim - An Ultra Fast Bang-Bang Phase Locked Loop Simulation Tool
- This paper presents a simulation tool targeted specifically at bang-bang type phase locked loop systems. The aim of this simulator is to quickly and accurately predict important ...
Michael Chan, Adam Postula, Yong Ding