Sciweavers

32 search results - page 5 / 7
» Dynamic inference of static types for ruby
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 3 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
POPL
2005
ACM
14 years 6 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...
FM
2009
Springer
190views Formal Methods» more  FM 2009»
14 years 10 days ago
Dynamic Classes: Modular Asynchronous Evolution of Distributed Concurrent Objects
Abstract. Many long-lived and distributed systems must remain available yet evolve over time, due to, e.g., bugfixes, feature extensions, or changing user requirements. To facilit...
Einar Broch Johnsen, Marcel Kyas, Ingrid Chieh Yu
FSEN
2007
Springer
13 years 12 months ago
Regulating Data Exchange in Service Oriented Applications
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining dat...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
DLS
2007
159views Languages» more  DLS 2007»
13 years 9 months ago
Relationally-parametric polymorphic contracts
The analogy between types and contracts raises the question of how many features of static type systems can be expressed as dynamic contracts. An important feature missing in prio...
Arjun Guha, Jacob Matthews, Robert Bruce Findler, ...