Foundations of Software Technology and Theoretical Computer Science最新文献_第10页

One-Counter Automata with Counter Observability 具有计数器可观察性的单计数器自动机

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-02-18 DOI: 10.4230/LIPIcs.FSTTCS.2016.20

B. Bollig

引用次数: 3

Prompt Delay 提示延迟

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-02-16 DOI: 10.4230/LIPIcs.FSTTCS.2016.43

F. Klein, Martin Zimmermann

引用次数: 11

On the Control of Asynchronous Automata 异步自动机的控制研究

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2016-01-20 DOI: 10.4230/LIPIcs.FSTTCS.2017.30

H. Gimbert

引用次数: 9

One-way Definability of Sweeping Transducer 扫描传感器的单向可定义性

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2015-12-16 DOI: 10.4230/LIPIcs.FSTTCS.2015.178

Félix Baschenis, Olivier Gauwin, A. Muscholl, G. Puppis

引用次数: 7

What's Decidable about Availability Languages? 可用性语言有什么可确定的?

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2015-12-11 DOI: 10.4230/LIPIcs.FSTTCS.2015.192

P. Abdulla, M. Atig, R. Meyer, M. Salehi

{"title":"What's Decidable about Availability Languages?","authors":"P. Abdulla, M. Atig, R. Meyer, M. Salehi","doi":"10.4230/LIPIcs.FSTTCS.2015.192","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2015.192","url":null,"abstract":"We study here the algorithmic analysis of systems modeled in terms of availability languages. Our first main result is a positive answer to the emptiness problem: it is decidable whether a given availability language contains a word. The key idea is an inductive construction that replaces availability languages with Parikh-equivalent regular languages. As a second contribution, we solve the intersection problem modulo bounded languages: given availability languages and a bounded language, it is decidable whether the intersection of the former contains a word from the bounded language. We show that the problem is NP-complete. The idea is to reduce to satisfiability of existential Presburger arithmetic. Since the (general) intersection problem for availability languages is known to be undecidable, our results characterize the decidability border for this model. Our last contribution is a study of the containment problem between regular and availability languages. We show that safety verification, i.e., checking containment of an availability language in a regular language, is decidable. The containment problem of regular languages in availability languages is proven undecidable.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130983548","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}

引用次数: 10

A Provably Correct Sampler for Probabilistic Programs 概率程序的可证明正确抽样器

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2015-12-01 DOI: 10.4230/LIPIcs.FSTTCS.2015.475

C. Hur, A. Nori, S. Rajamani, Selva Samuel

{"title":"A Provably Correct Sampler for Probabilistic Programs","authors":"C. Hur, A. Nori, S. Rajamani, Selva Samuel","doi":"10.4230/LIPIcs.FSTTCS.2015.475","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2015.475","url":null,"abstract":"We consider the problem of inferring the implicit distribution specified by a probabilistic program. A popular inference technique for probabilistic programs called Markov Chain Monte Carlo or \u0000MCMC sampling involves running the program repeatedly and generating sample values by perturbing values produced in \"previous runs\". This simulates a Markov chain whose stationary distribution is the distribution specified by the probabilistic program. However, it is non-trivial to implement MCMC sampling for probabilistic programs since each variable could be updated at multiple program points. In such cases, it is unclear which values from the \"previous run\" should be used to generate samples for the \"current run\". We present an algorithm to solve this problem for the general case and formally prove that the algorithm is correct. Our algorithm handles variables that are updated multiple times along the same path, updated along different paths in a conditional statement, or repeatedly updated inside loops, We have implemented our algorithm in a tool called InferX. We empirically demonstrate that InferX produces the correct result for various benchmarks, whereas existing tools such as R2 and Stan produce incorrect results on several of these benchmarks.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"79 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123421527","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}

引用次数: 33

Counting Euler Tours in Undirected Bounded Treewidth Graphs 无向有界树宽图中的欧拉游计数

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2015-10-14 DOI: 10.4230/LIPIcs.FSTTCS.2015.246

N. Balaji, Samir Datta, Venkatesh Ganesan

{"title":"Counting Euler Tours in Undirected Bounded Treewidth Graphs","authors":"N. Balaji, Samir Datta, Venkatesh Ganesan","doi":"10.4230/LIPIcs.FSTTCS.2015.246","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2015.246","url":null,"abstract":"We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel - by proving a $#SAC^1$ upper bound. This is in stark contrast to #P-completeness of the same problem in general graphs. \u0000Our main technical contribution is to show how (an instance of) dynamic programming on bounded emph{clique-width} graphs can be performed efficiently in parallel. Thus we show that the sequential result of Espelage, Gurski and Wanke for efficiently computing Hamiltonian paths in bounded clique-width graphs can be adapted in the parallel setting to count the number of Hamiltonian paths which in turn is a tool for counting the number of Euler tours in bounded tree-width graphs. Our technique also yields parallel algorithms for counting longest paths and bipartite perfect matchings in bounded-clique width graphs. \u0000While establishing that counting Euler tours in bounded tree-width graphs can be computed by non-uniform monotone arithmetic circuits of polynomial degree (which characterize $#SAC^1$) is relatively easy, establishing a uniform $#SAC^1$ bound needs a careful use of polynomial interpolation.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127190101","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

Decidability in the Logic of Subsequences and Supersequences 子序列和上序列逻辑中的可判定性

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2015-10-14 DOI: 10.4230/LIPIcs.FSTTCS.2015.84

Prateek Karandikar, P. Schnoebelen

引用次数: 17

Secure Refinements of Communication Channels 安全改进通信渠道

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2015-10-13 DOI: 10.4230/LIPIcs.FSTTCS.2015.575

Vincent Cheval, V. Cortier, Eric le Morvan

引用次数: 3

Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches 图优化问题的动态绘制及其在保切图中的应用

Foundations of Software Technology and Theoretical Computer Science Pub Date : 2015-10-12 DOI: 10.4230/LIPIcs.FSTTCS.2015.52

Sepehr Assadi, S. Khanna, Yang Li, V. Tannen

{"title":"Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches","authors":"Sepehr Assadi, S. Khanna, Yang Li, V. Tannen","doi":"10.4230/LIPIcs.FSTTCS.2015.52","DOIUrl":"https://doi.org/10.4230/LIPIcs.FSTTCS.2015.52","url":null,"abstract":"In this paper, we introduce a new model for sublinear algorithms called emph{dynamic sketching}. In this model, the underlying data is partitioned into a large emph{static} part and a small emph{dynamic} part and the goal is to compute a summary of the static part (i.e, a emph{sketch}) such that given any emph{update} for the dynamic part, one can combine it with the sketch to compute a given function. We say that a sketch is emph{compact} if its size is bounded by a polynomial function of the length of the dynamic data, (essentially) independent of the size of the static part. \u0000A graph optimization problem $P$ in this model is defined as follows. The input is a graph $G(V,E)$ and a set $T subseteq V$ of $k$ terminals; the edges between the terminals are the dynamic part and the other edges in $G$ are the static part. The goal is to summarize the graph $G$ into a compact sketch (of size poly$(k)$) such that given any set $Q$ of edges between the terminals, one can answer the problem $P$ for the graph obtained by inserting all edges in $Q$ to $G$, using only the sketch. \u0000We study the fundamental problem of computing a maximum matching and prove tight bounds on the sketch size. In particular, we show that there exists a (compact) dynamic sketch of size $O(k^2)$ for the matching problem and any such sketch has to be of size $Omega(k^2)$. Our sketch for matchings can be further used to derive compact dynamic sketches for other fundamental graph problems involving cuts and connectivities. Interestingly, our sketch for matchings can also be used to give an elementary construction of a emph{cut-preserving vertex sparsifier} with space $O(kC^2)$ for $k$-terminal graphs; here $C$ is the total capacity of the edges incident on the terminals. Additionally, we give an improved lower bound (in terms of $C$) of $Omega(C/log{C})$ on size of cut-preserving vertex sparsifiers.","PeriodicalId":175000,"journal":{"name":"Foundations of Software Technology and Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129703519","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