Renaming Detection

Finding changed identifiers is important for understanding the difference between two versions of a program and for detecting and resolving conflicts while merging variants of a program together. Standard practice for differencing and merging relies on line based techniques that do not recognize renamed identifiers. The design and implementation of a tool to automatically detect renamed identifiers between two versions of a program is presented. The system uses an abstract representation of language constructs to enable language awareness without introducing language dependence. Modules for Java and Scheme have been written. The detector works with multiple file pairs, taking into account renamings that span several files. A case study is presented that demonstrates proof of concept. The detector is part of a suite of intelligent differencing and merging programs that exploit the static semantics of programming languages.     

Non-Standard Semantics for Program Slicing

In this paper we generalize the notion of compositional semantics to cope with transfinite reductions of a transition system. Standard denotational and predicate transformer semantics, even though compositional, provide inadequate models for some known program manipulation techniques. We are interested in the systematic design of extended compositional semantics, observing possible transfinite computations, i.e. computations that may occur after a given number of infinite loops. This generalization is necessary to deal with program manipulation techniques modifying the termination status of programs, such as program slicing. We include the transfinite generalization of semantics in the hierarchy developed in 1997 by P. Cousot, where semantics at different levels of abstraction are related with each other by abstract interpretation. We prove that a specular hierarchy of non-standard semantics modeling transfinite computations of programs can be specifiedin such a way that the standard hierarchy can be derived by abstract interpretation. We prove that non-standard transfinite denotational and predicate transformer semantics can be both systematically derived as solutions of simple abstract domain equations involving the basic operation of reduced power of abstract domains. This allows us to prove the optimality of these semantics, i.e. they are the most abstract semantics in the hierarchy which are compositional and observe respectively the terminating and initial states of transfinite computations, providing an adequate mathematical model for program manipulation.     

设计语义学探讨

对设计语义学的定义进行了探讨，对形态语义进行了研究，总结了形态语义的一般规律，阐明了对设计语义学进行探讨的紧迫性。     

A Formal Approach to Protocol Interoperability Testing

Porotocol Interoperability testing is an important means to ensure the interconnection and interoperation between protocol products.In this paper,we proposed a formal approach to protocol interoperability testing based on the operational semantics of Concurrent TTCN.We define Concurrent TTCN‘s operational semantics by using Labeled Transition System,and describe the interoperability test execution and test verdict based on Concurrent TTCN.This approach is very helpful for the formation of formal interoperability testing theory and construction of general interoperability testing system.     

An invitation to Friendly Testing

1IntroductionSinceitspresentationin[1,2]TestingSemanticshasbeenwidelystudiedandusedasanaturalwaytodefineanobservationalbehaviorwithareasonablepowertodistinguishsemanticallydifferentprocesses.TestingSemanticsisdefinedbyobservingtheoperationalsemanticsofprocessesbymeansoftests.Testsarejustprocesseswhichmayexecuteanewactionwreportingsuccessofthetestapplication.Todefinetheapplicationofatesttoaprocesslweconsiderthedifferentcomputationsoftheexperimentalsystemwhichisobtainedbycomposinginparallelthe…     

Garment中多态类型的Ideal模型

本文从Ideal的基本概念出发,研究了Ideal作为类型的语义模型所具有的性质.在类型的Ideal模型下,讨论了Garment中参数化多态类型和约束多态类型的语义.并在此基础上,证明了Garment中类型规则的语义可靠性.     

Signed Systems for Paraconsistent Reasoning

We present a novel approach to paraconsistent reasoning, that is, to reasoning from inconsistent information. The basic idea is the following. We transform an inconsistent theory into a consistent one by renaming all literals occurring in the theory. Then, we restore some of the original contents of the theory by introducing progressively formal equivalences linking the original literals to their renamings. This is done as long as consistency is preserved. The restoration of the original contents of the theory is done by appeal to default logic. The overall approach provides us with a family of paraconsistent consequence relations.Our approach is semantical because it works at the level of the propositions; it deals with the semantical link between a proposition and its negation. The approach is therefore independent of the combination of the connectives that are actually applied to the propositions in order to form entire formulas.     

Management of imprecision and uncertainty for production activity control

The operational levels of production management, often called production activity control (PAC) or manufacturing process control, require increasing reaction capabilities in order to adapt the workshop management to the changes of its environment. It often implies giving more responsibilities to the low decision levels. However, the management of the corresponding degrees of freedom is generally unusual. In such a situation, decision support systems (DSSs) provide a way to reconcile the satisfaction of mid-level objectives and the reaction requirements. A conceptual model is described that provides a design framework for a PAC DSS. Since the available knowledge lies mainly in expertise, a DSS has been implemented using a knowledge-based system. The uncertainty and imprecision of the managed information led to the use of fuzzy logic as a modeling tool. Moreover, various inference semantics have been implemented in the expert rules because different kinds of reasoning have been identified. Two versions of the DSS are described and several examples of implemented reasoning processes are developed.     

语义特征造型系统中特征相互作用机制

当前基于特征的造型系统不能很好地维护特征的语义,主要是由于缺乏一种有效的、贯穿于整个造型过程的有效性维护机制,其中一个突出方面就是特征相互作用管理机制。笔者提出了一种满足各种条件的相互作用定义、分类方法,描述了特征相互作用管理器在特征模型有效性维护中的作用及工作过程,确定了每个操作的特征相互作用范围,这些将为特征相互作用管理器进行工作奠定基础。     

Reasoning with infinite stable models

This paper illustrates extensively the theoretical properties, the implementation issues, and the programming style underlying finitary programs. They are a class of normal logic programs whose consequences under the stable model semantics can be effectively computed, despite the fact that finitary programs admit function symbols (hence infinite domains) and recursion. From a theoretical point of view, finitary programs are interesting because they enjoy properties that are extremely unusual for a nonmonotonic formalism, such as compactness. From the application point of view, the theory of finitary programs shows how the existing technology for answer set programming can be extended from problem solving below the second level of the polynomial hierarchy to all semidecidable problems. Moreover, finitary programs allow a more natural encoding of recursive data structures and may increase the performance of credulous reasoners.