CSC

We first review the development of the notion of the algorithm as a fundamental paradigm of mathematics. We then suggest a definition of computer science that distinguishes it from all other sciences and from mathematics. Finally we argue that the ...

We describe computational science as an interdisciplinary approach to doing science on computers. Our purpose is to introduce computational science as a legitimate interest of computer scientists.

We present a possible foundation for computational ...

What if there were an electronic computer science library? Consider the possibilities of having your favorite publications available within finger's reach. Consider Project Envision, an ongoing effort to build a user-centered database from the computer ...

Students learning computer organization and assembly language programming often have difficulty understanding the relationship between hardware functions and software instructions. This paper describes how a software tool can help students understand ...

Static Program Slicing has gained wide recognition in both academic and practical arenas. Several debugging tools have been developed that utilize static program slicing. Dynamic slicing has also gained considerable popularity in recent years. Due to ...

Students learning computer organization and assembly language programming often have difficulty understanding the relationship between hardware functions and software instructions. This paper describes how a software tool can help students understand ...

This paper investigates the trade-off between timeliness and precision of real-time tasks. For a task that must satisfy real-time requirements and that is capable of generating intermediate results of lower precision, an overall value function is ...

This paper discusses problems associated with scheduling periodic tasks on a uniprocessor in a hard, real-time processing environment using a static-priority, preemptive-resume operating system. The scheduling problems associated with a task set ...

Increases in hardware availability and capability have caused microprocessor based real-time embedded systems to become increasingly pervasive [8,9]. With this popularity, however, has come an increase in the size and complexity of embedded ...

This paper focuses on object-oriented programming and one kind of structure-improving transformation (refactoring) that is unique to object-oriented programming: finding abstract superclasses. We decompose the operation of finding an abstract superclass ...

Large scale software development is an intrinsically difficult task. Developers use a set of specialized tools to alleviate some of this difficulty. The problem is that most of these tools are not integrated and do little to help developers and managers ...

This paper presents a discussion of why languages that support multiple paradigms (i.e. multiparadigm languages) have the potential to be good pedagogical tools for teaching programming skills. Several examples are given that demonstrate how different ...

This paper describes some historical software engineering backgrounds leading to specification languages. These specification languages have high promises for the future. One of the main problems is the derivation of implementations. We propose a ...

Constraint satisfaction systems are usually designed to work within a single-theory. This paper presents an approach to multi-theory constraint satisfaction characterized by cooperation among a variety of single-theory specialists. The system consists ...

The inference problem in propositional logic is important for expert system and deductive database applications. Although in practice the use of propositional logic is not sufficient it is basic for first order predicate logic and also for inference ...

this paper describes a multiagent planning system, MuPAC, that formulates cooperative plans efficiently. It contains three features: meta-level planning, breakable and unbreakable action representations, and an integrated agent screening and assignment ...

The Calculus of Self-Modifiable Algorithms (CSA) is a universal theory that integrates different programming styles and may be applied to a wealth of domains and applications. This paper presents aspects of the Calculus of Self-Modifiable Algorithms and ...

We present a framework to specify and validate the design of message passing systems with synchronous or asynchronous communications. Our approach allows users to represent concurrent systems in a novel language and to justify the design automatically ...

In this paper we propose an abstract representation, called Synchronized Generalized Program Graph (SGPG), for concurrent programs. SGPG incorporates the data dependencies, control flow, control dependencies, communication, and synchronization ...

In this paper, we first present a 1-fault-tolerant (1-ft) hypercube model with degree 2r, the ring-connected hypercube (RCH), which has the lowest degree among all 1-ft, one spare node, r-dimensional hypercube architecture yet discovered. Then we ...

In this paper, the results obtained thus far in an ongoing research effort devoted to the modeling of indefinite information is presented. Specifically, an extended relational model coined E-tables for representing exclusive indefinite type model coined ...

PROLOG uses a depth-first search of an AND/OR graph to satisfy queries against its database. It searches sequentially through the clauses of a predicate whose head matches the query, trying to satisfy the goals in the clause body in a sequential left-to-...

The recent improvement of computer hardware has made them possible to manage imprecise information. An example is the fuzzy database system which allows imprecise data as well as imprecise queries. However, one serious problem has not been solved when ...

This paper applies parallel processing technology to database security technology and vice versa. We first describe the issues involved in incorporating multilevel security into parallel database management systems. In particular, we describe how ...

HCV is a heuristic attribute-based induction algorithm based on the newly-developed extension matrix approach. By dividing the positive examples (PE) of a specific class in a given example set into intersecting groups and adopting a set of strategies to ...

Denotational semantics^1,2,3,4 provides a formal method of precisely and concisely specifying languages, programming languages as well as other kinds of software such as editors and file systems. But those attributes that make denotational descriptions ...

The instruction of software engineering within the discipline of computing must not only focus on the development of software, but also provide a process by which the student can improve and evolve their software engineering skills. The student's ...

We describe a system for designing pedagogical dialogues. Intended for authors of computer science courseware, it was developed using the Smalltalk/V language. This software allows one to specify and compile reactive dialogue elements for the Smalltalk ...

We address the conceptual problem of how to visualize computer science algorithms by describing the hashing algorithm part of a large scale project focusing on algorithm animation for computer science education. We concentrate on the two tasks of how to ...