Aiming at limited support of formalization method of present software system structure for dynamic nature, adaptability nature of system structure and that it cannot verify dynamic characteristics of consistency, integrity in the evolution process of the system, put forward dynamic reconstruction system based on B Diagram theory integrating π calculation and Mobile Ambient calculation during op...

According to the transformational approach to similarity, two objects are judged to be more similar the simpler the transformation of one of the object representations into the other. This approach draws inspiration from the mathematical theory of Kolmogorov complexity, but otherwise remains an informal theory to this day. In this paper we investigate several different ways in which the informa...

This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is a deep embedding using the computational power intrinsic to type theory. Since Coq accepts only structural recursive functions, the computational embedding of general recursive programs is non-trivial. To justify the embedding,...

UML is a general-purpose modeling language for object oriented systems. UML suffers from lack of semantics design due to its semi-formal structure. Formal methods have been used largely in order to deal with this problem. This paper presents a formalization of UML communication diagrams (collaboration diagrams in UML 1.x) semantics using π-calculus computation model. The formalization provides ...

Born about three decades ago, Kolmogorov Complexity Theory (KC) led to important discoveries that, in particular, give a new understanding of the fundamental problem: interrelations between classical continuum mathematics and reality (physics, biology, engineering sciences,. . .). Speciically, in addition to the equations, physicists use the following additional diicult-to-formalize property: t...

Implementation of formal techniques to aid the design and implementation of workflow management systems (WfMS) is still required. We believe that formal methods can be applied in the field of properties demonstration of a workflow specification. This paper develops a formalization of the workflow paradigm based on communication (speech-act theory) by using a temporal logic, namely, the Temporal...

Computers are fundamental tools to facilitate engineering design. But to provide adequate support, a systematic formalization is needed to express, communicate, and compute product knowledge between agents. This paper introduces the Design Knowledge Specification Language (DKSL), a knowledge representation (KR) language tuned to the engineering domain. It blends aspects of both specification an...

Deep learning has had a profound impact on computer science in recent years, with applications to search engines, image recognition and language processing, bioinformatics, and more. Recently, Cohen et al. [2] provided theoretical evidence for the superiority of deep learning over shallow learning. For my master’s thesis [1], I formalized their mathematical proof using Isabelle/HOL. This formal...

In this paper, the author wishes first to highlight, within the general cultural context, some possible elementary computational psychoanalysis formalizations concerning Matte Blanco’s bi-logic components through certain very elementary mathematical tools and notions drawn from theoretical physics and algebra. Afterwards, on the basis of recent work of Giampaolo Sasso (1999; 2005; 2011), relyin...

The study and implementation of formal techniques to aid the design and implementation of Workflow Management Systems (WfMS) is still required. Using these techniques, we can provide this technology with automated reasoning capacities, which are required for the automated demonstration of the properties that will verify a given model. This paper develops a formalization of the workflow paradigm...