This paper reports on the automated verification of the total correctness (partial correctness and termination) of the Deutsch-Schorr-Waite (DSW) algorithm. DSW is an algorithm for traversing a binary tree without the use of a stack by means of destructive pointer manipulation. Prior approaches to the verification of the algorithm involved applications of theorem provers or handwritten proofs. ...

This paper describes methods for approximating context-free grammars with finite state machines. Unlike the method derived from the LR(k) parsing algorithm described in Pereira and Wright (1991), these methods use grammar transformations based on the left-corner grammar transform (Rosenkrantz and Lewis II, 1970; Aho and Ullman, 1972). One advantage of the left corner methods is that they genera...

Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages have been identified as providing a clear and concise way of programming parallel machines for artificial intelligence tasks. The problems of exporting, creating, and manipulating processes have been thoroughly studied...

We present a complete generalization of Kirwan’s partial desingularization theorem on quotients smooth varieties. Precisely, we prove that if X is an irreducible Artin stack with stable good moduli space X→πX, then there canonical sequence birational morphisms stacks Xn→Xn−1→⋯→X0=X the following properties: (1) maximum dimension stabilizer point Xk+1 strictly smaller than Xk and final Xn has co...

Abstract We consider a minimal model of random pan stacking. A single consists V-shaped object characterized by its internal angle α. The stack is constructed piling up N pans with different angles in given, order. set generated sampling from various kinds distributions the angles: discrete or continuous, uniform optimized. For large mean height depends principally on average distance between ba...