发布求助
文献互助 智能选刊 最新文献

Doctoral Workshop on Mathematical and Engineering Methods in Computer Science最新文献

筛选
英文 中文
A Light-Weight Approach for Verifying Multi-Threaded Programs with CPAchecker 用CPAchecker验证多线程程序的轻量级方法
Doctoral Workshop on Mathematical and Engineering Methods in Computer Science Pub Date : 2016-12-15 DOI: 10.4204/EPTCS.233.6
Dirk Beyer, Karlheinz Friedberger
{"title":"A Light-Weight Approach for Verifying Multi-Threaded Programs with CPAchecker","authors":"Dirk Beyer, Karlheinz Friedberger","doi":"10.4204/EPTCS.233.6","DOIUrl":"https://doi.org/10.4204/EPTCS.233.6","url":null,"abstract":"Verifying multi-threaded programs is becoming more and more important, because of the strong trend to increase the number of processing units per CPU socket. We introduce a new configurable program analysis for verifying multi-threaded programs with a bounded number of threads. We present a simple and yet efficient implementation as component of the existing program-verification framework CPACHECKER. While CPACHECKER is already competitive on a large benchmark set of sequential verification tasks, our extension enhances the overall applicability of the framework. Our implementation of handling multiple threads is orthogonal to the abstract domain of the data-flow analysis, and thus, can be combined with several existing analyses in CPACHECKER, like value analysis, interval analysis, and BDD analysis. The new analysis is modular and can be used, for example, to verify reachability properties as well as to detect deadlocks in the program. This paper includes an evaluation of the benefit of some optimization steps (e.g., changing the iteration order of the reachability algorithm or applying partial-order reduction) as well as the comparison with other state-of-the-art tools for verifying multi-threaded programs.","PeriodicalId":325597,"journal":{"name":"Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120964564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Avalanche Effect in Improperly Initialized CAESAR Candidates 不正确初始化凯撒候选人的雪崩效果
Doctoral Workshop on Mathematical and Engineering Methods in Computer Science Pub Date : 2016-12-15 DOI: 10.4204/EPTCS.233.7
Martin Ukrop, P. Švenda
{"title":"Avalanche Effect in Improperly Initialized CAESAR Candidates","authors":"Martin Ukrop, P. Švenda","doi":"10.4204/EPTCS.233.7","DOIUrl":"https://doi.org/10.4204/EPTCS.233.7","url":null,"abstract":"Cryptoprimitives rely on thorough theoretical background, but often lack basic usability features making them prone to unintentional misuse by developers. We argue that this is true even for the state-of-the-art designs. Analyzing 52 candidates of the current CAESAR competition has shown none of them have an avalanche effect in authentication tag strong enough to work properly when partially misconfigured. Although not directly decreasing their security profile, this hints at their security usability being less than perfect. Paper details available at crcs.cz/papers/memics2016","PeriodicalId":325597,"journal":{"name":"Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126156835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Anti-Path Cover on Sparse Graph Classes 稀疏图类的反路径覆盖
Doctoral Workshop on Mathematical and Engineering Methods in Computer Science Pub Date : 2016-12-15 DOI: 10.4204/EPTCS.233.8
P. Dvořák, D. Knop, Tomáš Masařík
{"title":"Anti-Path Cover on Sparse Graph Classes","authors":"P. Dvořák, D. Knop, Tomáš Masařík","doi":"10.4204/EPTCS.233.8","DOIUrl":"https://doi.org/10.4204/EPTCS.233.8","url":null,"abstract":"We show that it is possible to use Bondy-Chvatal closure to design an FPT algorithm that decides whether or not it is possible to cover vertices of an input graph by at most k vertex disjoint paths in the complement of the input graph. More precisely, we show that if a graph has tree-width at most w and its complement is closed under Bondy-Chvatal closure, then it is possible to bound neighborhood diversity of the complement by a function of w only. A simpler proof where tree-depth is used instead of tree-width is also presented.","PeriodicalId":325597,"journal":{"name":"Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125786999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
HADES: Microprocessor Hazard Analysis via Formal Verification of Parameterized Systems HADES:通过参数化系统的正式验证进行微处理器危害分析
Doctoral Workshop on Mathematical and Engineering Methods in Computer Science Pub Date : 2016-12-15 DOI: 10.4204/EPTCS.233.9
Lukás Charvát, A. Smrčka, Tomáš Vojnar
{"title":"HADES: Microprocessor Hazard Analysis via Formal Verification of Parameterized Systems","authors":"Lukás Charvát, A. Smrčka, Tomáš Vojnar","doi":"10.4204/EPTCS.233.9","DOIUrl":"https://doi.org/10.4204/EPTCS.233.9","url":null,"abstract":"HADES is a fully automated verification tool for pipeline-based microprocessors that aims at flaws caused by improperly handled data hazards. It focuses on single-pipeline microprocessors designed at the register transfer level (RTL) and deals with read-after-write, write-after-write, and write-after-read hazards. HADES combines several techniques, including data-flow analysis, error pattern matching, SMT solving, and abstract regular model checking. It has been successfully tested on several microprocessors for embedded applications.","PeriodicalId":325597,"journal":{"name":"Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125920809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Using the Context of User Feedback in Recommender Systems 在推荐系统中使用用户反馈
Doctoral Workshop on Mathematical and Engineering Methods in Computer Science Pub Date : 2016-12-15 DOI: 10.4204/EPTCS.233.1
Ladislav Peška
{"title":"Using the Context of User Feedback in Recommender Systems","authors":"Ladislav Peška","doi":"10.4204/EPTCS.233.1","DOIUrl":"https://doi.org/10.4204/EPTCS.233.1","url":null,"abstract":"Our work is generally focused on recommending for small or medium-sized e-commerce portals, where explicit feedback is absent and thus the usage of implicit feedback is necessary. Nonetheless, for some implicit feedback features, the presentation context may be of high importance. In this paper, we present a model of relevant contextual features affecting user feedback, propose methods leveraging those features, publish a dataset of real e-commerce users containing multiple user feedback indicators as well as its context and finally present results of purchase prediction and recommendation experiments. Off-line experiments with real users of a Czech travel agency website corroborated the importance of leveraging presentation context in both purchase prediction and recommendation tasks.","PeriodicalId":325597,"journal":{"name":"Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125624143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Characterizing DAG-depth of Directed Graphs 有向图的dag深度刻画
Doctoral Workshop on Mathematical and Engineering Methods in Computer Science Pub Date : 2016-12-15 DOI: 10.4204/EPTCS.233.3
Matús Bezek
{"title":"Characterizing DAG-depth of Directed Graphs","authors":"Matús Bezek","doi":"10.4204/EPTCS.233.3","DOIUrl":"https://doi.org/10.4204/EPTCS.233.3","url":null,"abstract":"We study DAG-depth, a structural depth measure of directed graphs, which naturally extends the tree-depth of ordinary graphs. We define a DAG-depth decomposition as a strategy for the cop player in the lift-free version of the cops-and-robber game on directed graphs and prove its correctness. The DAG-depth decomposition is related to DAG-depth in a similar way as an elimination tree is related to the tree-depth. We study the size aspect of DAG-depth decomposition and provide a definition of mergeable and optimally mergeable vertices in order to make the decomposition smaller and acceptable for the cop player as a strategy. We also provide a way to find the closure of a DAG-depth decomposition, which is the largest digraph for which the given decomposition represents a winning strategy for the cop player.","PeriodicalId":325597,"journal":{"name":"Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131593265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Reducing Nondeterministic Tree Automata by Adding Transitions 通过添加转换减少不确定性树自动机
Doctoral Workshop on Mathematical and Engineering Methods in Computer Science Pub Date : 2016-12-15 DOI: 10.4204/EPTCS.233.4
Ricardo Almeida
{"title":"Reducing Nondeterministic Tree Automata by Adding Transitions","authors":"Ricardo Almeida","doi":"10.4204/EPTCS.233.4","DOIUrl":"https://doi.org/10.4204/EPTCS.233.4","url":null,"abstract":"We introduce saturation of nondeterministic tree automata, a technique that consists of adding new transitions to an automaton while preserving its language. We implemented our algorithm on minotaut - a module of the tree automata library libvata that reduces the size of automata by merging states and removing superfluous transitions - and we show how saturation can make subsequent merge and transition-removal operations more effective. Thus we obtain a Ptime algorithm that reduces the size of tree automata even more than before. Additionally, we explore how minotaut alone can play an important role when performing hard operations like complementation, allowing to both obtain smaller complement automata and lower computation times. We then show how saturation can extend this contribution even further. We tested our algorithms on a large collection of automata from applications of libvata in shape analysis, and on different classes of randomly generated automata.","PeriodicalId":325597,"journal":{"name":"Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122987612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Note on One Less Known Class of Generated Residual Implications 关于一类不太为人所知的生成残差含义的注释
Doctoral Workshop on Mathematical and Engineering Methods in Computer Science Pub Date : 2016-12-15 DOI: 10.4204/EPTCS.233.2
Vojtěch Havlena, Dana Hlinená
{"title":"A Note on One Less Known Class of Generated Residual Implications","authors":"Vojtěch Havlena, Dana Hlinená","doi":"10.4204/EPTCS.233.2","DOIUrl":"https://doi.org/10.4204/EPTCS.233.2","url":null,"abstract":"This paper builds on our contribution [Havlena and Hlinena, 2016] which studied modelling of the conjunction in human language. We have discussed three different ways of constructing conjunction. We have dealt with generated t-norms, generated means and Choquet integral. \u0000In this paper we construct the residual operators based on the above conjunctions. The only operator based on a t-norm is an implication. We show that this implication belongs to the class of generated implications I^g_N which was introduced in [Smutna, 1999] and studied in [Biba and Hlinena, 2012]. We study its properties. More, we investigate this class of generated implications. Some important properties, including relations between some classes of implications, are given.","PeriodicalId":325597,"journal":{"name":"Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128703361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sending Money Like Sending E-mails: Cryptoaddresses, The Universal Decentralised Identities 像发送电子邮件一样发送金钱:加密地址，通用的分散身份
Doctoral Workshop on Mathematical and Engineering Methods in Computer Science Pub Date : 2016-12-01 DOI: 10.4204/EPTCS.233.5
Michal Zima
{"title":"Sending Money Like Sending E-mails: Cryptoaddresses, The Universal Decentralised Identities","authors":"Michal Zima","doi":"10.4204/EPTCS.233.5","DOIUrl":"https://doi.org/10.4204/EPTCS.233.5","url":null,"abstract":"Sending money in cryptocurrencies is majorly based on public keys or their hashed forms -- \"addresses.\" These long random-looking strings are user unfriendly for transferring by other means than via copy-and-paste or QR codes. Replacing such strings with identifiers chosen by users themselves would significantly improve usability of cryptocurrencies. Such identifiers could be memorable, easier to write on paper or to dictate over phone. Main challenge lies in designing a practically usable decentralised system for providing these identifiers. Former solutions have been built as centralised systems or come with nonnegligible limitations. Our solution is reminiscent of a prevalent e-mail system, which is an already user friendly and desirably decentralised system. It is shown that our approach is directly applicable also to other systems that use long cryptographic identifiers.","PeriodicalId":325597,"journal":{"name":"Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114735706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Challenge of Increasing Safe Response of Antivirus Software Users 提高杀毒软件用户安全响应的挑战
Doctoral Workshop on Mathematical and Engineering Methods in Computer Science Pub Date : 2015-10-23 DOI: 10.1007/978-3-319-29817-7_12
Vlasta Stavova, Vashek Matyás, K. Malinka
{"title":"The Challenge of Increasing Safe Response of Antivirus Software Users","authors":"Vlasta Stavova, Vashek Matyás, K. Malinka","doi":"10.1007/978-3-319-29817-7_12","DOIUrl":"https://doi.org/10.1007/978-3-319-29817-7_12","url":null,"abstract":"","PeriodicalId":325597,"journal":{"name":"Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116084875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信