Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Michał Moskal"'
Publikováno v:
2022 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC).
Publikováno v:
Materials; Volume 15; Issue 4; Pages: 1601
The article presents the results of analyses of numerical modelling of selected factors in electric arc furnace melts. The aim of the study was to optimise the melting process in an electric arc furnace using statistical-thermodynamic modelling based
Publikováno v:
Journal of Materials Engineering and Performance. 29:1479-1487
The conditions of nonmetallic inclusions formation by using manganese, silicon, and aluminum deoxidizers in a steel bath (four steel grades) are reviewed in the presented paper. The changes in the chemical composition of nonmetallic inclusions were c
Publikováno v:
Electronic Notes in Theoretical Computer Science. 198(2):19-35
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quantified formulas through instantiation. Two novel, efficient algorithms f
Publikováno v:
The Future of Software Engineering ISBN: 9783642151866
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::336ebf29a82e920e6c98b5f6b1c0f9e7
https://doi.org/10.1007/978-3-642-15187-3_5
https://doi.org/10.1007/978-3-642-15187-3_5
Autor:
Michał Moskal
Publikováno v:
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories.
We give a case study for a Satisfiability Modulo Theories (SMT) solver usage in functional verification of a real world operating system. In particular, we present a view of the E-matching pattern annotations on quantified formulas as a kind of logic
Autor:
Michał Moskal
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783540787990
TACAS
TACAS
Modern Satisfiability Modulo Theories (SMT) solvers are used in a wide variety of software and hardware verification applications. Proof producing SMT solvers are very desirable as they increase confidence in the solver and ease debugging/profiling,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38f753d3630a3673c4c9aea68dba70f9
https://doi.org/10.1007/978-3-540-78800-3_38
https://doi.org/10.1007/978-3-540-78800-3_38
Publikováno v:
SAVCBS
Well-specified programs enable code reuse and therefore techniques that help programmers to annotate code correctly are valuable. We devised an automated analysis that detects unreachable code in the presence of code annotations. We implemented it as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6bf9b9f907459cdd334b319267e52d0
Autor:
Jan Sikora, Michał Moskal, Paweł Hrycaj, Kajetan Kisiel, Dorota Trzybulska, Katarzyna Graniczna, Dorota Cieślak, Anna Olewicz-Gawlik
Publikováno v:
Cellular Immunology. 296:155
Publikováno v:
Journal of Automated Reasoning; Feb2010, Vol. 44 Issue 1/2, p111-144, 34p