{"title":"有限支持数学中的静态分析","authors":"A. Alexandru, Gabriel Ciobanu","doi":"10.1109/SYNASC.2015.56","DOIUrl":null,"url":null,"abstract":"Finitely Supported Mathematics represents the Zermelo-Fraenkel mathematics reformulated in the frameworkof invariant sets. We develop a theory of abstract interpretationswhich is consistent to the principles of constructingthe Finitely Supported Mathematics. We first translate thenotions of lattices and Galois connections into the frameworkof invariant sets, and then present their properties in termsof finitely supported objects. Later, we introduce the notionsof invariant correctness relation and invariant representationfunction, we emphasize an equivalence between them, and weestablish the relationship between these notions and invariantGalois connections. Finally, we provide some widening andnarrowing techniques in order to approximate the least fixedpoints of finitely supported transition functions.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"59 1","pages":"312-319"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Static Analysis in Finitely Supported Mathematics\",\"authors\":\"A. Alexandru, Gabriel Ciobanu\",\"doi\":\"10.1109/SYNASC.2015.56\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finitely Supported Mathematics represents the Zermelo-Fraenkel mathematics reformulated in the frameworkof invariant sets. We develop a theory of abstract interpretationswhich is consistent to the principles of constructingthe Finitely Supported Mathematics. We first translate thenotions of lattices and Galois connections into the frameworkof invariant sets, and then present their properties in termsof finitely supported objects. Later, we introduce the notionsof invariant correctness relation and invariant representationfunction, we emphasize an equivalence between them, and weestablish the relationship between these notions and invariantGalois connections. Finally, we provide some widening andnarrowing techniques in order to approximate the least fixedpoints of finitely supported transition functions.\",\"PeriodicalId\":6488,\"journal\":{\"name\":\"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"59 1\",\"pages\":\"312-319\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2015.56\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2015.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finitely Supported Mathematics represents the Zermelo-Fraenkel mathematics reformulated in the frameworkof invariant sets. We develop a theory of abstract interpretationswhich is consistent to the principles of constructingthe Finitely Supported Mathematics. We first translate thenotions of lattices and Galois connections into the frameworkof invariant sets, and then present their properties in termsof finitely supported objects. Later, we introduce the notionsof invariant correctness relation and invariant representationfunction, we emphasize an equivalence between them, and weestablish the relationship between these notions and invariantGalois connections. Finally, we provide some widening andnarrowing techniques in order to approximate the least fixedpoints of finitely supported transition functions.