Efficient fixpoint computation

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

Volumn 864 LNCS, Issue , 1994, Pages 314-328

  Vergauwen, B ^a   Wauman, J ^a   Lewi, J ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); DATA FLOW ANALYSIS; SEMANTICS; STATIC ANALYSIS;

ABSTRACT INTERPRETATIONS; COMPLETE PARTIAL ORDERS; CONCRETE APPLICATIONS; DENOTATIONAL SEMANTICS; FIX-POINT ALGORITHMS; FIXPOINT COMPUTATIONS; SAMPLE APPLICATIONS; SYSTEM VERIFICATIONS;

APPROXIMATION ALGORITHMS;

EID: 84956979062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58485-4_49     Document Type: Conference Paper

References (26)

1. Andersen, H. R.: Model Checking and Boolean Graphs, ESOP’92, LNCS 582, 1992
2. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Progr. Languages and Systems, Vol.8, No. 2, pp. 244-263, April 1986
3. Cleaveland, R.: Tableau-Based Model Checking in the Propositional Mu-Calculus, Acta Informatica, 1990
4. Cleaveland, R., Steffen, B.: Computing Behavioural Relations, Logically, ICALP 91, pp. 127-138, LNCS 510
5. Cleaveland, R., Steffen, B.: A Linear-Time Model Checking Algorithm for the Alternation-Free Modal Mu-Calculus, CAV’91, LNCS 575, 1991
6. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, POPL, 1977.
7. Debray, S. K.: Static inference of modes and data dependencies in logic programs, TOPLAS, 11 (3), 1989.
8. Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional μ-calculus, LICS, 267-278, 1986
9. Jones, N.D., Mycroft, A.: Data flow analysis of applicative programs using minimal function graphs, POPL, 1986.
10. Jorgensen, N.: Chaotic fixpoint iteration guided by dynamic dependency, in Workshop on Static Analysis (WSA’93), LNCS.
11. O’Keefe, R.A.: Finite fixed-point problems, ICTL 1987.
12. Kildall, G.A.: A unified approach to global program optimization, POPL 1973.
13. Kozen, D.: Results on the propositional μ-calculus, TCS, 27, 1983.
14. Larsen, K.G.: Proof systems for Hennessy-Milner logic with recursion, CAAP, 1988, see also TCS, 72, 1990
15. Larsen, K.G.: Efficient local correctness checking, CAV’92, Forthcoming
16. Le Charlier, B., Van Hentenryck, P.: Experimental Evaluation of a Generic Abstract Interpretation Algorithm for PROLOG, TOPLAS, Vol. 16, nr. 1, January 1994.
17. Le Charlier, B., Van Hentenryck, P.: A universal top-down fixpoint algorithm, Technical Report 92-22, Institute of Computer Science, University of Namur, Belgium, April 1992.
18. Le Charlier, B., Degimbe, O., Michel, L., Van Hentenryck, P.: Optimization Techniques for General Purpose Fixpoint Algorithms: Practical Efficiency for the Abstract Interpretation of Prolog, in Workshop on Static Analysis (WSA’93), LNCS.
19. Milner, R.: Communication and Concurrency, Prentice-Hall International, 1989.
20. Stifling, C., Walker, D.: Local model checking in the modal ran-calculus, TCS, October 1991, see also LNCS 351,369-383, CAAP 1989
21. Tarjan, R.E.: Depth first search and linear graph algorithms, SIAM J. Comput., 1 (2), 1972.
22. Vergauwen, B., Lewi, J.: A linear algorithm for solving fixed points equations on transition systems, CAAP’92, LNCS 581, 322-341
23. Vergauwen, B., Lewi, J.: Efficient Local Correctness Checking for Single and Alternating Blocks, ICALP’94, LNCS 820.
24. Vergauwen, B.: Verification of Temporal Properties of Concurrent Systems, Ph.D. thesis, in preparation.
25. Winskel, G.: A note on model checking the modal v-calculus, ICALP, LNCS 372, 1989, see also TCS 83, 1991
26. Wauman, J.: Ontwerp en implementatie van lokale verificatie-algoritmen voor reactieve systemen met behulp van temporele logic, Ms. thesis, Dept. of Computer Science, K.U. Leuven, 1992-1993.