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

13th international conference on theorem Proving in Higher Order logics, TPHOLs 2000

作者： Laibinis, Linas Wright, Joakim Von Lemminkaisenkatu 14 TurkuFIN-20520 Finland

ISBN: (纸本)9783540678632

In this paper we present an approach for modelling functional procedures (as they occur in imperative programming languages) in a weakest precondition framework. Functional procedures are called inside expressions, but the body of a functional procedure is built using standard specification/programming syntax, including nondeterminism, sequential composition, conditionals and loops. We integrate our theory of functional procedures into the existing mechanisation of the refinement calculus in the HOL system. To make formal reasoning possible, we derive correctness rules for functional procedures and their calls. We also show how recursive functional procedures can be handled according to our approach. Finally, we provide a nontrivial example of reasoning about a recursive procedure for binary search. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Verification of a combinational loop based arbitration scheme in a system-on-chip integration architecture

Verification of a combinational loop based arbitration schem...

引用

international conference on VLSI Design

作者： Y. Xia P. Ashar C CRL NEC-USA Inc. Princeton NJ USA

We tackle the problem of verifying correctness properties on an HDL implementation of a system-on-chip bus-based integration architecture. the bus architecture is characterized by a 2-level arbitration scheme and the absence of a centralized controller. Checking correctness properties on an implementation can be hard because it is common for an implementation to contain constructs which are difficult to capture using a synchronous FSM model. the hard part in our case is that for performance reasons the second-level arbitration is based on a token-ring protocol implemented as a novel combinational loop. While the combinational loop is non-inverting, there is no acyclic implementation which can mimic its functionality. Our contribution has been to show how the combinational loop, and hence the arbitration scheme, can be modeled by means of mechanical transformations of the implementation model. We model check a 4-client base case implementation followed by an inductive argument for the correctness of an n-client implementation. Our approach including the combinational loop modeling and the inductive proof technique has general application to other similar protocols. Our verification methodology involved checking a Verilog implementation for desired properties using symbolic model checking in the VIS system from UC Berkeley. Checking properties on the base case required negligible amount of CPU resources. While there have been a number of formal verification case studies, we do not believe that any previous work has proposed a general purpose technique for modeling combinational loops.

关键词： System-on-a-chip Protocols Backplanes Hardware design languages Silicon Centralized control logic Delay Computer architecture National electric code

来源：评论

学校读者我要写书评

暂无评论

13th international Workshop on Computer Science logic, CSL 1999 and 8th Annual conference of the European Association for Computer Science logic, EACSL 1999

引用

13th international Workshop on Computer Science logic, CSL 1999 and held as international Workshops on Computer Science logic, EACSL 1999

ISBN: (纸本)3540665366

the proceedings contain 41 papers. the special focus in this conference is on Verification, Temporal logic, Lambda Calculus, Linear logic and Descriptive Complexity. the topics include: Topological queries in spatial databases;constraint-based analysis of broadcast protocols;applicative control and computational complexity;applying rewriting techniques to the verification of erlang processes;an expressively complete temporal logic without past tense operators for mazurkiewicz traces;using fields and explicit substitutions to implement objects and functions in a de bruijn setting;a linear logical view of linear type isomorphisms;choice logic programs and Nash equilibria in strategic games;resolution method for modal logic with well-founded frames;fixpoint alternation and the game quantifier;open least element principle and bounded query computation;anti-symmetry of higher-order subtyping;monadic presentations of lambda terms using generalized inductive types;a logical viewpoint on process-algebraic quotients;data-refinement for call-by value programming languages and interactive theorem proving using type theory.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A P-Time completeness proof for light logics 13th

引用

8th Annual conference of the European-Association-for-Computer-Science-logic (EACSL)/13th international Workshop on Computer Science logic (CSL 99)

作者： Roversi, L Inst Mat Luminy UPR 9016 F-13288 Marseille 9 France

We explain why the original proofs of P-Time completeness for Light Affine logic and Light Linear logic can not work, and we fully develop a working one.

ISBN: (纸本)3540665366

We explain why the original proofs of P-Time completeness for Light Affine logic and Light Linear logic can not work, and we fully develop a working one.

关键词： Light Affine/Linear logics P-Time completeness programming with feasible functions

来源：评论

学校读者我要写书评

暂无评论

Monadic presentations of lambda terms using generalized inductive types 13th

引用

8th Annual conference of the European-Association-for-Computer-Science-logic (EACSL)/13th international Workshop on Computer Science logic (CSL 99)

作者： Altenkirch, T Reus, B Univ Munich D-80538 Munich Germany

ISBN: (纸本)3540665366

We present a definition of untyped lambda -terms using a heterogeneous datatype, i.e. an inductively defined operator. this operator can be extended to a Kleish triple, which is a concise way to verify the substitution laws for lambda -calculus. We also observe that repetitions in the definition of the monad as well as in the proofs can be avoided by using well-founded recursion and induction instead of structural induction. We extend the construction to the simply typed lambda -calculus using dependent types, and show that this is an instance of a generalization of Kleish triples. the proofs for the untyped case have been checked using the LEGO system.

关键词： Type theory inductive types lambda-calculus category theory

来源：评论

学校读者我要写书评

暂无评论

Data refinement for call-by-value programming languages 13th

引用

8th Annual conference of the European-Association-for-Computer-Science-logic (EACSL)/13th international Workshop on Computer Science logic (CSL 99)

作者： Kinoshita, Y Power, J Electrotech Lab Tsukuba Ibaraki 305 Japan Univ Edinburgh Lab Fdn Comp Sci Edinburgh EH9 3JZ Midlothian Scotland

ISBN: (纸本)3540665366

We give a category theoretic framework for data-refinement in call-by-value programming languages. One approach to data refinement for the simply typed lambda -calculus is given by generalising the notion of logical relation to one of lax logical relation, so that binary lax logical relations compose. So here, we generalise the notion of lax logical relation, defined in category theoretic terms, from the simply typed lambda -calculus to the computational lambda -calculus as a model of data refinement.

关键词： category theory categorical models and logic denotational semantics lambda and combinatory calculi

来源：评论

学校读者我要写书评

暂无评论

A truly concurrent semantics for a simple parallel programming language 13th

引用

8th Annual conference of the European-Association-for-Computer-Science-logic (EACSL)/13th international Workshop on Computer Science logic (CSL 99)

作者： Gastin, P Mislove, M Univ Paris 07 LIAFA F-75251 Paris 05 France Tulane Univ Dept Math New Orleans LA 70118 USA

ISBN: (纸本)3540665366

this paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, paxallelism and choice. We present a simple programming language which includes (weakly) sequential composition, asynchronous and synchronous parallel composition, a restriction operator, and that supports recursion. We develop an operational and a denotational semantics for this language, and we obtain a theorem relating the behavior of a process as described by the transition system to the meaning of the process in the denotational model. this implies that the denotational model is adequate with respect to the operational model. Our denotational model is based on the resource traces of Gastin and Teodesiu, and since a single resource trace represents all possible executions of a concurrent process, we axe able to model each term of our concurrent language by a single trace. therefore we obtain a deterministic semantics for our language and we axe able to model parallelism without introducing nondeterminism.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Report on the ECAI-98 conference from the machine learning perspective

引用

AI Communications 1998年第3期11卷 233-235页

作者： Smirnov, Evgueni N. Maastricht Univ Maastricht Netherlands

the program committee of the 13th European conference on Artificial Intelligence has accepted 15 papers in the field of machine learning from seven countries: France (3), Germany (1), Japan (1), Italy (3), the Netherlands (1), Slovenia (3) and the United Kingdom (3). the papers cover almost all important sub-areas of machine learning such as, concept learning (2), decision-tree learning (2), inductive logic programming (5), instance-based learning (1), artificial neural networks (2), bayesian learning (1), and learning in multiagent systems (2). Most of the papers represent extensions of the existing machine learning techniques towards more practical applications. this is a positive sign in comparison with the previous ECAI conference and it reflects the basic stream of machine learning research.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A new FMS simulator with object-oriented-programming techniques

引用

JOURNAL OF MATERIALS PROCESSING TECHNOLOGY 1998年第1-3期76卷 238-245页

作者： Li, XN Yuan, HB Huang, XY Cheung, EHM Nanjing Univ Sci & Technol Sch Mfg Engn Nanjing Peoples R China City Univ Hong Kong Dept Mfg Engn Kowloon Hong Kong

With the advance of research, design and operation of flexible manufacturing systems (FMS), new requirements have been presented for FMS simulators. these new requirements are high modelling efficiency, high model validity and credibility, more user-friendly features, real control and scheduling logic similar to a real FMS, and effective and correct analysis of results, etc. In this paper, a new FMS simulator (FMSSIM) based an object-oriented-programming (OOP) and some new techniques is introduced. the new techniques include: (i) fully interactive graphical modelling technique, with which the simulation modelling only needs 2-4 h to complete and thp model data are highly consistent and accurate;(ii) real FMS-like simulation control and scheduling, with which various control and scheduling algorithms such as Al-based heuristic scheduling can be easily implemented;(iii) the Intelligent Evaluator, with which the efficiency and accuracy of the evaluation process can be improved. Practical use has shown that the FMSSIM has a good performance in modelling, operation and evaluation. meeting the new requirements for a modern FMS simulator. (C) 1998 Elsevier Science S.A. All rights reserved.

关键词： flexible manufacturing system simulation simulator FMS simulation FMS modelling evaluation intelligent evaluation

来源：评论

学校读者我要写书评

暂无评论

Flexible planning logic for technology planning

引用

JOURNAL OF MATERIALS PROCESSING TECHNOLOGY 1998年第1-3期76卷 76-81页

作者： Spath, D Agostini, A Univ Karlsruhe Inst Werkzuegmaschinen & Betriebstech D-76128 Karlsruhe Germany

the ever-rising expectations of customers regarding quality and diversity of products require new products to be launched with a minimum of upheaval and consequently rapid, defect-free and economical processes. these goals can be attained and guaranteed in the planning departments of businesses through the sharing of secure and up-to-date planning data. leading to a high degree of flexibility and a minimum of interruptions in the production processes. In terms of technology planning, this results in a demand for economic methods of planning and NC programming, leading in turn to continuous, systematic acquisition of specialised in-house technological knowledge. However, most of the applications on the market are unsatisfactory in terms of acquisition of specialised knowledge of technology, only allowing specialised planning knowledge to be gathered or entered through costly procedures and for it to be organised statically. For rational processing and evaluation of planning knowledge, it is therefore sensible to systematically record technological discoveries made in the course of the planning and running-in process and to make them available for future planning processes. this processing of empirical knowledge along with rational and safe technology planning is supported by the use of DP systems, thus enabling planning knowledge to be kept constantly up-to-date, growing along with the data specific to the enterprise, Fur this purpose, a suitable information model must be devised that represents the integration point within the NC process chain. Using a feature-based product model introduced in the design departments as a starting point, the model is extended to take in a production-orientated view. the model should be designed in such a way that, above all, the technological interconnections are represented and that the technology planning, NC programming and running-in process are integrated through the model. In order to evaluate and process empirical knowledge? m

关键词： CAP CAM CNC feature-based manufacturing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：