Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Emina Torlak"'
Publikováno v:
Proceedings of the ACM on Programming Languages. 6:1-28
Reusable symbolic evaluators are a key building block of solver-aided verification and synthesis tools. A reusable evaluator reduces the semantics of all paths in a program to logical constraints, and a client tool uses these constraints to formulate
Publikováno v:
Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis.
Autor:
Emina Torlakovic, Nicola Normanno
Publikováno v:
Journal of Molecular Pathology, Vol 5, Iss 3, Pp 258-261 (2024)
We have read, with great interest, a recently published article by Bisson KR et al [...]
Externí odkaz:
https://doaj.org/article/a8eda61dbab84cdb8ad0e51c7bd006d2
Publikováno v:
ACM SIGOPS Operating Systems Review. 54:31-39
This paper presents an analysis of noninterference specifications used in a range of formally verified systems. The main findings are that these systems use distinct specifications and that they often employ small variations, both complicating their
Publikováno v:
ASE
This paper presents Solar, a system for automatic synthesis of adversarial contracts that exploit vulnerabilities in a victim smart contract. To make the synthesis tractable, we introduce a query language as well as summary-based symbolic evaluation,
Autor:
Irena Seili-Bekafigo, Emina Torlakovic, Tajana Grenko Malnar, Marija Stanić Damić, Željko Prka, Koviljka Matušan Ilijaš, Ita Hadžisejdić
Publikováno v:
Medicina, Vol 60, Iss 8, p 1351 (2024)
The patient we present here had many clinical, morphological, and laboratory findings characteristic of acute leukemia. During the course of the disease, the diagnosis changed from acute leukemia to chronic small B-cell lymphoproliferative disease, a
Externí odkaz:
https://doaj.org/article/2a8f87f452dd41b1aa249f2a1125909f
Publikováno v:
Computer Aided Verification ISBN: 9783030532901
CAV (2)
CAV (2)
Modern operating systems allow user-space applications to submit code for kernel execution through the use of in-kernel domain specific languages (DSLs). Applications use these DSLs to customize system policies and add new functionality. For performa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42feba66e508294d8963604549984641
https://doi.org/10.1007/978-3-030-53291-8_29
https://doi.org/10.1007/978-3-030-53291-8_29
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030393212
VMCAI
VMCAI
Effective symbolic evaluation is key to building scalable verification and synthesis tools based on SMT solving. These tools use symbolic evaluators to reduce the semantics of all paths through a finite program to logical constraints, discharged with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a31cc4b6fca3b63fb852d7c2b0f71e0f
https://doi.org/10.1007/978-3-030-39322-9_3
https://doi.org/10.1007/978-3-030-39322-9_3
Autor:
James Bornholt, Emina Torlak
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-26
Solver-aided tools rely on symbolic evaluation to reduce programming tasks, such as verification and synthesis, to satisfiability queries. Many reusable symbolic evaluation engines are now available as part of solver-aided languages and frameworks, w
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-29
We present lambda_sym, a typed λ-calculus for lenient symbolic execution , where some language constructs do not recognize symbolic values. Its type system, however, ensures safe behavior of all symbolic values in a program. Our calculus extends a b