A Translation Method from Natural Language Specifications of Communication Protocols into Algebraic Specifications Using Contextual Dependencies
スポンサーリンク
概要
- 論文の詳細を見る
This paper presents a method of translating natural language specifications of communication protocols into algebraic specifications. Such a natural language specification specifies action sequences performed by the protocol machine (program). Usually, a sentence implicitly specifies the state of the protocol machine at which the described actions must be performed. The authors propose a method of analyzing the implicitly specified states of the protocol machine taking the OSI session protocol specification (265 sentences) as an example. The method uses the following properties: (a) syntactic properties of a natural language (English in this paper); (b) syntactic properties introduced by the target algebraic specifications, e.g., type constraints; (c) properties specific to the target domain, e.g., properties of data types. This paper also shows the result of applying this method to the main part of the OSI session protocol specification (29 paragraphs, 98 sentences). For 95 sentences, the translation system uniquely determines the states specified implicitly by these sentences, using only (a) and (b) described above. By using (c) in addition, each implicitly specified state in the remaining three sentences is uniquely determined.
- 社団法人電子情報通信学会の論文
- 1993-12-25
著者
-
Kasami Tadao
Nara Inst. Of Sci. And Technol. Ikoma‐shi Jpn
-
Koumoto Takuya
Okayama University
-
Ishihara Y
Osaka Univ. Toyonaka‐shi Jpn
-
Seki H
Graduate School Of Information Science Nara Institute Of Science And Technology
-
Ishihara Yasunori
Faculty of Engineering Science, Osaka University
-
Seki Hiroyuki
Faculty of Engineering Science, Osaka University
-
Shimabukuro Jun
Hitachi, Ltd.
-
Okawa Kazuhiko
Toyota Automatic Loom Works, Ltd.
-
Koumoto T
Hiroshima City Univ. Hiroshima Jpn
-
Okawa Kazuhiko
Toyota Automatic Loom Works Ltd.
-
Shimabukuro Jun
Hitachi Ltd.
-
Seki Hiroyuki
Faculty Of Engineering Science Osaka University
関連論文
- MAP and LogMAP Decoding Algorithms for Linear Block Codes Using a Code Structure(Special Section on Information Theory and Its Applications)
- A Recursive Maximum Likelihood Decoding Algorithm for Some Transitive Invariant Binary Block Codes
- A Sufficient Condition for Ruling Out Some Useless Test Error Patterns in Iterative Decoding Algorithms
- Low Weight Subtrellises for Binary Linear Block Codes and Their Applications
- Error Performance of Multilevel Block Coded 8-PSK Modulations Using Unequal Error Protection Codes for the Rayleigh Fading Channel
- An Improved Union Bound on Block Error Probability for Closest Coset Decoding
- On Branch Labels of Parallel Components of the L-Section Minimal Trellis Diagrams for Binary Linear Block Codes
- On Structural Complexity of the L-Section Minimal Trellis Diagrams for Binary Linear Block Codes (Special Section on Information Theory and Its Applications)
- A Soft-Input and Output Iterative Bounded-Distance and Encoding-Based Decoding Algorithm for Product Codes
- Structural Analysis of Minimum Weight Codewords of the Extended (32, 21, 6) and (64, 45, 8) BCH Codes Using Invariance Property(HISC2006)
- The structure of the set of minimum weight codewords of the extended (32,21,6) and (64,45,8) BCH codes
- Sufficient Conditions for Ruling-Out Useless Iterative Steps in a Class of Iterative Decoding Algorithms (Special Section on Information Theory and Its Applications)
- The Weight Distributions of Cosets of the Second-Order Reed-Muller Code of Length 128 in the Third-Order Reed-Muller Code of Length 128
- A Method for Computing the Weight Distribution of a Block Code by Using Its Trellis Diagram (Special Section on Information Theory and Its Applications)
- An Improved Method for Formal Security Verification of Cryptographic Protocols
- A System for Deciding the Security of Cryptographic Protocols (Special Section on Cryptography and Information Security)
- Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code(Coding Theory)
- Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code(HISC2006)
- Computational Complexity of Finding Highly Co-occurrent Itemsets in Market Basket Databases
- On a reduced complexity soft-input and output iterative decoding algorithm for product codes(HISC2006)
- Performance Analysis for Binary Image of Linear Block Codes over an Extended Field of GF(2)
- Adaptive Recursive Maximum Likelihood Decoding Based on the Coarsest Parallel Concatenation Decomposition : Evaluation of the Decoding Complexity by Simulation
- Soft-Input Soft-Output Decoding Algorithm Based on Iterative Minimum Distance Search for Reed-Muller Codes
- Selecting the Search Centers of h-Chase Decoding Algorithms by Simulation
- The Optimal Sectionalized Trellises for the Generalized Version of Viterbi Algorithm of Linear Block Codes and Its Application to Reed-Muller Codes
- A Formal Approach to Detecting Security Flaws in Object-Oriented Databases (Special Issue on New Generation Database Technologies)
- An Authorization Model for Object-Oriented Databases and Its Efficient Access Control
- Assignment of Data Types to Words in a Natural Language Specification
- Implementation of Natural Language Specifications of Communication Protocols by Executable Specifications
- A Translation Method from Natural Language Specifications of Communication Protocols into Algebraic Specifications Using Contextual Dependencies
- Complexity of the Type-Consistency Problem for Acyclic Object-Oriented Database Schemas
- RNA Pseudoknotted Structure Prediction Using Stochastic Multiple Context-Free Grammar
- On the Generative Power of Grammars for RNA Secondary Structure(Foundations of Computer Science)
- RIGHT-LINEAR FINITE PATH OVERLAPPING REWRITE SYSTEMS EFFECTIVELY PRESERVE RECOGNIZABILITY
- 2-P-42 Effect of low-intensity cycling exercise with skin cold stimulation on intramuscular oxygen saturation(The Proceedings of the 17th Annual Meetings of Japan Society of Exercise and Sports Physiology Jury 25-26, (Tokyo))
- A Soft-Decision Iterative Decoding Algorithm Using a Top-Down and Recursive Minimum Distance Search(Special Section on Information Theory and Its Applications)
- An Evaluation Method of the Block Error Probability by Using a Low-Weight Sub-Trellis Diagram
- A Soft-input and output Iterative Decoding Algorithm for Product Codes
- A Verification Method via Invariant for Communication Protocols Modeled as Extended Communicating Finite-State Machines
- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property (Special Issue on Selected Papers from LA Symposium)
- Termination Property of Inverse Finite Path Overlapping Term Rewriting System is Decidable
- A Polynomial-Time Recognizable Subclass of Lexical-Functional Grammars
- A Note on Inadequacy of the Model for Learning from Queries
- Finite State Translation Systems and Parallel Multiple Context-Free Grammars
- The Universal Recognition Problems for Multiple Context-Free Grammars and for Linear Context-Free Rewriting Systems
- Selection of Test Patterns in an Iterative Erasure and Error Decoding Algorithm for Non-binary Block Codes(Coding Theory)
- Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms(Coding Theory)(Information Theory and Its Applications)
- Selection of Search Centers in Iterative Soft-Decision Decoding Algorithms(Special Section on Information Theory and Its Applications)
- An Improvement to GMD-Like Decoding Algorithms(Special Section on Information Theory and Its Applications)
- Preparation of Superconductive (Bi, Pb)-Sr-Ca-Cu-O Thick Films by Rapid Quenching
- Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search(Cording Theory)(Information Theory and Its Applications)