Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

LLVM-based Static Analysis Tool Using Type and Effect Systems

Autor: M. A. Belyaev, V. A. Tsesko

Publikováno v: Моделирование и анализ информационных систем, Vol 18, Iss 4, Pp 45-55 (2011)

The intention of this paper is to describe a static analysis tool under development. The principal idea behind the design of this tool is to use type and effect systems for static analysis of real programs. The tool uses LLVM bitcode files as input,

Externí odkaz: https://doaj.org/article/93bcb840829642eeafc02d77208e0bc3

Analysis of initialization in the Kotlin language

Тема выпускной квалификационной работы: «Анализ инициализированност

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c5a3ca1123909361b5f4a77d0ac06474

Effect-driven QuickChecking of compilers

Autor: Midtgaard, Jan, Justesen, Mathias Nygaard, Kasting, Patrick Frederik Soelmark, Nielson, Flemming, Nielson, Hanne Riis

Publikováno v: Midtgaard, J, Justesen, M N, Kasting, P F S, Nielson, F & Nielson, H R 2017, Effect-driven QuickChecking of compilers . in Proceedings of the Acm on Programming Languages . vol. 1, Association for Computing Machinery, Proceedings of the ACM on Programming Languages, pp. 1-23 . https://doi.org/10.1145/3110259

How does one test a language implementation with QuickCheck (aka. property-based testing)? One approach is to generate programs following the grammar of the language. But in a statically-typed language such as OCaml too many of these candidate progra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1202::4ae5fafc2d89c144877de829368a5d4d
https://orbit.dtu.dk/en/publications/55c0eaad-c9c3-40cc-95af-f3ec2f0777c6

A Concurrent Logical Relation

Autor: Birkedal, Lars, Sieczkowski, Filip, Thamsborg, Jacob

Publikováno v: Birkedal, L, Sieczkowski, F & Thamsborg, J J 2012, ' A Concurrent Logical Relation ', Dagstuhl Seminar Proceedings, vol. 16 . https://doi.org/10.4230/LIPIcs.CSL.2012.107

We present a logical relation for showing the correctness of program transformations based on a new type-and-effect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocatio

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a23c747a2ec45e072d3790ed96ccb751
https://pure.itu.dk/ws/files/38907758/relconc_conf.pdf