303 search results - page 37 / 61 » Typing Safe Deallocation |
150
click to vote
SCP
2008
15 years 5 months ago
2008
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary type T for one writer and one reader by means of 4 unsafe variables of type T , th...
126
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
We developed an importer from both HOL 4 and HOL-light into Isabelle/HOL. The importer works by replaying proofs within Isabelle/HOL that have been recorded in HOL 4 or HOL-light a...
161
click to vote
FLOPS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
143
click to vote
JMLC
1997
Springer
15 years 10 months ago
1997
Springer
Strongly typed polymorphism is necessary for expressing safe reusable code. Two orthogonal forms of polymorphism exist: inclusion and parametric, the Oberon language only supports ...
157
click to vote
APN
2001
Springer
15 years 9 months ago
2001
Springer
We address the verification of programmable logic controllers (PLC). In our approach, a PLC program is translated into a special type of colored Petri net, a so-called register net...