Abstract:
For the majority of complex systems a satisfactory analysis is highly impractical, or even impossible at the current technological level. In this paper we employ a new methodology, called light analysis, to deal with such systems. Light analysis consists of extracting from a complex system a `light' version, which is structurally simpler. This way, in order to analyze a complex system one can effectively analyze its simpler light version. We report on successful practical applications of the method to the analysis of systems that are out of the scope of all the current techniques. 1
Citations
|
496
|
S.: The Implementation of Functional Programming Languages
– Jones
- 1987
|
|
416
|
Programming from Specifications
– MORGAN
- 1994
|
|
100
|
Algebraic Specification
– Bergstra, Heering, et al.
- 1989
|
|
92
|
Software aging
– Parnas
- 1994
|
|
84
|
Real Analysis: Modern Techniques and Their Applications
– Folland
- 1984
|
|
77
|
Specification and Transformation of Programs: A Formal Approach To Software Development
– PARTSCH
- 1990
|
|
66
|
Termination of term rewriting by semantic labelling
– Zantema
- 1995
|
|
50
|
From operational semantics to abstract machines
– Hannan, Miller
- 1992
|
|
25
|
Design stability measures for software maintenance
– Yau, Collofello
- 1985
|
|
20
|
The Impact Analysis Task in Software Maintenance: A Model and a Case Study
– Queille, Voidrot, et al.
- 1994
|
|
17
|
Completeness Results for Basic Narrowing. Applicable Algebra
– Middeldorp, Hamoen
- 1994
|
|
16
|
Unravelings and ultra-properties
– Marchiori
- 1996
|
|
10
|
Term rewriting systems, in: Handbook of Logic in
– Klop
- 1992
|
|
10
|
Evolutionary training of CLP-constrained neural networks
– Kok, Marchiori, et al.
- 1996
|
|
10
|
The linear abstract machine. Theoretical Computer Science 59
– Lafont
- 1988
|
|
4
|
Conditional term rewriting and first-order theorem proving
– Plaisted, Alexander, et al.
- 1992
|
|
2
|
Reengineering legacy systems to meet quality requirements: An experience report
– Antonini, Canfora, et al.
- 1994
|
|
1
|
Reduce the redex ! ReDuX. 5th RTA
– undgen, R
- 1993
|
|
1
|
Algebraic specifications. Software Engineer 's Reference Book, Butterworths
– Gaudel
- 1991
|
|
1
|
Term rewriting in contemporary resolution theorem proving
– Stickel
- 1995
|
