发布求助
文献互助 智能选刊 最新文献

J. Log. Algebraic Methods Program.最新文献

筛选
英文 中文
Liquidity Analysis in Resource-Aware Programming 资源感知规划中的流动性分析
J. Log. Algebraic Methods Program. Pub Date : 2023-10-01 DOI: 10.1007/978-3-031-20872-0_12
Silvia Crafa, C. Laneve
{"title":"Liquidity Analysis in Resource-Aware Programming","authors":"Silvia Crafa, C. Laneve","doi":"10.1007/978-3-031-20872-0_12","DOIUrl":"https://doi.org/10.1007/978-3-031-20872-0_12","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130523205","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}
引用次数: 1
An Efficient Canonical Narrowing Implementation with Irreducibility and SMT Constraints for Generic Symbolic Protocol Analysis 通用符号协议分析中一种具有不可约性和SMT约束的高效规范缩窄实现
J. Log. Algebraic Methods Program. Pub Date : 2023-07-01 DOI: 10.48550/arXiv.2307.06348
Ra'ul L'opez-Rueda, Santiago Escobar, J. Sapiña
{"title":"An Efficient Canonical Narrowing Implementation with Irreducibility and SMT Constraints for Generic Symbolic Protocol Analysis","authors":"Ra'ul L'opez-Rueda, Santiago Escobar, J. Sapiña","doi":"10.48550/arXiv.2307.06348","DOIUrl":"https://doi.org/10.48550/arXiv.2307.06348","url":null,"abstract":"Narrowing and unification are very useful tools for symbolic analysis of rewrite theories, and thus for any model that can be specified in that way. A very clear example of their application is the field of formal cryptographic protocol analysis, which is why narrowing and unification are used in tools such as Maude-NPA, Tamarin and Akiss. In this work we present the implementation of a canonical narrowing algorithm, which improves the standard narrowing algorithm, extended to be able to process rewrite theories with conditional rules. The conditions of the rules will contain SMT constraints, which will be carried throughout the execution of the algorithm to determine if the solutions have associated satisfiable or unsatisfiable constraints, and in the latter case, discard them.","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115337093","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}
引用次数: 1
Formal lumping of polynomial differential equations through approximate equivalences 通过近似等价的多项式微分方程的形式集总
J. Log. Algebraic Methods Program. Pub Date : 2023-05-01 DOI: 10.2139/ssrn.4160059
L. Cardelli, G. Squillace, M. Tribastone, Max Tschaikowski, Andrea Vandin
{"title":"Formal lumping of polynomial differential equations through approximate equivalences","authors":"L. Cardelli, G. Squillace, M. Tribastone, Max Tschaikowski, Andrea Vandin","doi":"10.2139/ssrn.4160059","DOIUrl":"https://doi.org/10.2139/ssrn.4160059","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130341080","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}
引用次数: 0
Evaluation Diversity for Graph Conditions 图条件的评价多样性
J. Log. Algebraic Methods Program. Pub Date : 2023-03-01 DOI: 10.1007/978-3-030-78946-6_7
Sven Schneider, Leen Lambers
{"title":"Evaluation Diversity for Graph Conditions","authors":"Sven Schneider, Leen Lambers","doi":"10.1007/978-3-030-78946-6_7","DOIUrl":"https://doi.org/10.1007/978-3-030-78946-6_7","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130105516","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}
引用次数: 2
Host-Graph-Sensitive RETE Nets for Incremental Graph Pattern Matching 增量图模式匹配的主机图敏感RETE网络
J. Log. Algebraic Methods Program. Pub Date : 2023-02-01 DOI: 10.1007/978-3-030-78946-6_8
Matthias Barkowsky, H. Giese
{"title":"Host-Graph-Sensitive RETE Nets for Incremental Graph Pattern Matching","authors":"Matthias Barkowsky, H. Giese","doi":"10.1007/978-3-030-78946-6_8","DOIUrl":"https://doi.org/10.1007/978-3-030-78946-6_8","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115399482","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}
引用次数: 2
A memory-related vulnerability detection approach based on vulnerability model with Petri Net 基于Petri网漏洞模型的内存相关漏洞检测方法
J. Log. Algebraic Methods Program. Pub Date : 2023-02-01 DOI: 10.2139/ssrn.4160060
Jinfu Chen, Chi Zhang, Saihua Cai, Lin Zhang, Liang Ma
{"title":"A memory-related vulnerability detection approach based on vulnerability model with Petri Net","authors":"Jinfu Chen, Chi Zhang, Saihua Cai, Lin Zhang, Liang Ma","doi":"10.2139/ssrn.4160060","DOIUrl":"https://doi.org/10.2139/ssrn.4160060","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129890186","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}
引用次数: 2
Decomposing Monolithic Processes in a Process Algebra with Multi-actions 用多动作进程代数分解整体进程
J. Log. Algebraic Methods Program. Pub Date : 2021-10-01 DOI: 10.4204/EPTCS.347.4
M. Laveaux, T. Willemse
{"title":"Decomposing Monolithic Processes in a Process Algebra with Multi-actions","authors":"M. Laveaux, T. Willemse","doi":"10.4204/EPTCS.347.4","DOIUrl":"https://doi.org/10.4204/EPTCS.347.4","url":null,"abstract":"A monolithic process is a single recursive equation with data parameters, which only uses non-determinism, action prefixing, and recursion. We present a technique that decomposes such a monolithic process into multiple processes where each process defines behaviour for a subset of the parameters of the monolithic process. For this decomposition we can show that a composition of these processes is strongly bisimilar to the monolithic process under a suitable synchronisation context. Minimising the resulting processes before determining their composition can be used to derive a state space that is smaller than the one obtained by a monolithic exploration. We apply the decomposition technique to several specifications to show that this works in practice. Finally, we prove that state invariants can be used to further improve the effectiveness of this decomposition technique.","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126384552","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}
引用次数: 1
A Semantic Model for Interacting Cyber-Physical Systems 信息物理系统交互的语义模型
J. Log. Algebraic Methods Program. Pub Date : 2021-06-29 DOI: 10.4204/EPTCS.347.5
Benjamin Lion, Farhad Arbab, Carolyn L. Talcott
{"title":"A Semantic Model for Interacting Cyber-Physical Systems","authors":"Benjamin Lion, Farhad Arbab, Carolyn L. Talcott","doi":"10.4204/EPTCS.347.5","DOIUrl":"https://doi.org/10.4204/EPTCS.347.5","url":null,"abstract":"We propose a component-based semantic model for Cyber-Physical Systems (CPSs) wherein the notion of a component abstracts the internal details of both cyber and physical processes, to expose a uniform semantic model of their externally observable behaviors expressed as sets of sequences of observations. We introduce algebraic operations on such sequences to model different kinds of component composition. These composition operators yield the externally observable behavior of their resulting composite components through specifications of interactions of the behaviors of their constituent components, as they, e.g., synchronize with or mutually exclude each other's alternative behaviors. Our framework is expressive enough to allow articulation of properties that coordinate desired interactions among composed components within the framework, also as component behavior. We demonstrate the usefulness of our formalism through examples of coordination properties in a CPS consisting of two robots interacting through shared physical resources.","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123259353","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}
引用次数: 12
Replacement freeness: A criterion for separating process calculi 替换自由度:分离过程演算的一个准则
J. Log. Algebraic Methods Program. Pub Date : 2020-11-01 DOI: 10.1016/j.jlamp.2020.100579
R. Pugliese, F. Tiezzi
{"title":"Replacement freeness: A criterion for separating process calculi","authors":"R. Pugliese, F. Tiezzi","doi":"10.1016/j.jlamp.2020.100579","DOIUrl":"https://doi.org/10.1016/j.jlamp.2020.100579","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120407238","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}
引用次数: 1
An Abstract Framework for Choreographic Testing 编排测试的抽象框架
J. Log. Algebraic Methods Program. Pub Date : 2020-09-17 DOI: 10.4204/EPTCS.324.5
Alex Coto, R. Guanciale, E. Tuosto
{"title":"An Abstract Framework for Choreographic Testing","authors":"Alex Coto, R. Guanciale, E. Tuosto","doi":"10.4204/EPTCS.324.5","DOIUrl":"https://doi.org/10.4204/EPTCS.324.5","url":null,"abstract":"We initiate the development of a model-driven testing framework for message-passing systems. The notion of test for communicating systems cannot simply be borrowed from existing proposals. Therefore, we formalize a notion of suitable distributed tests for a given choreography and devise an algorithm that generates tests as projections of global views. Our algorithm abstracts away from the actual projection operation, for which we only set basic requirements. The algorithm can be instantiated by reusing existing projection operations (designed to generate local implementations of global models) as they satisfy our requirements. Finally, we show the correctness of the approach and validate our methodology via an illustrative example.","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128670043","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}
引用次数: 6
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书