4116 search results - page 83 / 824 » Type Analysis for CHIP |
109
click to vote
CAV
2008
Springer
15 years 4 months ago
2008
Springer
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
165
Voted
TOPLAS
2010
15 years 1 months ago
2010
program constraints are defined over a program’s abstract syntax tree. The JAVACOP compiler automatically enforces these constraints on programs during compilation. The JAVACOP ...
216
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...
111
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
138
Voted
ESOP
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We propose a new type discipline for the -calculus in which secure information flow is guaranteed by static type checking. Secrecy levels are assigned to channels and are...