88 search results - page 9 / 18 » Proving the Correctness of the STG Machine |
136
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We present a tool for automatic generation of packed bitfields and tagged unions for systems-level C, along with automatic, machine checked refinement proofs in Isabelle/HOL. Our a...
162
click to vote
TCS
2010
15 years 4 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
167
click to vote
HIPC
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
177
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...
170
click to vote
JUCS
2008
15 years 6 months ago
2008
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...