Pub Date : 2000-04-02DOI: 10.1007/3-540-46425-5_11
M. Hofmann
{"title":"A Type System for Bounded Space and Functional In-Place Update","authors":"M. Hofmann","doi":"10.1007/3-540-46425-5_11","DOIUrl":"https://doi.org/10.1007/3-540-46425-5_11","url":null,"abstract":"","PeriodicalId":114503,"journal":{"name":"Nord. J. Comput.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124146457","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 : 2000-04-02DOI: 10.1007/3-540-46425-5_23
H. Seidl, B. Steffen
{"title":"Constraint-Based Inter-Procedural Analysis of Parallel Programs","authors":"H. Seidl, B. Steffen","doi":"10.1007/3-540-46425-5_23","DOIUrl":"https://doi.org/10.1007/3-540-46425-5_23","url":null,"abstract":"","PeriodicalId":114503,"journal":{"name":"Nord. J. Comput.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122369419","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}
The ambient calculus is a calculus of computation that allows active processes to move between sites. We present an analysis inspired by state-of-the-art pointer analyses that safety and accurately predicts which processes may turn up at what sites during the execution of a composite system. The analysis models sets of processes by sets of regular tree grammars enhanced with context-dependent counts, and it obtains its precision by combining a powerful redex materialisation with a strong redex reduction (in the manner of the strong updates performed in pointer analyses). The underlying ideas are flexible and scale up to general tree structures admitting powerful restructuring operations.
{"title":"Shape analysis for mobile ambients","authors":"H. R. Nielson, F. Nielson","doi":"10.1145/325694.325711","DOIUrl":"https://doi.org/10.1145/325694.325711","url":null,"abstract":"The ambient calculus is a calculus of computation that allows active processes to move between sites. We present an analysis inspired by state-of-the-art pointer analyses that safety and accurately predicts which processes may turn up at what sites during the execution of a composite system. The analysis models sets of processes by sets of regular tree grammars enhanced with context-dependent counts, and it obtains its precision by combining a powerful redex materialisation with a strong redex reduction (in the manner of the strong updates performed in pointer analyses). The underlying ideas are flexible and scale up to general tree structures admitting powerful restructuring operations.","PeriodicalId":114503,"journal":{"name":"Nord. J. Comput.","volume":"18 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130995783","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":"Distribution-Sensitive Algorithms","authors":"Sandeep Sen, Neelima Gupta","doi":"10.1007/BFb0054380","DOIUrl":"https://doi.org/10.1007/BFb0054380","url":null,"abstract":"","PeriodicalId":114503,"journal":{"name":"Nord. J. Comput.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126657659","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 : 1998-06-16DOI: 10.7146/BRICS.V5I46.19491
K. Larsen, J. Pearson, Carsten Weise, W. Yi
In this paper, we present Clock Difference Diagrams (CDD), a new BDD-like data-structure for effective representation and manipulation of certain non-convex subsets of the Euclidean space, notably those encountered in verification of timed automata. It is shown that all set-theoretic operations including inclusion checking may be carried out efficiently on Clock Difference Diagrams. Other clock operations needed for fully symbolic analysis of timed automata e.g. future- and reset-operations, can be obtained based on a so-called tight normalform for CDD. A version of the real-time verification tool UPPAAL using Clock Difference Diagrams as the main data-structure has been implemented. Experimental results demonstrate significant space-savings: for nine industrial examples the savings are in average 42% with moderate increase in runtime.
{"title":"Clock Difference Diagrams","authors":"K. Larsen, J. Pearson, Carsten Weise, W. Yi","doi":"10.7146/BRICS.V5I46.19491","DOIUrl":"https://doi.org/10.7146/BRICS.V5I46.19491","url":null,"abstract":"In this paper, we present Clock Difference Diagrams (CDD), a new BDD-like data-structure for effective representation and manipulation of certain non-convex subsets of the Euclidean space, notably those encountered in verification of timed automata. It is shown that all set-theoretic operations including inclusion checking may be carried out efficiently on Clock Difference Diagrams. Other clock operations needed for fully symbolic analysis of timed automata e.g. future- and reset-operations, can be obtained based on a so-called tight normalform for CDD. A version of the real-time verification tool UPPAAL using Clock Difference Diagrams as the main data-structure has been implemented. Experimental results demonstrate significant space-savings: for nine industrial examples the savings are in average 42% with moderate increase in runtime.","PeriodicalId":114503,"journal":{"name":"Nord. J. Comput.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128310764","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":"A Bisimulation Method for Cryptographic Protocols","authors":"M. Abadi, A. Gordon","doi":"10.1007/BFb0053560","DOIUrl":"https://doi.org/10.1007/BFb0053560","url":null,"abstract":"","PeriodicalId":114503,"journal":{"name":"Nord. J. Comput.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122158138","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":"Building a Bridge between Pointer Aliases and Program Dependences","authors":"John L. Ross, Shmuel Sagiv","doi":"10.1007/BFb0053573","DOIUrl":"https://doi.org/10.1007/BFb0053573","url":null,"abstract":"","PeriodicalId":114503,"journal":{"name":"Nord. J. Comput.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132817776","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 : 1997-09-15DOI: 10.1007/3-540-63397-9_26
D. Krznaric, C. Levcopoulos, Bengt J. Nilsson
{"title":"Minimum Spanning Trees in d Dimensions","authors":"D. Krznaric, C. Levcopoulos, Bengt J. Nilsson","doi":"10.1007/3-540-63397-9_26","DOIUrl":"https://doi.org/10.1007/3-540-63397-9_26","url":null,"abstract":"","PeriodicalId":114503,"journal":{"name":"Nord. J. Comput.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131622253","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":"Higher-Order Value Flow Graphs","authors":"C. Mossin","doi":"10.1007/BFb0033843","DOIUrl":"https://doi.org/10.1007/BFb0033843","url":null,"abstract":"","PeriodicalId":114503,"journal":{"name":"Nord. J. Comput.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130906258","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
扫码关注我们
求助内容：
应助结果提醒方式：