Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
We propose a radix-r digit-recurrence algorithm for complex square-root. The operand is prescaled to allow the selection of square-root digits by rounding of the residual. This lea...
Abstract. We present an analysis of the separation of concerns in multi-language design and multilanguage specifications. The basis for our analysis is the paradigm of the multi-di...
We present LM, a tool for mining scenario-based specifications in the form of Live Sequence Charts, a visual language that extends sequence diagrams with modalities. LM comes with...
Tuan-Anh Doan, David Lo, Shahar Maoz, Siau-Cheng K...
This paper presents an algorithm for the automatic mapping of problem specifications to existing architecture templates. The proposed methodology supports the combination of exist...
Nikos S. Voros, Evaggelinos P. Mariatos, Michael K...