Sciweavers

1096 search results - page 14 / 220
» Type inference for atomicity
Sort
View
CONCUR
2006
Springer
13 years 11 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
APAL
2008
104views more  APAL 2008»
13 years 7 months ago
Atomic models higher up
There exists a countable structure M of Scott rank CK 1 where M 1 = CK 1 and where the LCK 1 ,-theory of M is not -categorical. The Scott rank of a model is the least ordinal whe...
Jessica Millar, Gerald E. Sacks
WCRE
1998
IEEE
13 years 12 months ago
Type Inference for COBOL Systems
Types are a good starting point for various software reengineering tasks. Unfortunately, programs requiring reengineering most desperately are written in languages without an adeq...
Arie van Deursen, Leon Moonen
APLAS
2007
ACM
13 years 11 months ago
Type-Based Verification of Correspondence Assertions for Communication Protocols
Gordon and Jeffrey developed a type system for checking correspondence assertions. The correspondence assertions, proposed by Woo and Lam, state that when a certain event (called a...
Daisuke Kikuchi, Naoki Kobayashi
ECOOP
2011
Springer
12 years 7 months ago
Tunable Static Inference for Generic Universe Types
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...
Werner Dietl, Michael D. Ernst, Peter Müller