Pub Date : 2012-12-13DOI: 10.1007/978-3-642-35308-6_4
N. Kobayashi
{"title":"Program Certification by Higher-Order Model Checking","authors":"N. Kobayashi","doi":"10.1007/978-3-642-35308-6_4","DOIUrl":"https://doi.org/10.1007/978-3-642-35308-6_4","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128770870","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}
Pub Date : 2012-12-13DOI: 10.1007/978-3-642-35308-6_21
T. Coquand, Anders Mörtberg, V. Siles
{"title":"Coherent and Strongly Discrete Rings in Type Theory","authors":"T. Coquand, Anders Mörtberg, V. Siles","doi":"10.1007/978-3-642-35308-6_21","DOIUrl":"https://doi.org/10.1007/978-3-642-35308-6_21","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134413768","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}
Pub Date : 2012-12-13DOI: 10.1007/978-3-642-35308-6_14
Keisuke Nakano
{"title":"Shall We Juggle, Coinductively?","authors":"Keisuke Nakano","doi":"10.1007/978-3-642-35308-6_14","DOIUrl":"https://doi.org/10.1007/978-3-642-35308-6_14","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126416835","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}
Pub Date : 2012-12-13DOI: 10.1007/978-3-642-35308-6_18
C. Doczkal, G. Smolka
{"title":"Constructive Completeness for Modal Logic with Transitive Closure","authors":"C. Doczkal, G. Smolka","doi":"10.1007/978-3-642-35308-6_18","DOIUrl":"https://doi.org/10.1007/978-3-642-35308-6_18","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133426216","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}
Pub Date : 2012-12-13DOI: 10.1007/978-3-642-35308-6_7
D. Mulligan, C. Coen
{"title":"On the Correctness of an Optimising Assembler for the Intel MCS-51 Microprocessor","authors":"D. Mulligan, C. Coen","doi":"10.1007/978-3-642-35308-6_7","DOIUrl":"https://doi.org/10.1007/978-3-642-35308-6_7","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130186402","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}
Pub Date : 2011-12-07DOI: 10.1007/978-3-642-25379-9_22
M. Backes, Catalin Hritcu, Thorsten Tarrach
{"title":"Automatically Verifying Typing Constraints for a Data Processing Language","authors":"M. Backes, Catalin Hritcu, Thorsten Tarrach","doi":"10.1007/978-3-642-25379-9_22","DOIUrl":"https://doi.org/10.1007/978-3-642-25379-9_22","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131096227","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}
Pub Date : 2011-12-07DOI: 10.1007/978-3-642-25379-9_12
Michaël Armand, G. Faure, B. Grégoire, C. Keller, L. Théry, Benjamin Werner
{"title":"A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses","authors":"Michaël Armand, G. Faure, B. Grégoire, C. Keller, L. Théry, Benjamin Werner","doi":"10.1007/978-3-642-25379-9_12","DOIUrl":"https://doi.org/10.1007/978-3-642-25379-9_12","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128889821","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}
Pub Date : 2011-12-07DOI: 10.1007/978-3-642-25379-9_7
V. Voevodsky
{"title":"Univalent Semantics of Constructive Type Theories","authors":"V. Voevodsky","doi":"10.1007/978-3-642-25379-9_7","DOIUrl":"https://doi.org/10.1007/978-3-642-25379-9_7","url":null,"abstract":"","PeriodicalId":129494,"journal":{"name":"Certified Programs and Proofs","volume":"365 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121378035","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：