流程图编程语言和编辑软件的设计开发

为解决小型微型就地控制或显示设备的流程图显示问题,设计了一种适用于有限资源的基于矢量方式、顺序文件模式的流程图编程语言和配套的绿色图形化编辑软件.较为详尽地介绍了它们的设计思想和设计方法.     

Discrete Systems and Flowcharts

This paper points out the abstract similarities between problems arising in programming, discrete systems analysis in engineering, and network flow problems in operations research. The highly developed techniques of analyzing discrete systems of two terminal elements in electrical engineering become applicable to analyzing the complexity and execution time of computer programs.     

The Analogy Between Electrical Networks and Flowcharts

A recently proposed analogy between discrete systems and flowcharts is discussed. It is pointed out that the analog of Kirchhoff's voltage law does not apply to flowcharts, and that the analogy is likely to be of limited value as an aid to program analysis.     

The current programming language standards scene XIII: Flowcharts and decision tables

Developments in the standardisation field during the period January 1980 to May 1983 relevant to flowcharts and decision tables are reviewed.     

Induction as Consequence Finding

This paper presents a general procedure for inverse entailment which constructs inductive hypotheses in inductive logic programming. Based on inverse entailment, not only unit clauses but also characteristic clauses are deduced from a background theory together with the negation of positive examples. Such clauses can be computed by a resolution method for consequence finding. Unlike previous work on inverse entailment, our proposed method called CF-induction is sound and complete for finding hypotheses from full clausal theories, and can be used for inducing not only definite clauses but also non-Horn clauses and integrity constraints. We also show that CF-induction can be used to compute abductive explanations, and then compare induction and abduction from the viewpoint of inverse entailment and consequence finding.     

A Theory of Hierarchical Consequence and Conditionals

We introduce A{\mathcal{A}} -ranked preferential structures and combine them with an accessibility relation. A{\mathcal{A}} -ranked preferential structures are intermediate between simple preferential structures and ranked structures. The additional accessibility relation allows us to consider only parts of the overall A{\mathcal{A}} -ranked structure. This framework allows us to formalize contrary to duty obligations, and other pictures where we have a hierarchy of situations, and maybe not all are accessible to all possible worlds. Representation results are proved.     

Interrupt Verification via Thread Verification

Most of the research effort towards verification of concurrent software has focused on multithreaded code. On the other hand, concurrency in low-end embedded systems is predominantly based on interrupts. Low-end embedded systems are ubiquitous in safety-critical applications such as those supporting transportation and medical automation; their verification is important. Although interrupts are superficially similar to threads, there are subtle semantic differences between the two abstractions. This paper compares and contrasts threads and interrupts from the point of view of verifying the absence of race conditions. We identify a small set of extensions that permit thread verification tools to also verify interrupt-driven software, and we present examples of source-to-source transformations that turn interrupt-driven code into semantically equivalent thread-based code that can be checked by a thread verifier. Finally, we demonstrate a proof-of-concept program transformation tool that converts interrupt-driven sensor network applications into multithreaded code, and we use an existing tool to find race conditions in these applications.     

Consequence finding and computing answers with defaults

Consequence finding has been recognized as an important technique in many intelligent systems involving inference. In previous work, propositional or first-order clausal theories have been considered for consequence finding. In this paper, we consider consequence finding from a default theory, which consists of a first-order clausal theory and a set of normal defaults. In an extension of a default theory, consequence finding can be done with the generating defaults for the extension. Alternatively, all extensions can be represented at once with the conditional answer format, which represents how a conclusion depends on which defaults. We also propose a procedure for consequence finding and query answering in a default theory using the first-order consequence-finding procedure SOL. In computing consequences from default theories efficiently, the notion of TCS-freeness is most important to prune a large number of irrational tableaux induced by the generating defaults for an extension. In order to simulate the TCS-freeness, the refined SOL calculus called SOL-S(Γ) is adopted using skip preference and complement checking. This research is supported in part by JSPS Grant-in-Aid for Scientific Research (No. 17300051)     

使用SystemC验证库进行随机验证

SystemC是一种适用于SoC顶层设计的新型硬件设计语言,SystemC验证库是SystemC标准库的一个增补库,用以增强SystemC在SoC顶层验证的能力,本文对SystemC及其验证库进行了简要介绍,重点说明了如何使用SystemC验证库进行随机测试.     

FPGA的验证平台及有效的SoC验证方法

设计了一种基于FPGA的验证平台及有效的SoC验证方法,介绍了此FPGA验证软硬件平台及软硬件协同验证架构,讨论和分析了利用FPGA软硬件协同系统验证SoC系统的过程和方法.利用此软硬件协同验证技术方法,验证了SoC系统、DSP指令、硬件IP等.实验证明,此FPGA验证平台能够验证SoC设计,提高了设计效率.     

基于SCV的事务级验证建模

结合SystemC验证库(SCV)的特点，提出了一种新的事务级验证模型，对其中部分主要模块进行了描述。该模型具有事务级交易记录、结果自检测以及随机测试等特性，通过该模型能够构建事务级验证平台。通过RAM实例，描述了验证平台的构建过程。     

事务级形式验证技术及8051验证模型

提出一种基于事务的用于电路系统的形式验证方法(TBFV)．应用该方法，验证工程师可以在行为级对系统进行验证，无需了解设计的细节．为了对该方法进行示范，验证了8051的RTL级实现，并给出了8051指令集的TBFV模型．     

基于事务断言验证及SDH芯片验证平台

提出了基于事务断言验证技术,用属性说明语言(Property Specification Language,PSL)描述系统的属性,用事务进行系统的验证,通过编程语言接口机理和工具控制语言来控制验证中PSL断言的状态,使得基于PSL的断言验证可以事务的形式灵活地应用。采用该技术建立了同步数字体系(Synchronous Digitial Hierarchy,SDH)验证平台,验证了超过100万门交换芯片的功能,实践表明,该方法极大的提高了验证覆盖率和验证效率。     

A Fast Consequence Recognition Algorithm for Monadic Logical Programs

A fast algorithm is designed for detecting in linear time whether a given literal expression is a consequence of a monadic logical program, i.e., a program that only includes only single-place symbols of predicates and functions. It can be used for recognizing admissible controls if knowledge about objectives and actions of a system are represented by the monadic program.