检索结果-内蒙古大学图书馆

7th International Symposium on Theoretical Aspects of Software Engineering (TASE)

作者： Sanchez, Alejandro Soares Barbosa, Luis Riesco, Daniel Univ Nacl San Luis Dept Informat San Luis Argentina Univ Minho INESC TEC HASLab Braga Portugal

ISBN: (纸本)9780769550534

ARCHERY is an architectural description language for modelling and reasoning about distributed, heterogeneous and dynamically reconfigurable systems. This paper proposes a structural semantics for ARCHERY, and a method for deriving labelled transition systems (LTS) in which states and transitions represent configurations and reconfiguration operations, respectively. Architectures are modelled by bigraphs and their dynamics by parametric reaction rules. The resulting LTSs can be regarded as Kripke frames, appropriate for verifying reconfiguration constraints over architectural patterns expressed in a modal logic. The derivation method proposed here applies the approach in [1] twice, and combines the results of each application to obtain a label representing a reconfiguration operation and its actual parameters. Labels obtained in this way are minimal and yield LTSs in which bisimulation is a congruence.

关键词： bisimulation equivalence formal specification formal verification graph grammars programming language semantics reasoning about programs software architecture specification languages

来源：评论

学校读者我要写书评

暂无评论

On Semantic Issues in Game-theoretic Rough Sets

On Semantic Issues in Game-theoretic Rough Sets

引用

Joint World Congress of the International-Fuzzy-Systems-Association (IFSA) / Annual Meeting of the North-American-Fuzzy-Information-Processing-Society (NAFIPS)

作者： Azam, Nouman Yao, JingTao Univ Regina Dept Comp Sci Regina SK S4S 0A2 Canada

ISBN: (纸本)9781479903481

The game-theoretic rough set (GTRS) model provides a configuration mechanism for determination of thresholds in probabilistic rough sets. The GTRS utilizes different approaches in implementing games for analyzing various applications and problems. The probabilistic thresholds and the key game components such as players and strategies may be interpreted differently based on a particular formulation and the considered application. This paper examines and considers two semantic issues in GTRS, i.e. the interpretation of key game-theoretic constructs and probabilistic thresholds. We address these issues by presenting some semantic descriptions that not only help in understanding the structural components of the model but also clarify the mechanism of transforming an initial pair of thresholds to a finally computed threshold values. An example is provided based on the proposed descriptions in explaining existing formulations.

关键词： game theory probability programming language semantics rough set theory

来源：评论

学校读者我要写书评

暂无评论

An experimental study into the default reading of constraint diagrams

An experimental study into the default reading of constraint...

引用

IEEE Symposium on Visual languages and Human-Centric Computing

作者： Fish, A Masthoff, J Univ Brighton Brighton BN2 4AT E Sussex England

ISBN: (纸本)0769524435

Constraint diagrams (Kent, 1997) are a complex diagrammatic notation designed to express logical statements especially for use in software specification and reasoning. Not surprisingly, since this is an expressive language, there are some difficulties in reading the semantics of a diagram unambiguously. Some extra annotations (in the form of a reading tree) disambiguate the diagrams. However, this extra requirement (of drawing a reading tree) places a burden on the user. An attempt to remove the need for such a reading tree (or perhaps to automatically generate a reading tree, which could be altered by a user if they wished to) has been given via an algorithm to generate a default reading from the diagram. This algorithm is based on a number of principles - most of which are properties of the diagram. We wish to know whether these principles are intuitive and whether the default reading reflects a good proportion of users' intuitions, and we have performed a user-based study to test this.

关键词： formal specification programming language semantics constraint diagrams diagrammatic notation logical statement reading tree software reasoning software specification

来源：评论

学校读者我要写书评

暂无评论

A lambda-calculus model of programming languages-II. Jumps and procedures

引用

Computer languages 1975年第4期1卷 303-320页

作者： Abdali, S.Kamal Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy NY 12181 United States

The correspondence between programming languages and the lambda-calculus presented in Part I of the paper is extended here to include iteration statements, jumps, and procedures. Programs containing loops are represented by lambda-expressionswhose components are specified recursively by means of systems of simultaneous conversion relations. The representation of call-by-name and side-effects in a program is accomplished without any resort to the concepts of memory and address by making use of a number of variables in addition to those declared by the programs;with the aid of these additional variables, the parameter linkage operations can be simulated by pure substitution. The applicability of the model to the problems of proving program correctness and equivalence is demonstrated by means of examples. © 1976.

关键词： Call-by-name Equivalence of Programs Jumps Lambda-Calculus Parameters Procedures Program Correctness programming language semantics Side-effects

来源：评论

学校读者我要写书评

暂无评论

Sequential Specification of Time-aware Stream Processing Applications (Extended Abstract)

Sequential Specification of Time-aware Stream Processing App...

引用

10th IEEE Symposium on Embedded Systems for Real-Time Multimedia (ESTIMedia)

作者： Geuns, Stefan J. Hausmans, Joost P. H. M. Bekooij, Marco J. G. Univ Twente NL-7500 AE Enschede Netherlands

ISBN: (纸本)9781467349673

This paper introduces language constructs with temporal semantics to NLPs. Using these language constructs, time dependent applications can be specified and a corresponding data-driven implementation can be generated for use on a multi-core system. Despite that these time-aware language constructs can be data-dependent, the application remains functionally deterministic. Pipelining is exploited to increase the throughput of an application.

关键词： multiprocessing systems pipeline processing programming language semantics

来源：评论

学校读者我要写书评

暂无评论

Desynchronization: From Macro-step to Micro-step 18

Desynchronization: From Macro-step to Micro-step

引用

16th ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)

作者： Bai, Yu Hebei Univ Sci & Technol Yuxiangjie 26 Shijiazhuang 050018 Hebei Peoples R China

ISBN: (纸本)9781538661956

Desynchronization is a central technique for the deployment of synchronous models in distributed environments. In the past decade, various notions of desynchronization as well as concurrency of synchronous systems have been developed. However most works consider only the macro-step semantics of the synchronous systems, therefore are not applicable to those with micro-step semantics like Esterel and Statechart. In particular, macro-step notations lack of the capability to describe deadlocks which are available only via micro-step level modeling. In this paper, we present a desynchronization framework that covers both abstract levels of macro-step and micro-step. In particular, we use labeled transition system to model the operational semantics of general process networks, and further developed the macro-step synchronous modeling. Based on this notion, each transition relation is further decorated with causal pre-orders to model micro-steps within a macro-step, which are then explicitly modeled as transition relations after a desynchronization transformation. Based on this framework, we re-examined some previous macro-step level desynchronization techniques and established new theories that are necessary for their micro-step level adaptation.

关键词： formal specification programming language semantics specification languages synchronisation programming language semantics specification description language Formal specifications semantics semiotics Esterel synchronous system Dosage Form Not Applicable

来源：评论

学校读者我要写书评

暂无评论

Three criteria for designing computing systems to facilitate debugging

引用

Communications of the ACM 1968年第5期11卷 360-365页

作者： Horn, Earl C. General Electric CO. Phoenix AZ United States

来源：评论

学校读者我要写书评

暂无评论

Query Answering over Fact Bases in Fuzzy Propositional Logic

Query Answering over Fact Bases in Fuzzy Propositional Logic

引用

Joint World Congress of the International-Fuzzy-Systems-Association (IFSA) / Annual Meeting of the North-American-Fuzzy-Information-Processing-Society (NAFIPS)

作者： Plesniewicz, Gerald S. Moscow Power Engn Inst Dept Appl Math Moscow 111250 Russia

Let L be a fuzzy propositional logic based on triangular norm min(x,y) (Zadeh's logic). A fact in L is an expression of the form r r and not true E vertical bar= r <= phi <= s' with s' < s. A fac... 详细信息

ISBN: (纸本)9781479903481

Let L be a fuzzy propositional logic based on triangular norm min(x,y) (Zadeh's logic). A fact in L is an expression of the form r <= phi <= s where phi is an element of L and 0 <= r <= s <= 1. In fuzzy interpretation I of L every fact is true or false, and I(r <= phi <= s) = 1 if and only if the two-side inequality r <= I(phi) <= s is satisfied. Thus, the set FL of all facts defines a crisp logic with fuzzy interpretations. Logical consequence "vertical bar=" in the logic FL is defined as usual: for any set E of facts and any fact alpha, E vertical bar= alpha if there are no an interpretation I and a fact beta is an element of E such that I(alpha) = 1 and I(beta p) = 0.. But in the logic FL there is also strong logical consequence vertical bar=*: E vertical bar=* r <= phi <= s if E vertical bar= r <= phi <= s and it is not true that E vertical bar= r' <= phi <= s with r' > r and not true E vertical bar= r <= phi <= s' with s' < s. A fact base is a finite set F of facts: F ={r(i) <= phi(i) <= s(i) vertical bar 1 <= i <= n}. One can consider the set K ={phi(i) vertical bar 1 <= i <= n} as a fuzzy knowledge base and F as an instance of K A query is an expression of the form ?psi where psi is an element of L The answer to the query to the fact base F is the fact r <= psi <= s such that F vertical bar=* r <= psi <= s. The problem of query answering over fact bases in FL can be solved by analytical tableaux method. The method results in an algorithm with the exponential worst-case estimate (relatively to the size of F boolean OR {kappa} where kappa is a query). However, consider the situation when the knowledge base K and the query kappa are fixed but fact bases F are arbitrary instances of K Then, it is possible to answer query kappa to fact bases F quickly. But preliminary we should deal with the parametric fact base associated with K Under a parametric fact we mean an expression of the form a <= phi <= b where a and b are not numbers but parameters - variables with va

关键词： fuzzy logic fuzzy set theory programming language semantics query processing

来源：评论

学校读者我要写书评

暂无评论

A Structured Text to MISRA-C Translator and Issues with IEC 61131-3 Standard

A Structured Text to MISRA-C Translator and Issues with IEC ...

引用

17th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Kabra, Ashutosh Karmakar, Gopinath Patil, R. K. Bhabha Atom Res Ctr Reactor Control Div Mumbai 400085 Maharashtra India

ISBN: (纸本)9781467347372

Programmable Controllers (PLC) are being increasingly used in control systems for Nuclear Power Plants. A PLC, qualified for safety applications, is attractive because it saves a lot of time in verification and validation effort as compared to development of embedded control systems. We developed a tool, ST to MISRA-C translator, required for developing application program using Structured Text (ST) in a qualified PLC. The syntax and semantics of ST programming language is defined in the IEC 61131-3 standard. During the development of the translator, we found some issues with ST language syntax and semantics not pointed out by other researchers. These issues are discussed in this paper along with proposed changes in the ST language grammar for its unambiguous parsing.

关键词： application program interfaces fission reactor safety grammars nuclear power stations program compilers program interpreters programmable controllers programming language semantics structured programming

来源：评论

学校读者我要写书评

暂无评论

Transformation of UML state machines for direct execution

Transformation of UML state machines for direct execution

引用

IEEE Symposium on Visual languages and Human-Centric Computing

作者： Schattkowsky, T Müller, W Paderborn Univ C LAB Paderborn Germany

ISBN: (纸本)0769524435

Executable UML models (ire nowadays gaining interest in embedded systems design. This domain is strongly devoted to the modeling of reactive behavior using StateChart variants. In this context, the direct execution of UML State Machines is an interesting alternative to native code generation approaches since it significantly increases portability. However, fully featured UML 2.0 State Machines may contain a broad set of features with complex execution semantics that differ significantly from other StateChart variants. This makes their direct execution complex and inefficient. In this paper, we demonstrate how such State Machines can be represented using a small subset of the UML State Machine features that enables efficient execution. We describe the necessary model transformations in terms of graph transformations and discuss the underlying semantics and implications for execution.

关键词： Unified Modeling language embedded systems formal specification graph grammars program compilers programming language semantics software portability systems analysis StateChart variants UML state machine transformation code generation direct execution em

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：