Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
This paper presents a state-based approach to testing aspect-oriented programs. Aspectual state models, as an extension to the testable FREE state model of classes, are exploited ...
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
Emad A. El-Sebakhy, Salahadin Mohammed, Moustafa E...
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...