{"title":"Instruction Sequence Faults with Formal Change Justification","authors":"J. Bergstra","doi":"10.7561/sacs.2020.2.105","DOIUrl":"https://doi.org/10.7561/sacs.2020.2.105","url":null,"abstract":"The notion of an instruction sequence fault is considered as a theoretical concept, for which the justification of the qualification of a fragment as faulty is mathematical instead of pragmatic, the latter approach being much more common. Starting from so-called Laski faults a range of patterns of faults and changes thereof for instruction sequences is developed.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115482604","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}
Lukasz Mikulski, Marcin Piatkowski, Sebastian Smyczynski
{"title":"Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended)","authors":"Lukasz Mikulski, Marcin Piatkowski, Sebastian Smyczynski","doi":"10.7561/SACS.2013.2.229","DOIUrl":"https://doi.org/10.7561/SACS.2013.2.229","url":null,"abstract":"It is natural to try to relate partially ordered sets (posets in short) and classes of equivalent words over partially commutative alphabets. Their common graphical representation are Hasse diagrams. We will investigate this relation in detail and propose an efficient on-line algorithm that decompresses a string to Hasse diagram. Further we propose a definition of the canonical representatives of classes of equivalent words. The advantage of this representation lies in the fact that we can enumerate the classes of equivalent words in a lexicographical order. We will give an algorithm which enumerates all distinct classes of words over partially commutative alphabets by their lexicographically minimal representatives.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131598290","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}
{"title":"Theoretical Aspects of Computing","authors":"Gabriel Ciobanu","doi":"10.7561/SACS.2014.2.173","DOIUrl":"https://doi.org/10.7561/SACS.2014.2.173","url":null,"abstract":"The International Colloquium on Theoretical Aspects of Computing was founded in 2004. In 2014, the 11th International Colloquium on Theoretical Aspects of Computing was for the first time organized in Europe, namely in Bucharest, Romania. Since its early days, the study of computer science in Romania has had a strong theoretical component, owing in part to the mathematical orientation of some of its most notable pioneers, such as Grigore Moisil. In modern times, this legacy is carried on by some strong research institutions, such as Romanian Academy and main universities in Iaşi, Bucharest and Timişoara.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132586106","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号
