Validation of measurement software as an application of slicing and constraint solving

Information and Software Technology

Volumn 40, Issue 11-12, 1998, Pages 661-675

  Krinke, Jens ^a   Snelting, Gregor ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Constraint solving; Measurement system; Path condition; Program slicing; Software validation

Indexed keywords

CALIBRATION; COMPUTER CONTROL SYSTEMS; COMPUTER SOFTWARE SELECTION AND EVALUATION; CONSTRAINT THEORY; MEASUREMENTS; STANDARDS;

CONSTRAINT SOLVING; PROGRAM SLICING; SOFTWARE PACKAGE VALSOFT;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0032298503     PISSN: 09505849     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0950-5849(98)00090-1     Document Type: Article

References (20)

1. H. Agrawal, R. DeMillo, E. Spafford, Dynamic slicing in the presence of unconstrained pointers, in: Proceedings of the 4th Symposium on Testing, Analysis, and Verification, ACM, 1991, pp. 60-73.
2. F. Benhamou, A. Colmerauer (Eds.), Constraint Logic Programming: Selected Research, MIT Press, Cambridge, MA, 1993.
3. F. Benhamou, W. Older, Applying interval arithmetic to real, integer and boolean constraints, Journal of Logic Programming (in press).
4. J. Choi, M. Burke, P. Carini, Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects, in: Proceedings of the 20th Principles of Programming Languages, ACM, 1993, pp. 232-245.
5. E. Clarke, O. Grumberg, D. Long, Model checking and abstraction, ACM TOPLAS 16(5) (1994) 1512-1542.
6. D. Denning, P. Denning, Certification of programs for secure information flow, Communications of the ACM 20(7) (1977) 504-513.
7. M.D. Ernst, Practical fine-grained static slicing of optimized code, technical report MSR-TR-94-14, Microsoft Research, Redmond, WA, 1994.
8. J. Field, G. Ramalingam, F. Tip, Parametric program slicing, in: Proceedings of the 21st Symposium on Principles of Programming Languages, ACM, 1995, 379-392.
9. S. Horwitz, T. Reps, D. Binkley, Interprocedural slicing using dependence graphs, ACM TOPLAS 12(1) (1990) 26-60.
10. J. Jaffar, S. Michaylow, P. Stuckey, R. Yap, The CLP(R) language and system, ACM TOPLAS 14(3) (1992) 339-395.
11. J. Jaffar, M. Maher, Constraint logic programming: a survey, Journal of Logic Programming (in press).
12. W. Landi, B. Ryder, A safe approximation algorithm for interprocedural pointer aliasing, in: Proceedings of SIGPLAN Programming Language Design and Implementation, ACM, 1992, pp. 93-103.
13. K.J. Ottenstein, L.M. Ottenstein, The program dependence graph in a software development environment, ACM SIGPLAN Notices 19(5) (1984) 177-184.
14. W. Pugh, D. Wonnacott, Static analysis of upper and lower bounds on dependences and parallelism, ACM TOPLAS 16(4) (1994) 1248-1278.
15. T. Reps, S. Horwitz, M. Sagiv, G. Rosay, Speeding up slicing, in: Proceedings of the 2nd SIGSOFT Foundations of Software Engineering, ACM, 1994, pp. 11-20.
16. G. Snelting, Combining slicing and constraint solving for validation of measurement software, in: Proceedings of the Static Analysis Symposium, LNCS 1145, 1996, pp. 332-348.
17. C. Steindl, Intermodular slicing of object-oriented programs, in: International Conference on Compiler Construction (CC'98) (in press).
18. F. Tip, A survey of program slicing techniques, Journal of Programming Languages 3 (1995) 121-189.
19. F. Tip, J. Choi, J. Field, G. Ramalingam, Slicing class hierarchies in C+ +, in: Proceedings of the 11th Conference on Object-Oriented Programming Systems, Languages, and Applications, SIGPLAN Notices 31(10), pp. 179-197.
20. M. Wolfe, C. Tseng, The power test for data dependency, IEEE Transactions on Parallel and Distributed Systems 3(5) (1992) 591-601.