International Workshop on Rule-Based Programming最新文献

An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications 基于关系代数规范生成数据库事务的改进算法

International Workshop on Rule-Based Programming Pub Date : 2010-03-28 DOI: 10.4204/EPTCS.21.7

Daniel J. Dougherty

引用次数: 2

Automatic Generation of Proof Tactics for Finite-Valued Logics 有限值逻辑证明策略的自动生成

International Workshop on Rule-Based Programming Pub Date : 2010-03-24 DOI: 10.4204/EPTCS.21.8

J. Martin Marcos

引用次数: 11

Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems 项重写系统抽象的时间正则性验证

International Workshop on Rule-Based Programming Pub Date : 2010-03-24 DOI: 10.4204/EPTCS.21.9

B. Boyer, T. Genet

{"title":"Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems","authors":"B. Boyer, T. Genet","doi":"10.4204/EPTCS.21.9","DOIUrl":"https://doi.org/10.4204/EPTCS.21.9","url":null,"abstract":"The tree automaton completion is an algorithm used for proving safety properties of systems that can be modeled by a term rewriting system. This representation and verification technique works well for proving properties of infinite systems like cryptog raphic protocols or more recently on Java Bytecode programs. This algorithm computes a tree automaton which represents a (regular) over approximation of the set of reachable terms by rewriting initial terms. This approach is limited by the lack of information about rewriting relation between terms. Actually, terms in relation by rewriting are in the same equivalence class: there are recognized by the same state in the tree automaton. Our objective is to produce an automaton embedding an abstraction of the rewriting relation sufficient to prove temporal properties of the term rewritin g system. We propose to extend the algorithm to produce an automaton having more equivalence classes to distinguish a term or a subterm from its successors w.r.t. rewriting. While ground transitions are used to recognize equivalence classes of terms, e-transitions represent the rewriting relation between terms. From the completed automaton, it is possible to automatically build a Kripke structure abstracting the rewriting sequence. States of the Kripke stru cture are states of the tree automaton and the transition relation is given by the set of e-transitions. States of the Kripke structure are labelled b y the set of terms recognized using ground transitions. On this Kripke structure, we define the Regular Linear Temporal Logic (R-LTL) for expressing properties. Such properties can then be checked using standard model checking algorithms. The only difference between LTL and R-LTL is that predicates are replaced by regular sets of acceptable terms.","PeriodicalId":372177,"journal":{"name":"International Workshop on Rule-Based Programming","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129086415","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

Object-oriented Programming Laws for Annotated Java Programs 注释Java程序的面向对象编程法则

International Workshop on Rule-Based Programming Pub Date : 2010-03-24 DOI: 10.4204/EPTCS.21.6

Gabriel Falconieri Freitas, Márcio Cornélio, T. Massoni, Rohit Gheyi

引用次数: 2

The Semantics of Graph Programs 图程序的语义

International Workshop on Rule-Based Programming Pub Date : 2010-03-23 DOI: 10.4204/EPTCS.21.3

D. Plump, Sandra Steinert

引用次数: 21

Modeling and Reasoning over Distributed Systems using Aspect-Oriented Graph Grammars 使用面向方面的图语法对分布式系统建模和推理

International Workshop on Rule-Based Programming Pub Date : 2010-03-22 DOI: 10.4204/EPTCS.21.4

Rodrigo Machado, R. Heckel, L. Ribeiro

引用次数: 3

Graph Creation, Visualisation and Transformation 图形创建，可视化和转换

International Workshop on Rule-Based Programming Pub Date : 2010-03-22 DOI: 10.4204/EPTCS.21.1

M. Fernández, Olivier Namet

引用次数: 0

An Implementation of Nested Pattern Matching in Interaction Nets 交互网络中嵌套模式匹配的实现

International Workshop on Rule-Based Programming Pub Date : 2010-03-01 DOI: 10.4204/EPTCS.21.2

Abubakar Hassan, Eugen Jiresch, Shinya Sato

引用次数: 6

A Type System for Tom 汤姆的打字系统

International Workshop on Rule-Based Programming Pub Date : 2009-06-28 DOI: 10.4204/EPTCS.21.5

C. Kirchner, Pierre-Etienne Moreau, Cláudia Tavares

{"title":"A Type System for Tom","authors":"C. Kirchner, Pierre-Etienne Moreau, Cláudia Tavares","doi":"10.4204/EPTCS.21.5","DOIUrl":"https://doi.org/10.4204/EPTCS.21.5","url":null,"abstract":"Extending a given language with new dedicated features is a general and quite used approach to make the programming language more adapted to problems. Being closer to the application, this leads to less programming flaws and easier maintenance. But of course one would still like to perform program analysis on these kinds of extended languages, in particular type checking and inference. In this case one has to make the typing of the extended features compatible with the ones in the starting language. \u0000The Tom programming language is a typical example of such a situation as it consists of an extension of Java that adds pattern matching, more particularly associative pattern matching, and reduction strategies. \u0000This paper presents a type system with subtyping for Tom, that is compatible with Java's type system, and that performs both type checking and type inference. We propose an algorithm that checks if all patterns of a Tom program are well-typed. In addition, we propose an algorithm based on equality and subtyping constraints that infers types of variables occurring in a pattern. Both algorithms are exemplified and the proposed type system is showed to be sound and complete.","PeriodicalId":372177,"journal":{"name":"International Workshop on Rule-Based Programming","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130700690","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}

引用次数: 8

An asynchronous rule-based approach for business process automation using obligations 使用义务实现业务流程自动化的基于异步规则的方法

International Workshop on Rule-Based Programming Pub Date : 2002-10-05 DOI: 10.1145/570186.570195

A. Abrahams, D. Eyers, J. Bacon

引用次数: 29