Bimonthly    Since 1986
ISSN 1000-9000(Print)
CN 11-2296/TP
Indexed in:
Publication Details
Edited by: Editorial Board of Journal Of Computer Science and Technology
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Distributed by:
China: All Local Post Offices
Other Countries: Springer
  • Table of Content
      10 January 1991, Volume 6 Issue 1 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    A Structured Temporal Logic Language:XYZ/SE
    Xie Hongliang; Gong Jie; C.S.Tang;
    Journal of Computer Science and Technology, 1991, 6 (1): 1-10. 
    Abstract   PDF(469KB) ( 1257 )   Chinese Summary
    In order to enhance the readability and to simplify the verification of temporal logic programs in the XYZ system,we propose a structured temporal logic language called XYZ/SE,based on XYZ/BE which is the basis language of the XYZ system.A set of proof rules are given and proved to be sound and adequate for proving the partial correctness of XYZ/SE programs in a compositional way.Moreover,we show that every XYZ/BE program can be transformed into an equivalent XYZ/SE program.So we have developed a general co…
    References | Related Articles | Metrics
    Abstract Implementation of Algebraic Specifications in a Temporal Logic Language
    Lin Huimin; Gong Chun; Xie Hongliang;
    Journal of Computer Science and Technology, 1991, 6 (1): 11-20. 
    Abstract   PDF(497KB) ( 1072 )   Chinese Summary
    A formal technique for incorporating two specification paradigms is presented,in which an algebraic specifi- cation is implemented by a set of abstract procedures specified in pre- and post-condition style.The link be- tween the two level specifications is provided via a translation from terms of algebraic specifications into tempo- ral logic formulae representing abstract programs.In terms of translation,a criterion for an abstract implementation satisfying its specification is given,which allows one to ch…
    References | Related Articles | Metrics
    Semantic Specification and Verification of Data Flow Diagrams
    Liu Tong; C.S.Tang;
    Journal of Computer Science and Technology, 1991, 6 (1): 21-31. 
    Abstract   PDF(485KB) ( 1091 )   Chinese Summary
    Data Flow Diagram(DFD)has been widely used in Software Engineering as means of require- ment analysis and system specification.However,one defect of DFD approach remains untackled: the lack of formal semantics has brought about a lot of problems.In this paper,we model Data Flow Diagram as networks of concurrent processes.With the use of temporal logic language XYZ/E,the formal basis of the semantic specification of DFD can be ensured,and the system prop- erties sach as safety and liveness can be easily char…
    References | Related Articles | Metrics
    Design of Quaternary ECL Q Gate
    Zhuang Nan;
    Journal of Computer Science and Technology, 1991, 6 (1): 32-36. 
    Abstract   PDF(238KB) ( 1103 )   Chinese Summary
    A new explanation of quaternary Q gate expression in Post algebra is given in this paper by using transmission function theory proposed in [1] and the quaternary ECL Q gate circuit is de- signed.The SPICE2 simulation to this circuit has confirmed that it has desired logical function and is totally compatible with various quaternary ECL circuits proposed before.
    References | Related Articles | Metrics
    Standard-Cell Placement from Functional Descriptions
    Klaus Buchenrieder;
    Journal of Computer Science and Technology, 1991, 6 (1): 37-46. 
    Abstract   PDF(692KB) ( 1085 )   Chinese Summary
    This paper presents a functional language for the unambiguous description of digital circuits,a me- thod and algorithms to obtain a standard-cell layout,and a comparative evaluation of the developed func- tional standard-cell placement technique.The presented placement scheme is different from traditional methods because the complete layout geometry is specified and constructed automatically from a function- al description.The construction relies on a translation that combines the simplicity of standard-cel…
    References | Related Articles | Metrics
    A Knowledge-Based Approach to Program Synthesis from Examples
    Zhu Hong; Jin Lingzi;
    Journal of Computer Science and Technology, 1991, 6 (1): 47-58. 
    Abstract   PDF(498KB) ( 1085 )   Chinese Summary
    This paper proposes an approach to synthesize functional programs of Backus FP system from input/output instances.Based on a theory of orthogonal expansion of programs,the task of program synthesis is expressed in program equations,and fulfilled by solving them according to the knowledge about the equivalence between programs.Some general knowledge of solving program equations with a number of examples are given in the paper.
    References | Related Articles | Metrics
    A Common Reasoning Model and Its Application in Knowledge-Based System
    Zheng Fangqing;
    Journal of Computer Science and Technology, 1991, 6 (1): 59-65. 
    Abstract   PDF(334KB) ( 1080 )   Chinese Summary
    To use reasoning knowledge accurately and efficiently,many reasoning methods have been proposed. However,the differences in form among the methods may obstruct the systematical analysis and harmonious integration of them.In this paper,a common reasoning model JUM(Judgement Model)is introduced. According to JUM,a common knowledge representation form is abstracted from different reasoning methods and its limitation is reduced.We also propose an algorithm for transforming one type of JUMs into another.In some ...
    References | Related Articles | Metrics
    Improvements to the Control Techniques of Sequential Inference Machines——from Instructions to Hardware Organization
    Xing Hancheng; Li Chunlin; Xing Dongsheng;
    Journal of Computer Science and Technology, 1991, 6 (1): 66-73. 
    Abstract   PDF(342KB) ( 1207 )   Chinese Summary
    Nondeterminism of PROLOG execution requires that a block of control information or a choice point for each procedure call be stored when there are other candidate clauses to be used.When the currently selected clause fails,the bindings made by the clause must be undone and the stored choice point is reactivated,and then another clause of the candidate ones is chosen to run on it. Storing and reactivating choice points and undoing account for the great overhead are required to control PROLOG execution,which …
    References | Related Articles | Metrics
    A Complete Critical Path Algorithm for Test Generation of Combinational Circuits
    Zhou Quan; Wei Daozheng;
    Journal of Computer Science and Technology, 1991, 6 (1): 74-82. 
    Abstract   PDF(408KB) ( 1173 )   Chinese Summary
    It is known that critical path test generation method is not a complete algorithm for combinational circuits with reconvergent-fanout.In order to make it a complete algorithm,we put forward a reconvergent-fanout- oriented technique,the principal critical path algorithm,propagating the critical value back to primary inputs along a single path,the principal critical path,and allowing multiple path sensitization if needed.Relationship among test patterns is also discussed to accelerate test generation.
    References | Related Articles | Metrics
    On the Characterization and Fault Identification of Sequentially t-Diagnosable System Under PMC Model
    Guo Hengchang;
    Journal of Computer Science and Technology, 1991, 6 (1): 83-90. 
    Abstract   PDF(375KB) ( 1323 )   Chinese Summary
    Sequential diagnosis is a very useful strategy for system-level fault identification because of its lower cost of hardware.In this paper,the characterization of sequentially t-diagnosable system is given,and a tmiversal algorithm to seek faulty units in the system is developed.
    References | Related Articles | Metrics
    A Fast Algorithm for Polygon Operations
    Cai Shijie; Zhang Fuyan;
    Journal of Computer Science and Technology, 1991, 6 (1): 91-96. 
    Abstract   PDF(147KB) ( 1227 )   Chinese Summary
    In this paper,a fast algorithm for polygon operations is introduced.The intersection validation testing method is described.
    References | Related Articles | Metrics
    TST——An Algorithm for Global Microcode Compaction with Timing Constraints
    Su Bogong; Wang Jian; Xia Jinshi;
    Journal of Computer Science and Technology, 1991, 6 (1): 97-107. 
    Abstract   PDF(274KB) ( 1510 )   Chinese Summary
    Existing global microcode compaction approaches have all assumed a target architecture that has microoperation conflicts and data dependencies as the two fundamental compaction constraints.However, new practical micromachine features demand that the timing constraint be introduced into the traditional compaction model to guarantee compaction correctness.This paper starts by an analysis on the nature of timing constraints,then modifies the roles for microoperation motions,presents an algorithm,TST,based on T…
    References | Related Articles | Metrics
    Construction of the Model of the Lambda Calculus System with Algebraic Operators
    Lu Ruzhan; Zhang Zheng; Sun Yongqiang;
    Journal of Computer Science and Technology, 1991, 6 (1): 108-112. 
    Abstract   PDF(240KB) ( 1186 )   Chinese Summary
    A lambda system with algebraic operators,lambda-plus system,is introduced.After giving the definitions of the system,we present a sufficient condition for formulating a model of the system. Finally,a model of such system is constructed.
    References | Related Articles | Metrics
  Journal Online
Just Accepted
Top Cited Papers
Top 30 Most Read
Paper Lists of Areas
Special Issues
   ScholarOne Manuscripts
   Log In

User ID:


  Forgot your password?

Enter your e-mail address to receive your account information.

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved