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

1st IEEE International Conference on Cyber-Physical Systems, Networks, and Applications (CPSNA)

作者： King, Andrew L. Feng, Lu Sokolsky, Oleg Lee, Insup Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA

ISBN: (纸本)9781479907984

We present an approach to establish safety of on-demand medical cyber-physical systems which are assembled to treat a patient in a specific clinical scenario. We treat such a system as a virtual medial device (VMD) and propose a model-based framework that includes a modeling language with formal semantics and a medical application platform (MAP) that provides the necessary deployment support for the VMD models.

关键词： medical computing patient treatment programming language semantics safety-critical software virtual reality

来源：评论

学校读者我要写书评

暂无评论

Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes 13

Intensional Type Theory with Guarded Recursive Types qua Fix...

引用

28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS)

作者： Birkedal, Lars Mogelberg, Rasmus Ejlers Aarhus Univ Dept Comp Sci DK-8000 Aarhus C Denmark IT Univ Copenhagen Copenhagen Denmark

ISBN: (纸本)9781479904136

Guarded recursive functions and types are useful for giving semantics to advanced programming languages and for higher-order programming with infinite data types, such as streams, e.g., for modeling reactive systems. We propose an extension of intensional type theory with rules for forming fixed points of guarded recursive functions. Guarded recursive types can be formed simply by taking fixed points of guarded recursive functions on the universe of types. Moreover, we present a general model construction for constructing models of the intensional type theory with guarded recursive functions and types. When applied to the groupoid model of intensional type theory with the universe of small discrete groupoids, the construction gives a model of guarded recursion for which there is a one-to-one correspondence between fixed points of functions on the universe of types and fixed points of (suitable) operators on types. In particular, we find that the functor category Grpd omega(op) from the preordered set of natural numbers to the category of groupoids is a model of intensional type theory with guarded recursive types.

关键词： category theory group theory programming language semantics recursive functions type theory

来源：评论

学校读者我要写书评

暂无评论

Capturing Assertions from Natural language Descriptions

Capturing Assertions from Natural Language Descriptions

引用

1st International Workshop on Natural language Analysis in Software Engineering (NaturaLiSE)

作者： Harris, Ian G. Univ Calif Irvine Dept Comp Sci Irvine CA 92717 USA

ISBN: (纸本)9781467362719

We present a technique to automatically generate formal, executable assertions from natural language assertion descriptions written in English. Assertions are program invariants which are commonly used for result checking in the hardware verification process. We present an attribute grammar which captures the semantics of a subset of English language assertion descriptions. Using the attribute grammar, we parse assertion descriptions and generate semantically equivalent formal models. We have evaluated our technique using a large set of industrial assertion descriptions. We present the successful assertion generation results, as well as the limitations of our approach and methods to address those limitations in the future.

关键词： formal languages formal verification grammars natural language processing programming language semantics

来源：评论

学校读者我要写书评

暂无评论

Verifying bigraphical models of architectural reconfigurations

Verifying bigraphical models of architectural reconfiguratio...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The Negation in the Checklist Paradigm based m₂ Non-Commutative Fuzzy Interval Logic System of Goguen and Gaines

The Negation in the Checklist Paradigm based <i>m</i><sub>2<...

引用

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

作者： Kim, Eunjin Univ N Dakota Dept Comp Sci Grand Forks ND 58202 USA

ISBN: (纸本)9781479903481

This paper continues the study of fuzzy interval logic based on the Checklist Paradigm by Kohout and Bandler. The fuzzy interval system of negation in m(2) Goguen-Gaines's logic is investigated in depth. Since the m(2) interval system of Goguen-Gaine's logic is non-commutative system, the interval negation of m(2) is defined in consideration of the non-commutativity of system. And, the axioms of negation in the m(2) interval system are further investigated.

关键词： fuzzy logic programming language semantics

来源：评论

学校读者我要写书评

暂无评论

Deployment and Scheduling Synthesis for Mixed-Critical Shared-Memory Applications

Deployment and Scheduling Synthesis for Mixed-Critical Share...

引用

20th Annual IEEE International Conference and Workshops on the Engineering of Computer Based Systems (ECBS)

作者： Voss, Sebastian Schaetz, Bernhard Fortiss GmbH D-80805 Munich Germany

ISBN: (纸本)9780769549910

This paper presents an efficient approach for generating suitable system architectures for embedded systems efficiently. Thereby, we focus on a joint generation of schedules and deployment for mixed-criticality multicore architectures using shared memory. The presented approach computes task and message schedules that are optimized with respect to a global discrete time base. As part of the solution, our approach generates an optimized assignment of tasks to computation resources (cores) concerning local memory constraints of cores and criticality constraints of tasks. This approach is integrated into the AUTOFOCUS 3 tool-chain, using a formally defined model of computation with explicit data-flow and discrete-time semantics to develop multi-criticality embedded systems. Our approach relies on a symbolic encoding scheme, based on a system model that is derived from the system architecture. This paper provides a formalization describing the scheduling problem as a satisfiability problem using boolean formulas and linear arithmetic constraints. A state-of-the-art satisfiability modulo theory (SMT) solver is used to compute the joint schedule and deployment for such architectures. This paper demonstrates that state-of-the art satisfiability modulo theory solvers can be used to efficiently compute (safety-oriented) deployments including real-time task and communication schedules for mixed-criticality applications.

关键词： Boolean functions computability embedded systems processor scheduling programming language semantics shared memory systems

来源：评论

学校读者我要写书评

暂无评论

Model-driven approach to developing domain functional requirements in software product lines

引用

IET SOFTWARE 2012年第4期6卷 391-401页

作者： Guo, J. Wang, Y. Zhang, Z. Nummenmaa, J. Niu, N. Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200240 Peoples R China Univ Tampere Sch Informat Sci FIN-33014 Tampere Finland Mississippi State Univ Dept Comp Sci & Engn Mississippi State MS 39762 USA

Existing product requirements form a rich source for domain requirements analysis in software product lines (SPLs). Most existing domain analysis techniques depend on domain experts' experience and manual operation to identify the commonalities and variabilities of product requirements. They often demand a high level of manual effort and a large up-front investment, which can present a prohibitive barrier for SPL adoption. This study proposes a model-driven approach to semi-automatically derive domain functional requirements (DFRs) from product functional requirements (PFRs). Based on the linguistic characterisation of a domain's action-oriented concerns, the authors apply Fillmore's semantic framework to functional requirements and define metamodels for PFRs and DFRs. Functional requirements of existing products are constructed as corresponding PFR models. Following the proposed merging and refinement rules, the authors approach automates the transformation from PFR models into DFR models by merging the same or similar PFRs and analysing their commonality and variability. The resulting DFR models can serve as an initial basis of the SPL. The authors demonstrate the authors approach using an example of a home security system (HSS) SPL and give a preliminary evaluation. The authors approach provides a rigorous model-based support for DFRs development and complements existing domain analysis techniques with less time and effort.

关键词： Software management linguistic characterisation domain functional requirement analysis Formal languages and computational linguistics Software engineering techniques software development management formal verification software product lines domain expert experience PFR metamodel domain action oriented concerns DFR metamodel SPL adoption Formal methods home security system model-driven approach Fillmore's semantic framework up-front investment programming language semantics product functional requirements

来源：评论

学校读者我要写书评

暂无评论

A symbolic analysis framework for static analysis of imperative programming languages

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2012年第6期85卷 1418-1439页

作者： Burgstaller, Bernd Scholz, Bernhard Blieberger, Johann Yonsei Univ Seoul 120749 South Korea Univ Sydney Sydney NSW 2006 Australia Vienna Univ Technol A-1040 Vienna Austria

We present a generic symbolic analysis framework for imperative programming languages. Our framework is capable of computing all valid variable bindings of a program at given program points. This information is invaluable for domain-specific static program analyses such as memory leak detection, program parallelization, and the detection of superfluous bound checks, variable aliases and task deadlocks. We employ path expression algebra to model the control flow information of programs. A homomorphism maps path expressions into the symbolic domain. At the center of the symbolic domain is a compact algebraic structure called supercontext. A supercontext contains the complete control and data flow analysis information valid at a given program point. Our approach to compute supercontexts is based purely on algebra and is fully automated. This novel representation of program semantics closes the gap between program analysis and computer algebra systems, which makes supercontexts an ideal symbolic intermediate representation for all domain-specific static program analyses. Our approach is more general than existing methods because it can derive solutions for arbitrary (even intra-loop and nested loop) nodes of reducible and irreducible control flow graphs. We prove the correctness of our symbolic analysis method. Our experimental results show that the problem sizes arising from real-world applications such as the SPEC95 benchmark suite are tractable for our symbolic analysis framework. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Static program analysis Symbolic analysis Path expression algebra programming language semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：