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

Foundations of Software Technology and Theoretical Computer Science最新文献

筛选
英文 中文
Probabilistic Disclosure: Maximisation vs. Minimisation 概率披露:最大化vs.最小化
Foundations of Software Technology and Theoretical Computer Science Pub Date : 2017-12-11 DOI: 10.4230/LIPIcs.FSTTCS.2017.13
B. Bérard, S. Haddad, Engel Lefaucheux
{"title":"Probabilistic Disclosure: Maximisation vs. Minimisation","authors":"B. Bérard, S. Haddad, Engel Lefaucheux","doi":"10.4230/LIPIcs.FSTTCS.2017.13","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2017.13","url":null,"abstract":"We consider opacity questions where an observation function provides to an external attacker a view of the states along executions and secret executions are those visiting some state from a fixed subset. Disclosure occurs when the observer can deduce from a finite observation that the execution is secret, the e-disclosure variant corresponding to the execution being secret with probability greater than 1 − e. In a probabilistic and non deterministic setting, where an internal agent can choose between actions, there are two points of view, depending on the status of this agent: the successive choices can either help the attacker trying to disclose the secret, if the system has been corrupted, or they can prevent disclosure as much as possible if these choices are part of the system design. In the former situation, corresponding to a worst case, the disclosure value is the supremum over the strategies of the probability to disclose the secret (maximisation), whereas in the latter case, the disclosure is the infimum (minimisation). We address quantitative problems (comparing the optimal value with a threshold) and qualitative ones (when the threshold is zero or one) related to both forms of disclosure for a fixed or finite horizon. For all problems, we characterise their decidability status and their complexity. We discover a surprising asymmetry: on the one hand optimal strategies may be chosen among deterministic ones in maximisation problems, while it is not the case for minimisation. On the other hand, for the questions addressed here, more minimisation problems than maximisation ones are decidable.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116662195","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}
引用次数: 6
Forward Analysis for WSTS, Part III: Karp-Miller Trees WSTS的正向分析，第三部分:Karp-Miller树
Foundations of Software Technology and Theoretical Computer Science Pub Date : 2017-10-19 DOI: 10.23638/LMCS-16(2:13)2020
Michael Blondin, A. Finkel, J. Goubault-Larrecq
{"title":"Forward Analysis for WSTS, Part III: Karp-Miller Trees","authors":"Michael Blondin, A. Finkel, J. Goubault-Larrecq","doi":"10.23638/LMCS-16(2:13)2020","DOIUrl":"https://doi.org/10.23638/LMCS-16(2:13)2020","url":null,"abstract":"This paper is a sequel of \"Forward Analysis for WSTS, Part I: Completions\" [STACS 2009, LZI Intl. Proc. in Informatics 3, 433-444] and \"Forward Analysis for WSTS, Part II: Complete WSTS\" [Logical Methods in Computer Science 8(3), 2012]. In these two papers, we provided a framework to conduct forward reachability analyses of WSTS, using finite representations of downward-closed sets. We further develop this framework to obtain a generic Karp-Miller algorithm for the new class of very-WSTS. This allows us to show that coverability sets of very-WSTS can be computed as their finite ideal decompositions. Under natural effectiveness assumptions, we also show that LTL model checking for very-WSTS is decidable. The termination of our procedure rests on a new notion of acceleration levels, which we study. We characterize those domains that allow for only finitely many accelerations, based on ordinal ranks.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129146849","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}
引用次数: 7
Average Stack Cost of Büchi Pushdown Automata <s:1> chi下推自动机的平均堆叠代价
Foundations of Software Technology and Theoretical Computer Science Pub Date : 2017-10-12 DOI: 10.4230/LIPIcs.FSTTCS.2017.42
Jakub Michaliszyn, J. Otop
{"title":"Average Stack Cost of Büchi Pushdown Automata","authors":"Jakub Michaliszyn, J. Otop","doi":"10.4230/LIPIcs.FSTTCS.2017.42","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2017.42","url":null,"abstract":"We study the average stack cost of Buechi pushdown automata (Buechi PDA). We associate a non-negative price with each stack symbol and define the cost of a stack as the sum of costs of all its elements. We introduce and study the average stack cost problem (ASC), which asks whether there exists an accepting run of a given Buechi PDA such that the long-run average of stack costs is below some given threshold. The ASC problem generalizes mean-payoff objective and can be used to express quantitative properties of pushdown systems. In particular, we can compute the average response time using the ASC problem. We show that the ASC problem can be solved in polynomial time.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126082879","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
On Hashing-Based Approaches to Approximate DNF-Counting 基于哈希的dnf计数近似方法
Foundations of Software Technology and Theoretical Computer Science Pub Date : 2017-10-01 DOI: 10.4230/LIPIcs.FSTTCS.2017.41
Kuldeep S. Meel, Aditya A. Shrotri, Moshe Y. Vardi
{"title":"On Hashing-Based Approaches to Approximate DNF-Counting","authors":"Kuldeep S. Meel, Aditya A. Shrotri, Moshe Y. Vardi","doi":"10.4230/LIPIcs.FSTTCS.2017.41","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2017.41","url":null,"abstract":"Propositional model counting is a fundamental problem in artificial intelligence with a wide variety of applications, such as probabilistic inference, decision making under uncertainty, and probabilistic databases. Consequently, the problem is of theoretical as well as practical interest. When the constraints are expressed as DNF formulas, Monte Carlo-based techniques have been shown to provide a fully polynomial randomized approximation scheme (FPRAS). For CNF constraints, hashing-based approximation techniques have been demonstrated to be highly successful. Furthermore, it was shown that hashing-based techniques also yield an FPRAS for DNF counting without usage of Monte Carlo sampling. Our analysis, however, shows that the proposed hashing-based approach to DNF counting provides poor time complexity compared to the Monte Carlo-based DNF counting techniques. Given the success of hashing-based techniques for CNF constraints, it is natural to ask: Can hashing-based techniques provide an efficient FPRAS for DNF counting? In this paper, we provide a positive answer to this question. To this end, we introduce two novel algorithmic techniques: emph{Symbolic Hashing} and emph{Stochastic Cell Counting}, along with a new hash family of emph{Row-Echelon hash functions}. These innovations allow us to design a hashing-based FPRAS for DNF counting of similar complexity (up to polylog factors) as that of prior works. Furthermore, we expect these techniques to have potential applications beyond DNF counting.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"14 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131069832","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}
引用次数: 14
Querying Best Paths in Graph Databases 查询图数据库中的最佳路径
Foundations of Software Technology and Theoretical Computer Science Pub Date : 2017-10-01 DOI: 10.4230/LIPIcs.FSTTCS.2017.43
Jakub Michaliszyn, J. Otop, Piotr Wieczorek
{"title":"Querying Best Paths in Graph Databases","authors":"Jakub Michaliszyn, J. Otop, Piotr Wieczorek","doi":"10.4230/LIPIcs.FSTTCS.2017.43","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2017.43","url":null,"abstract":"Querying graph databases has recently received much attention. We propose a new approach to this problem, which balances competing goals of expressive power, language clarity and computational complexity. A distinctive feature of our approach is the ability to express properties of minimal (e.g. shortest) and maximal (e.g. most valuable) paths satisfying given criteria. To express complex properties in a modular way, we introduce labelling-generating ontologies. The resulting formalism is computationally attractive -- queries can be answered in non-deterministic logarithmic space in the size of the database.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121576392","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
Modulo Counting on Words and Trees 对单词和树的模计数
Foundations of Software Technology and Theoretical Computer Science Pub Date : 2017-10-01 DOI: 10.4230/LIPIcs.FSTTCS.2017.12
Bartosz Bednarczyk, Witold Charatonik
{"title":"Modulo Counting on Words and Trees","authors":"Bartosz Bednarczyk, Witold Charatonik","doi":"10.4230/LIPIcs.FSTTCS.2017.12","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2017.12","url":null,"abstract":"We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a technique for deciding the satisfiability problem. In the case of words this gives a new proof of EXPSPACE upper bound, and in the case of trees it gives a 2EXPTIME algorithm. This algorithm is optimal: we prove a matching lower bound by a generic reduction from alternating Turing machines working in exponential space; the reduction involves a development of a new version of tiling games.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123126065","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
Widths of Regular and Context-Free Languages 常规语言和上下文无关语言的宽度
Foundations of Software Technology and Theoretical Computer Science Pub Date : 2017-09-01 DOI: 10.4230/LIPIcs.FSTTCS.2019.49
David Mestel
{"title":"Widths of Regular and Context-Free Languages","authors":"David Mestel","doi":"10.4230/LIPIcs.FSTTCS.2019.49","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2019.49","url":null,"abstract":"Given a partially-ordered finite alphabet $Sigma$ and a language $Lsubseteq Sigma^*$, how large can an antichain in $L$ be (where $L$ is given the lexicographic ordering)? More precisely, since $L$ will in general be infinite, we should ask about the rate of growth of maximum antichains consisting of words of length $n$. This fundamental property of partial orders is known as the width, and in a companion work we show that the problem of computing the information leakage permitted by a deterministic interactive system modeled as a finite-state transducer can be reduced to the problem of computing the width of a certain regular language. In this paper, we show that if $L$ is regular then there is a dichotomy between polynomial and exponential antichain growth. We give a polynomial-time algorithm to distinguish the two cases, and to compute the order of polynomial growth, with the language specified as an NFA. For context-free languages we show that there is a similar dichotomy, but now the problem of distinguishing the two cases is undecidable. Finally, we generalise the lexicographic order to tree languages, and show that for regular tree languages there is a trichotomy between polynomial, exponential and doubly exponential antichain growth.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121715327","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
Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1 在l_1中嵌入近似低维l_2^2度量
Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-12-13 DOI: 10.4230/LIPIcs.FSTTCS.2016.10
A. Deshpande, P. Harsha, Rakesh Venkat
{"title":"Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1","authors":"A. Deshpande, P. Harsha, Rakesh Venkat","doi":"10.4230/LIPIcs.FSTTCS.2016.10","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2016.10","url":null,"abstract":"Goemans showed that any n points x_1,..., x_n in d-dimensions satisfying l_2^2 triangle inequalities can be embedded into l_{1}, with worst-case distortion at most sqrt{d}. We consider an extension of this theorem to the case when the points are approximately low-dimensional as opposed to exactly low-dimensional, and prove the following analogous theorem, albeit with average distortion guarantees: There exists an l_{2}^{2}-to-l_{1} embedding with average distortion at most the stable rank, sr(M), of the matrix M consisting of columns {x_i-x_j}_{i<j}. Average distortion embedding suffices for applications such as the SPARSEST CUT problem. Our embedding gives an approximation algorithm for the SPARSEST CUT problem on low threshold-rank graphs, where earlier work was inspired by Lasserre SDP hierarchy, and improves on a previous result of the first and third author [Deshpande and Venkat, in Proc. 17th APPROX, 2014]. Our ideas give a new perspective on l_{2}^{2} metric, an alternate proof of Goemans' theorem, and a simpler proof for average distortion sqrt{d}.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131172488","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
Mixed-Criticality Scheduling to Minimize Makespan 最小化完工时间的混合临界调度
Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-12-01 DOI: 10.4230/LIPIcs.FSTTCS.2016.7
Sanjoy Baruah, A. Easwaran, Zhishan Guo
{"title":"Mixed-Criticality Scheduling to Minimize Makespan","authors":"Sanjoy Baruah, A. Easwaran, Zhishan Guo","doi":"10.4230/LIPIcs.FSTTCS.2016.7","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2016.7","url":null,"abstract":"In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical. The desired execution semantics are that all jobs should execute correctly provided all jobs complete upon being allowed to execute for up to the smaller of their execution time estimates, whereas if some jobs need to execute beyond their smaller execution time estimates (but not beyond their larger execution time estimates), then only the jobs classified as being more critical are required to execute correctly. The scheduling of collections of such mixed-criticality jobs upon identical multiprocessor platforms in order to minimize the makespan is considered here.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"33 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":"124442710","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}
引用次数: 8
Most Likely Voronoi Diagrams in Higher Dimensions 最可能是更高维度的Voronoi图
Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-12-01 DOI: 10.4230/LIPIcs.FSTTCS.2016.31
Nirman Kumar, Benjamin Raichel, S. Suri, Kevin Verbeek
{"title":"Most Likely Voronoi Diagrams in Higher Dimensions","authors":"Nirman Kumar, Benjamin Raichel, S. Suri, Kevin Verbeek","doi":"10.4230/LIPIcs.FSTTCS.2016.31","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2016.31","url":null,"abstract":"The Most Likely Voronoi Diagram is a generalization of the well known Voronoi Diagrams to a stochastic setting, where a stochastic point is a point associated with a given probability of existence, and the cell for such a point is the set of points which would classify the given point as its most likely nearest neighbor. We investigate the complexity of this subdivision of space in d dimensions. We show that in the general case, the complexity of such a subdivision is Omega(n^{2d}) where n is the number of points. This settles an open question raised in a recent (ISAAC 2014) paper of Suri and Verbeek, which first defined the Most Likely Voronoi Diagram. We also show that when the probabilities are assigned using a random permutation of a fixed set of values, in expectation the complexity is only ~O(n^{ceil{d/2}}) where the ~O(*) means that logarithmic factors are suppressed. In the worst case, this bound is tight up to polylog factors.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"28 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":"122050116","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学术官方微信