( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Verified Generational Garbage Collector for CakeML.

, , и . ITP, том 10499 из Lecture Notes in Computer Science, стр. 444-461. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Magnus O Brunner

O Otsuka

O Manuwald

O Nommensen

O Riha

 

Другие публикации лиц с тем же именем

A flat reachability-based measure for CakeML's cost semantics., и . IFL, стр. 1-9. ACM, (2021)Functional Programs: Conversions between Deep and Shallow Embeddings.. ITP, том 7406 из Lecture Notes in Computer Science, стр. 412-417. Springer, (2012)A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture., и . ITP, том 6172 из Lecture Notes in Computer Science, стр. 243-258. Springer, (2010)Proof Pearl: A Verified Bignum Implementation in x86-64 Machine Code., и . CPP, том 8307 из Lecture Notes in Computer Science, стр. 66-81. Springer, (2013)A minimalistic verified bootstrapped compiler (proof pearl).. CPP, стр. 32-45. ACM, (2021)A proof-producing translator for verilog development in HOL., и . FormaliSE@ICSE, стр. 99-108. IEEE / ACM, (2019)Functional Big-Step Semantics., , , и . ESOP, том 9632 из Lecture Notes in Computer Science, стр. 589-615. Springer, (2016)Transforming Programs into Recursive Functions., и . SBMF, том 240 из Electronic Notes in Theoretical Computer Science, стр. 185-200. Elsevier, (2008)Hoare Logic for Realistically Modelled Machine Code., и . TACAS, том 4424 из Lecture Notes in Computer Science, стр. 568-582. Springer, (2007)Fast, Verified Computation for Candle., и . ITP, том 268 из LIPIcs, стр. 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)