Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Arusoaie, Andrei"'
Publikováno v:
EPTCS 389, 2023, pp. 144-151
This paper serves as a progress report on our research, specifically focusing on utilizing interval analysis, an existing static analysis method, for detecting vulnerabilities in smart contracts. We present a selection of motivating examples featurin
Externí odkaz:
http://arxiv.org/abs/2309.13805
Autor:
Arusoaie, Andrei, Lucanu, Dorel
Publikováno v:
EPTCS 369, 2022, pp. 1-16
Symbolic execution uses various algorithms (matching, (anti)unification), whose executions are parameters for proof object generation. This paper proposes a generic method for generating proof objects for such parameters. We present in detail how our
Externí odkaz:
http://arxiv.org/abs/2110.11700
Autor:
Buterchi, Andreea, Arusoaie, Andrei
Lots of existing web applications include a component for rating internet resources (e.g., social media platforms include mechanisms for rating videos or posts). Based on the obtained rating, the most popular internet resources can generate large amo
Externí odkaz:
http://arxiv.org/abs/2009.03253
Autor:
Arusoaie, Andrei
Derivatives are a special type of financial contracts used to hedge risks or to speculate on the market fluctuations. In order to avoid ambiguities and misinterpretations, several domain specific languages (DSLs) for specifying such derivatives have
Externí odkaz:
http://arxiv.org/abs/2005.13602
Autor:
Arusoaie, Andrei
We present the first formal semantics of Findel - a DSL for specifying financial derivatives. The semantics is encoded in Coq, and we use it to prove properties of several Findel contracts.
Comment: Presented in FROM 2019: http://from2019.projec
Comment: Presented in FROM 2019: http://from2019.projec
Externí odkaz:
http://arxiv.org/abs/1909.05464
Autor:
Arusoaie, Andrei, Pistol, Ionut
Artificial Intelligence problems, ranging form planning/scheduling up to game control, include an essential crucial step: describing a model which accurately defines the problem's required data, requirements, allowed transitions and established goals
Externí odkaz:
http://arxiv.org/abs/1903.09475
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Arusoaie, Andrei, Lucanu, Dorel
Matching Logic is a framework for specifying programming language semantics and reasoning about programs. Its formulas are called patterns and are built with variables, symbols, connectives and quantifiers. A pattern is a combination of structural co
Externí odkaz:
http://arxiv.org/abs/1811.02835
Autor:
Arusoaie, Andrei
Publikováno v:
In Journal of Logical and Algebraic Methods in Programming June 2021 121
Publikováno v:
In Procedia Computer Science 2021 192:736-745