21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)最新文献_第3页

Control in o-minimal Hybrid Systems 最小混合系统的控制

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.22

P. Bouyer, Thomas Brihaye, F. Chevalier

引用次数: 25

Avoiding Determinization 避免Determinization

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.15

O. Kupferman

{"title":"Avoiding Determinization","authors":"O. Kupferman","doi":"10.1109/LICS.2006.15","DOIUrl":"https://doi.org/10.1109/LICS.2006.15","url":null,"abstract":"Automata on infinite objects are extensively used in system specification, verification, and synthesis. Applications that involve determinization of automata on infinite words have been doomed to belong to the second category. This has to do with the intricacy of Safra's optimal determinization construction, the fact that the state space that results from determinization is awfully complex and is not amenable to optimizations and a symbolic implementation, and the fact that determinization requires the introduction of acceptance conditions that are more complex than the Buchi acceptance condition. Examples of applications that involve determinization and belong to the unfortunate second category include model checking of omega-regular properties, decidability of branching temporal logics, and synthesis and control of open systems. We offer an alternative to the standard automata-theoretic approach. The crux of our approach is avoiding determinization. Our approach goes instead via universal co-Buchi automata. Like nondeterministic automata, universal automata may have several runs on every input. However, an input is accepted if all of the runs are accepting. We show how the use of universal automata simplifies significantly known complementation constructions for automata on infinite words, known decision procedures for branching temporal logics, known synthesis algorithms, and other applications that are now based on determinization. Our algorithms are less difficult to implement and have practical advantages like being amenable to optimizations and a symbolic implementation","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124189256","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}

引用次数: 17

Adapting Logics 调整逻辑

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.9

A. Blass

引用次数: 0

An Automata-Theoretic Approach for Model Checking Threads for LTL Propert LTL属性模型检验线程的自动机理论方法

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.11

Vineet Kahlon, Aarti Gupta

{"title":"An Automata-Theoretic Approach for Model Checking Threads for LTL Propert","authors":"Vineet Kahlon, Aarti Gupta","doi":"10.1109/LICS.2006.11","DOIUrl":"https://doi.org/10.1109/LICS.2006.11","url":null,"abstract":"In this paper, we propose a new technique for the verification of concurrent multi-threaded programs. In general, the problem is known to be undecidable even for programs with just two threads. However, we exploit the observation that, in practice, a large fraction of concurrent programs can either be modeled as pushdown systems communicating solely using locks or can be reduced to such systems by applying standard abstract interpretation techniques or by exploiting separation of data from control. Moreover, standard programming practice guidelines typically recommend that programs use locks in a nested fashion. In fact, in languages like Java and C#, locks are guaranteed to be nested. For such a framework, we show, by using the new concept of Lock Constrained Multi-Automata Pair (LMAP), that pre*-closures of regular sets of states can be computed efficiently. This is accomplished by reducing the pre*-closure computation for a regular set of states of a concurrent program with nested locks to those for its individual threads. Leveraging this new technique then allows us to formulate a fully automatic, efficient and exact (sound and complete) decision procedure for model checking threads communicating via nested locks for indexed linear-time temporal logic formulae","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"88 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126104003","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}

引用次数: 27

Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic 关于程序的匹配显式和模态推理:动态逻辑的证明理论描述

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.33

D. Leivant

{"title":"Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic","authors":"D. Leivant","doi":"10.1109/LICS.2006.33","DOIUrl":"https://doi.org/10.1109/LICS.2006.33","url":null,"abstract":"We establish a match between two broad approaches to reasoning about programs: modal (dynamic logic) proofs on the one hand, and explicit higher-order reference to program semantics, on the other. We show that Pratt-Segerberg's first-order dynamic logic DL proves precisely program properties that are provable in second-order logic with set-existence restricted to a natural class of formulas, well-known to be related to computation theory. The set-existence principle is for computational formulas, i.e. of the form forallRexistxoarrF where R is relational, F quantifier-free. Depending on the exact nature of the programs considered, some fine tuning is needed. We establish a descriptive match, of independent interest, between programming languages L and particular classes DL of computational formulas, in the following sense: the semantics of programs alphaisinL is explicitly definable, in all relational structures, by a formula phialpha of DL; and for every formula phi of DL there is a program in L whose termination is equivalent to phi. In particular, we match the class of regular programs with random assignments to computational formulas that are \"sequential\", and the regular programs (without random assignments) to formulas we dub \"definite\", and that obey a natural variable scoping condition","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130819711","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

Saturated Semantics for Reactive Systems 反应系统的饱和语义

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.46

F. Bonchi, B. König, U. Montanari

{"title":"Saturated Semantics for Reactive Systems","authors":"F. Bonchi, B. König, U. Montanari","doi":"10.1109/LICS.2006.46","DOIUrl":"https://doi.org/10.1109/LICS.2006.46","url":null,"abstract":"The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules (i.e., unlabelled transition rules) are often more natural. This leads to the question of how behavioural equivalences (bisimilarity, trace equivalence, etc.) defined for LTS can be transferred to unlabelled transition systems. Recently, in order to answer this question, several proposals have been made with the aim of automatically deriving an LTS from reaction rules in such a way that the resulting equivalences are congruences. Furthermore these equivalences should agree with the standard semantics, whenever one exists. In this paper we propose saturated semantics, based on a weaker notion of observation and orthogonal to all the previous proposals, and we demonstrate the appropriateness of our semantics by means of two examples: logic programming and a subset of the open pi-calculus. Indeed, we prove that our equivalences are congruences and that they coincide with logical equivalence and open bisimilarity respectively, while equivalences studied in previous works are strictly finer","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130806937","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}

引用次数: 62

Managing Digital Rights using Linear Logic 使用线性逻辑管理数字版权

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.32

A. Barth, John C. Mitchell

{"title":"Managing Digital Rights using Linear Logic","authors":"A. Barth, John C. Mitchell","doi":"10.1109/LICS.2006.32","DOIUrl":"https://doi.org/10.1109/LICS.2006.32","url":null,"abstract":"Digital music players protect songs by enforcing licenses that convey specific rights for individual songs or groups of songs. For licenses specified in industry, we show that deciding whether a license authorizes a sequence of actions is NP-complete, with a restricted version of the problem solvable efficiently using a reduction to maximum network flow. The authorization algorithm used in industry is online, deciding which rights to exercise as actions occur, but we show that all online algorithms are necessarily non-monotonic: each allows actions under one license that it does not allow under a more flexible license. In one approach to achieving monotonicity, we exhibit the unique maximal set of licenses on which there exists a monotonic online algorithm. This set of well-behaved licenses induces an approximation algorithm by replacing each license with a well-behaved license. In a second approach, we consider allowing the player to revise its past decisions about which rights to exercise while still ensuring compliance with the license. We propose an efficient algorithm based on linear logic, with linear negation used to revise past decisions. We prove our algorithm monotonic, live, and sound with respect to the semantics of licenses","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133918871","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}

引用次数: 24

On Typability for Rank-2 Intersection Types with Polymorphic Recursion 基于多态递归的Rank-2交集类型的可分类性

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.41

Tachio Terauchi, A. Aiken

引用次数: 6

PSPACE Bounds for Rank-1 Modal Logics 秩-1模态逻辑的PSPACE界

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1145/1462179.1462185

Lutz Schröder, D. Pattinson

引用次数: 85

Boolean Algebras for Lambda Calculus 微积分中的布尔代数

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.16

Giulio Manzonetto, A. Salibra

{"title":"Boolean Algebras for Lambda Calculus","authors":"Giulio Manzonetto, A. Salibra","doi":"10.1109/LICS.2006.16","DOIUrl":"https://doi.org/10.1109/LICS.2006.16","url":null,"abstract":"In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebra of central elements (playing the role of idempotent elements in rings), whose operations are defined by suitable combinators. Central elements are used to represent any combinatory algebra as a Boolean product of directly indecomposable combinatory algebras (i.e., algebras which cannot be decomposed as the Cartesian product of two other nontrivial algebras). Central elements are also used to provide applications of the representation theorem to lambda calculus. We show that the indecomposable semantics (i.e., the semantics of lambda calculus given in terms of models of lambda calculus, which are directly indecomposable as combinatory algebras) includes the continuous, stable and strongly stable semantics, and the term models of all semisensible lambda theories. In one of the main results of the paper we show that the indecomposable semantics is equationally incomplete, and this incompleteness is as wide as possible: for every recursively enumerable lambda theory Tscr, there is a continuum of lambda theories including Tscr which are omitted by the indecomposable semantics","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122922402","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}

引用次数: 21