Zobrazeno 1 - 10
of 110
pro vyhledávání: '"symbolic verification"'
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.
Publikováno v:
IET Cyber-Physical Systems (2019)
Dependency on the correct operation of embedded systems is rapidly growing, mainly due to their wide range of applications. Their structures are becoming more complex and currently require multi-core processors with scalable shared memory, signal-pro
Externí odkaz:
https://doaj.org/article/c697d20f660a4d3b9dfb347d81fe9d6e
Publikováno v:
Моделирование и анализ информационных систем, Vol 19, Iss 6, Pp 79-91 (2015)
In this paper we propose an approach to efficient automating test technology for industrial software projects, that uses a formal model of the system, automatically performs a symbolic verification, generation and concretization of the symbolic trace
Externí odkaz:
https://doaj.org/article/61587dca5e904af18283a1271d16f304
Autor:
Zoltán Kovács
Publikováno v:
Mathematics in Computer Science. 15:789-801
Implicit locus equations in GeoGebra allow the user to do experiments with generalization of the concept of ellipses, namely with $n$-ellipses. By experimenting we obtain a geometric object that is very similar to a set of two circles.
Comment:
Comment:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e8fb03b45796c02b7957a35044316fa
https://doi.org/10.1007/s11786-021-00506-3
https://doi.org/10.1007/s11786-021-00506-3
Publikováno v:
Моделирование и анализ информационных систем, Vol 20, Iss 6, Pp 64-77 (2013)
This paper presents an overview of technology of the automated generation of test scenarios based on guides. The usage of this technology can significantly improve the quality of the developed program products. In order to ground the technology creat
Externí odkaz:
https://doaj.org/article/91e12c6ca6444074ac8f4ea3eae761e0
Publikováno v:
Logical Methods in Computer Science
Logical Methods in Computer Science, 2022, 18 (1), ⟨10.46298/lmcs-18(1:31)2022⟩
Logical Methods in Computer Science, 2022, 18 (1), ⟨10.46298/lmcs-18(1:31)2022⟩
We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical formalism for such systems but for which most interesting problems are undecidable. Notably, the parametric reachability emp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4f8049b5afdd72488369f92e6eb40bc
http://arxiv.org/abs/2004.09171
http://arxiv.org/abs/2004.09171
Publikováno v:
Lecture Notes in Computer Science
COORDINATION 2019-21st International Conference on Coordination Models and Languages
COORDINATION 2019-21st International Conference on Coordination Models and Languages, Jun 2019, Kongens Lyngby, Denmark. pp.161-181, ⟨10.1007/978-3-030-22397-7_10⟩
Lecture Notes in Computer Science ISBN: 9783030223960
COORDINATION
COORDINATION 2019-21st International Conference on Coordination Models and Languages
COORDINATION 2019-21st International Conference on Coordination Models and Languages, Jun 2019, Kongens Lyngby, Denmark. pp.161-181, ⟨10.1007/978-3-030-22397-7_10⟩
Lecture Notes in Computer Science ISBN: 9783030223960
COORDINATION
t Part 4: Coordination Patterns; International audience; We provide a solution for the design of safe concurrent systems by compositional application of verified design patterns-called ar-chitectures-to a small set of functional components. To this e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27884895542aee3896b18ce6a9323452
https://hal.science/hal-02143782
https://hal.science/hal-02143782
Autor:
Di Long Li, Alwen Tiu
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030294359
CADE
CADE
Symbolic verification of security protocols typically relies on an attacker model called the Dolev-Yao model, which does not model adequately various algebraic properties of cryptographic operators used in many real-world protocols. In this work we d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a317c5cf85826726abeb58591aee70ce
https://doi.org/10.1007/978-3-030-29436-6_21
https://doi.org/10.1007/978-3-030-29436-6_21
Publikováno v:
Foundations of Security, Protocols, and Equational Reasoning ISBN: 9783030190514
Foundations of Security, Protocols, and Equational Reasoning
Foundations of Security, Protocols, and Equational Reasoning
Intruders can infer properties of a system by measuring the time it takes for the system to respond to some request of a given protocol, that is, by exploiting time side channels. These properties may help intruders distinguish whether a system is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::287481cb9adda4b881a4f3dbcf3199bb
https://doi.org/10.1007/978-3-030-19052-1_8
https://doi.org/10.1007/978-3-030-19052-1_8
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030175016
TACAS (3)
TACAS (3)
DIVINE is an LLVM-based verification tool focusing on analysis of real-world C and C++ programs. Such programs often interact with their environment, for example via inputs from users or network. When these programs are analyzed, it is desirable that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08c4905f60a1e99c2fbdcffd33c33391
https://doi.org/10.1007/978-3-030-17502-3_14
https://doi.org/10.1007/978-3-030-17502-3_14