阵列可拓理论的一个判定程序

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

Aaron Stump, Clark W. Barrett, D. Dill, J. Levitt

{"title":"阵列可拓理论的一个判定程序","authors":"Aaron Stump, Clark W. Barrett, D. Dill, J. Levitt","doi":"10.1109/LICS.2001.932480","DOIUrl":null,"url":null,"abstract":"A decision procedure for a theory of arrays is of interest for applications in formal verification, program analysis and automated theorem proving. This paper presents a decision procedure for an extensional theory of arrays and proves it correct.","PeriodicalId":366313,"journal":{"name":"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"165","resultStr":"{\"title\":\"A decision procedure for an extensional theory of arrays\",\"authors\":\"Aaron Stump, Clark W. Barrett, D. Dill, J. Levitt\",\"doi\":\"10.1109/LICS.2001.932480\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A decision procedure for a theory of arrays is of interest for applications in formal verification, program analysis and automated theorem proving. This paper presents a decision procedure for an extensional theory of arrays and proves it correct.\",\"PeriodicalId\":366313,\"journal\":{\"name\":\"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"165\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.2001.932480\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2001.932480","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 165

摘要

数组理论的决策过程在形式验证、程序分析和自动定理证明等方面具有重要的应用价值。本文给出了阵列可拓理论的一个判定过程，并证明了其正确性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A decision procedure for an extensional theory of arrays

A decision procedure for a theory of arrays is of interest for applications in formal verification, program analysis and automated theorem proving. This paper presents a decision procedure for an extensional theory of arrays and proves it correct.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量