691 search results - page 72 / 139 » Automatically Proving Linearizability |
APLAS
2000
ACM
14 years 2 months ago
2000
ACM
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
POPL
2000
ACM
14 years 2 months ago
2000
ACM
Certified code is a general mechanism for enforcing security properties. In this paradigm, untrusted mobile code carries annotations that allow a host to verify its trustworthine...
DATE
1998
IEEE
14 years 2 months ago
1998
IEEE
One of the main tasks within the high-level synthesis (HLS) process is the verification problem to prove automatically the correctness of the synthesis results. Currently, the res...
ICGI
1998
Springer
14 years 2 months ago
1998
Springer
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...
CADE
1994
Springer
14 years 2 months ago
1994
Springer
Pi is a system for the interactive construction and editing of formal derivations in the calculus of finitary partial inductive definitions. This calculus can be used as a logical ...