Zobrazeno 1 - 10
of 92
pro vyhledávání: '"SSA Form"'
Publikováno v:
Serbian Journal of Electrical Engineering, Vol 10, Iss 1, Pp 91-101 (2013)
Since modern multicore processors can execute existing sequential programs only on a single core, there is a strong need for automatic parallelization of program code. Relying on existing algorithms, this paper describes one new software solution
Externí odkaz:
https://doaj.org/article/219c3538b46945d1aa863de33958d240
Publikováno v:
Automated Reasoning ISBN: 9783030510534
IJCAR (2)
IJCAR 2020-International Joint Conference on Automated Reasoning
IJCAR 2020-International Joint Conference on Automated Reasoning, Jun 2020, Paris, France. pp.324-340, ⟨10.1007/978-3-030-51054-1_19⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Reasoning
Automated Reasoning
Automated Reasoning-10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part II
IJCAR (2)
IJCAR 2020-International Joint Conference on Automated Reasoning
IJCAR 2020-International Joint Conference on Automated Reasoning, Jun 2020, Paris, France. pp.324-340, ⟨10.1007/978-3-030-51054-1_19⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Reasoning
Automated Reasoning
Automated Reasoning-10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part II
International audience; Liveness analysis is a standard compiler analysis, enabling several optimizations such as deadcode elimination. The SSA form is a popular compiler intermediate language allowing for simple and fast optimizations. Boissinot et
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0531c10147b0e12f2e726427f98c0463
https://doi.org/10.1007/978-3-030-51054-1_19
https://doi.org/10.1007/978-3-030-51054-1_19
Autor:
Marušák, Matej
Cieľom tejto práce je návrh a implementácia generického strategy solveru pre nástroj 2LS. 2LS je analyzátor na statickú verifikáciu programov napísaných v jazyku C. Verifikovaný program je za využita abstraktnej interpretácie analyzovan
Externí odkaz:
http://www.nusl.cz/ntk/nusl-403166
Publikováno v:
CC
PHP is a dynamically typed programming language commonly used for the server-side implementation of web applications. Approachability and ease of deployment have made PHP one of the most widely used scripting languages for the web, powering important
Autor:
Malík, Viktor
Cieľom tejto práce je návrh analýzy tvaru haldy vhodnej pre potreby analyzátora 2LS. 2LS je nástroj pre analýzu C programov založený na automatickom odvodzovaní invariantov s použitím SMT solvera. Navrhované riešenie obsahuje spôsob re
Externí odkaz:
http://www.nusl.cz/ntk/nusl-363894
Publikováno v:
Serbian Journal of Electrical Engineering, Vol 10, Iss 1, Pp 91-101 (2013)
Since modern multicore processors can execute existing sequential programs only on a single core, there is a strong need for automatic parallelization of program code. Relying on existing algorithms, this paper describes one new software solution too
Autor:
Quiroga Álvarez, José
Dynamic languages are widely used for different kinds of applications including rapid prototyping, Web development and programs that require a high level of runtime adaptiveness. However, the lack of compile-time type information involves fewer oppor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b108fe1caaa348b8b88c92ee3e7a38ec
http://hdl.handle.net/10651/38325
http://hdl.handle.net/10651/38325
Autor:
Davide Ancona, Andrea Corradi
Publikováno v:
FTfJP@ECOOP
Static Single Assignment (SSA) intermediate representation is widely used to optimize and compile code in imperative and object-oriented languages, but it can also be useful for static type analysis. We introduce FJSSA, a Java-like imperative calculu
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 29:1096-1109
An optimal linear-time algorithm for interprocedural register allocation in high level synthesis is presented. Historically, register allocation has been modeled as a graph coloring problem, which is nondeterministic polynomial time-complete in gener