Proceedings 16th Annual IEEE Symposium on Logic in Computer Science最新文献_第4页

Successive approximation of abstract transition relations 抽象转换关系的逐次逼近

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932482

Satyaki Das, D. Dill

{"title":"Successive approximation of abstract transition relations","authors":"Satyaki Das, D. Dill","doi":"10.1109/LICS.2001.932482","DOIUrl":"https://doi.org/10.1109/LICS.2001.932482","url":null,"abstract":"Recently, we have improved the efficiency of the predicate abstraction scheme presented by Das, Dill and Park (1999). As a result, the number of validity checks needed to prove the necessary verification condition has been reduced. The key idea is to refine an approximate abstract transition relation based on the counter-example generated. The system starts with an approximate abstract transition relation on which the verification condition (in our case, this is a safety property) is model-checked. If the property holds then the proof is done; otherwise the model checker returns an abstract counter-example trace. This trace is used to refine the abstract transition relation if possible and start anew. At the end of the process, the system either proves the verification condition or comes up with an abstract counter-example trace which holds in the most accurate abstract transition relation possible (with the user-provided predicates as a basis). If the verification condition fails in the abstract system, then either the concrete system does not satisfy it or the abstraction predicates chosen are not strong enough. This algorithm has been used on a concurrent garbage collection algorithm and a secure contract-signing protocol. This method improved the performance on the first problem significantly, and allowed us to tackle the second problem, which the previous method could not handle.","PeriodicalId":366313,"journal":{"name":"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131274014","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}

引用次数: 122

Semistructured data: from practice to theory 半结构化数据:从实践到理论

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932513

S. Abiteboul

引用次数: 14

Strong normalisation in the /spl pi/-calculus /spl pi/-演算中的强归一化

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932507

N. Yoshida, Martin Berger, Kohei Honda

引用次数: 29

Deconstructing Shostak 解构肖斯塔克

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932479

H. Ruess, N. Shankar

引用次数: 95

On ordering constraints for deduction with built-in Abelian semigroups, monoids and groups 关于内建阿贝尔半群、半群和群演绎的序约束

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932481

Guillem Godoy, R. Nieuwenhuis

引用次数: 4

"An n! lower bound on formula size" “一个n !公式大小的下界

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932497

M. Adler, N. Immerman

引用次数: 65

Semantics of name and value passing 名称和值传递的语义

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932486

M. Fiore, D. Turi

引用次数: 143

From verification to control: dynamic programs for omega-regular objectives 从验证到控制:omega-regular目标的动态程序

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932504

L. D. Alfaro, T. Henzinger, R. Majumdar

{"title":"From verification to control: dynamic programs for omega-regular objectives","authors":"L. D. Alfaro, T. Henzinger, R. Majumdar","doi":"10.1109/LICS.2001.932504","DOIUrl":"https://doi.org/10.1109/LICS.2001.932504","url":null,"abstract":"Dynamic programs, or fixpoint iteration schemes, are useful for solving many problems on state spaces. For Kripke structures, a rich fixpoint theory is available in the form of the /spl mu/-calculus, yet few connections have been made between different interpretations of fixpoint algorithms. We study the question of when a particular fixpoint iteration scheme /spl phi/ for verifying an /spl omega/-regular property /spl Psi/ on a Kripke structure can be used also for solving a two-player game on a game graph with winning objective /spl Psi/. We provide a sufficient and necessary criterion for the answer to be affirmative in the form of an extremal-model theorem for games: under a game interpretation, the dynamic program /spl phi/ solves the game with objective /spl Psi/ iff both (1) under an existential interpretation on Kripke structures, /spl phi/ is equivalent to /spl exist//spl Psi/, and (2) under a universal interpretation on Kripke structures, /spl phi/ is equivalent to /spl forall//spl Psi/. In other words, /spl phi/ is correct on all two-player game graphs iff it is correct on all extremal game graphs, where one or the other player has no choice of moves. The theorem generalizes to quantitative interpretations, where it connects two-player games with costs to weighted graphs. While the standard translations from /spl omega/-regular properties to the /spl mu/-calculus violate (1) or (2), we give a translation that satisfies both conditions. Our construction, therefore, yields fixpoint iteration schemes that can be uniformly applied on Kripke structures, weighted graphs, game graphs, and game graphs with costs, in order to meet or optimize a given /spl omega/-regular objective.","PeriodicalId":366313,"journal":{"name":"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129599195","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}

引用次数: 63

On the decision problem for the guarded fragment with transitivity 具有传递性的保护片段的决策问题

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2001-06-16 DOI: 10.1109/LICS.2001.932491

W. Szwast, Lidia Tendera

引用次数: 37