CSL Research Papers - Academia.edu (original) (raw)

Abstract: The gap between the demand for complex system software and the supply of this demand has widened. This distance and complexity of software design has led software engineers to find a solution to these two problems as a crisis.... more

Abstract: The gap between the demand for complex system software and the supply of this demand has widened. This distance and complexity of software design has led software engineers to find a solution to these two problems as a crisis. Due to this problem, systems have become more complex and creating software for them has become increasingly difficult due to the timely completion of the project and the project budget constraints. Reusing software as a major factor in reducing some problems Due to the software crisis, it has become increasingly important. Traditional approaches to reusing software in dealing with the software crisis are considered ineffective in practice. Over the past few years, a new approach to software reuse has attracted much attention from the industry. This approach is known as the software development product line, and software reuse has become a major achievement within the organization. Has been. Production lines in the manufacturing industry have long been used to reduce costs and increase productivity by exploiting commonalities between products.
However, the product line in practice in the software industry is a relatively new concept. Studies have shown that organizations can use this approach, significant improvements in productivity, market entry time, product quality and satisfaction. Have a customer.

We generalize algebraic operational semantics from sequential languages to distributed, concurrent languages using Occam as an example. Elsewhere, we will discuss applications to the study of verification and transformation of programs.

We study an extension of monadic second-order logic of order with the uncountability quantifier “there exist uncountably many sets''. We prove that, over the class of finitely branching trees, this extension is equally expressive to plain... more

We study an extension of monadic second-order logic of order with the uncountability quantifier “there exist uncountably many sets''. We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic second-order logic of order. Additionally we find that the continuum hypothesis holds for classes of sets definable in monadic second-order logic over finitely branching trees, which is notable for not all of these classes are analytic. Our approach is based on Shelah's composition method and uses basic results from descriptive set theory. The elimination result is constructive, yielding a decision procedure for the extended logic. Furthermore, by the well-known correspondence between monadic second-order logic and tree automata, our findings translate to analogous results on the extension of first-order logic by cardinality quantifiers over injectively presentable Rabin-automatic structures, generalizing the work of Kuske and Lohrey.