Dependent type systems are promising tools programmers can use to increase the reliability and security of their programs. Unfortunately, dependently-typed programming languages re...
Xinming Ou, Gang Tan, Yitzhak Mandelbaum, David Wa...
We introduce an extension of the Parikh mapping called the Parikh ¢ -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represent...
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...
We study from an implementation viewpoint what constitutes a reasonable and effective notion of structural equivalence of terms in a calculus of concurrent processes and propose op...
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...