TAPSOFT
1993
Springer
14 years 17 hour ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
SIGSOFT
1994
ACM
14 years 17 hour ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
SIGSOFT
1994
ACM
14 years 17 hour ago
1994
ACM
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
SIGSOFT
1994
ACM
14 years 17 hour ago
1994
ACM
In this paper we present an approach, based on data ow analysis, that can provide cost-e ective analysis of concurrent programs with respect to explicitly stated correctness prope...
SIGSOFT
1994
ACM
14 years 17 hour ago
1994
ACM
Testing is potentially the best grounded part of software engineering, since it deals with the well defined situation of a fixed program and a test (a finite collection of input v...
SIGSOFT
1994
ACM
14 years 17 hour ago
1994
ACM
1 P2 is a scalable compiler for collection data structures. High-level ions insulate P2 users from data structure implementation details. By specifying a target data structure as a...
SIGSOFT
1994
ACM
14 years 17 hour ago
1994
ACM
As the design of software architectures emerges as a discipline within software engineering, it will become increasingly important to support architectural description and analysi...
SIGSOFT
1994
ACM
14 years 17 hour ago
1994
ACM
This paper describes LCLint, an efficient and flexible tool that accepts as input programs (written in ANSI C) and various levels of formal specification. Using this information, ...
ICSE
1992
IEEE-ACM
14 years 18 hour ago
1992
IEEE-ACM
ICSE
1992
IEEE-ACM
14 years 18 hour ago
1992
IEEE-ACM