36,372 research outputs found
A Programming Environment Evaluation Methodology for Object-Oriented Systems
The object-oriented design strategy as both a problem decomposition and system development paradigm has made impressive inroads into the various areas of the computing sciences. Substantial development productivity improvements have been demonstrated in areas ranging from artificial intelligence to user interface design. However, there has been very little progress in the formal characterization of these productivity improvements and in the identification of the underlying cognitive mechanisms. The development and validation of models and metrics of this sort require large amounts of systematically-gathered structural and productivity data. There has, however, been a notable lack of systematically-gathered information on these development environments. A large part of this problem is attributable to the lack of a systematic programming environment evaluation methodology that is appropriate to the evaluation of object-oriented systems
Logics for complexity classes
A new syntactic characterization of problems complete via Turing reductions
is presented. General canonical forms are developed in order to define such
problems. One of these forms allows us to define complete problems on ordered
structures, and another form to define them on unordered non-Aristotelian
structures. Using the canonical forms, logics are developed for complete
problems in various complexity classes. Evidence is shown that there cannot be
any complete problem on Aristotelian structures for several complexity classes.
Our approach is extended beyond complete problems. Using a similar form, a
logic is developed to capture the complexity class which very
likely contains no complete problem.Comment: This article has been accepted for publication in Logic Journal of
IGPL Published by Oxford University Press; 23 pages, 2 figure
Program schemes with deep pushdown storage.
Inspired by recent work of Meduna on deep pushdown automata, we consider the computational power of a class of basic program schemes, TeX, based around assignments, while-loops and non- deterministic guessing but with access to a deep pushdown stack which, apart from having the usual push and pop instructions, also has deep-push instructions which allow elements to be pushed to stack locations deep within the stack. We syntactically define sub-classes of TeX by restricting the occurrences of pops, pushes and deep-pushes and capture the complexity classes NP and PSPACE. Furthermore, we show that all problems accepted by program schemes of TeX are in EXPTIME
- …