Preprocessing for invariant validation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1101, Issue , 1996, Pages 256-270

  Gribomont, E Pascal ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS;

DIJKSTRA; LARGE PROGRAMS; LOGICAL CONSEQUENCES; LOGICAL FORMULAS; NP COMPLETE; PREDICATE TRANSFORMERS; VALIDATION PROBLEM;

SOFTWARE ENGINEERING;

EID: 84947905385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014321     Document Type: Conference Paper

References (28)

1. K.R. Apt and D.C. Kozen, Limits for Automatic Program Verification, Inform. Process. Letters 22 (1986) 307-309.
2. S. Bensalem, Y. Lakhnech and H. Saidi, Powerful techniques for the automatic generation of invariants, Proc. 8th Int. Conf. on Computer-Aided Verification, to appear in Lect. Notes in Comput. Sci. (1996).
3. N. Bjorner, A. Browne and Z. Manna, Automatic Generation of Invariants and Intermediate Assertions, Lect. N. in Comp. Sc. 976 (1995) 589-623.
4. 20 States and Beyond, Proc. 5th. Symp. on Logic in Computer Science (1990) 428-439.
5. E. Clarke, Program invariants as fixed points, Proc. 18th IEEE Symp. on Foundations of Comput. Sci. (1977) 18-29.
6. E. Clarke, E. Emerson and A. Sistla, Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, ACM Trans. Programming Languages Syst. 8 (1986) 244-263.
7. K.M. Chandy and J. Misra, Parallel Program Design: A Foundation (Addison-Wesley, Reading, MA, 1988).
8. C.C. Chang and H.J. Keisler, Model Theory (North-Holland, Amsterdam, 1973).
9. P. Cousot and N. Halbwachs, Automatic Discovery of Linear Restraints Among Variables of a Program, Proc. 5th ACM Symp. on Principles of Programming Languages (1978) 84-96.
10. E.W. Dijkstra, A discipline of programming (Prentice Hall, New Jersey, 1976)
11. M. Fitting, First-order logic and automated theorem proving (Springer, 1990).
12. J.-Y. Girard, Proof theory and logical complexity (Bibliopolis, Napoli, 1966).
13. D.M. Goldschlag, Mechanically Verifying Concurrent programs with the Boyer-Moore prover, IEEE Trans. on Software Engineering 16 (1990) 1005-1023.
14. S. Graf and H. Saidi, Verifying invariants using theorem proving, Proc. 8th Int. Conf. on Computer-Aided Verification, to appear in Lect. Notes in Comput. Sci. (1996).
15. E.P. Gribomont, A Programming Logic for Formal Concurrent Systems, Lect. Notes in Comput. Sci. 458 (1990) 298-313.
16. E.P. Gribomont, Concurrency without toil: a systematic method for parallel program design, Sci. Comput. Programming 21 (1993) 1-56.
17. E.P. Gribomont and D. Rossetto, CAVEAT: technique and tool for Computer Aided VErification And Transformation, Lect. N. in Comp. Sc. 939(1995) 70-83.
18. B. Jonsson and L. Kempe, Verifying safety properties of a class of infinite-state distributed algorithms, Lect. N. in Comp. Sc. 939 (1995) 42-53.
19. R.P. Kurshan and L. Lamport, Verification of a Multiplier: 64 Bits and Beyond, Lect. Notes in Comput. Sci. 697 (1993) 166-179.
20. L. Lamport, An Assertional Correctness Proof of a Distributed Algorithm, Sci. Comput. Programming 2 (1983) 175-206.
21. K. Larsen, B. Steffen and C. Weise, A constraint oriented proof methodology based on modal transitions systems, Lect. Notes in Comput. Sci.129 (1995) 17-40.
22. K. Larsen, B. Steffen and C. Weise, Fisher's protocol revisited: a simple proof using modal constraints, Proc. 4th DIMACS Workshop on Verification and Control of Hybrid Systems. New Brunswick, New Jersey, 22-24 October, 1995.
23. Z. Manna et al., STeP: the Stanford Temporal Prover (Draft), June 1994.
24. G. Ricart and A.K. Agrawala, An optimal algorithm for mutual exclusion, Comm. ACM 24 (1981) 9-17 (corrigendum: Comm. ACM 24 (1981) 578).
25. D.M. Russinoff, A Verification System for Concurrent Programs Based on the Boyer-Moore Prover, Formal Aspects of Computing 4 (1992) 597-611.
26. D.M. Russinoff, A Mechanically Verified Incremental Garbage Collector, Formal Aspects of Computing 6 (1994) 359-390.
27. P. Wolper and V. Lovinfosse, Verifying Properties of large Sets of Processes with Network Invariants, CAV'89, Lect. Notes in Comput. Sci. 407(1990) 68-80.
28. L. Wallen, Automated Deduction in Nonclassical Logics (MIT Press, 1990).