Factotum: Automatic and systematic sharing support for systems analyzers

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

Volumn 1384, Issue , 1998, Pages 249-262

  Sherman, David James ^a   Magnier, Nicolas ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SYSTEMS ANALYSIS;

AUTOMATIC MEMORY MANAGEMENT; GARBAGE COLLECTORS; HIGH-LEVEL PROGRAMMING; MULTI-THREADED APPLICATION; SOFTWARE SYSTEMS; SUBTERMS; SYMBOLIC COMPUTING SYSTEMS; SYMBOLIC EXPRESSION;

COMPUTATION THEORY;

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

References (26)

1. André Arnold, Didier Bégay, and Paul Crubillé. Construction and Analysis of Transition Systems with MEC. Number 3 in AMAST Series in Computing. World Scientific Publishers, 1994.
2. B. Akers. Binary decision diagrams. IEEE Transactions on Computers, 27(6):509-516, 1978.
3. Andrew Appel. Garbage collection can be faster than stack allocation. Information Processing Letters, 25(4), 1987.
4. R. Bryant. Graph based algorithms for boolean fonction manipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.
5. The CGC copying garbage collector. At ftp://ftp.labri.u-bordeaux.fr/, September 1997. Part of the eqe equational programming project.
6. Leslie Paul Chew. An improved algorithm for computing with equations. In 21st Annual Symposium on Foundations of Computer Science, 1980.
7. Christoph Hoffmann and Michael J. O'Donnell. Pattern matching in trees. Journal o] the ACM, pages 68-95, 1982.
8. John Hughes. Lazy memo functions. In Functional Programming Languages and Computer Architectures. Springer-Verlag, 1985.
9. Per-Ake Larson. Dynamic hash tables. Communications of the ACM, 31(4):446-457, April 1988.
10. Nicolas Magnier. Recalculs dans les systèmes de réécriture et programmation équationnelle. Technical Report 974-94, Laboratoire Bordelais de Recherche en Informatique, 1994.
11. J. McCarthy. Recursive functions of symbolic expressions and their computation by machine. Communications of the ACM, 3(4):185-195, 1960.
12. D. Mitchie. 'Memo' functions and machine learning. Nature, pages 19-22, 1968.
13. Renaud Paquay. Implémentation du logiciel de vérification de module MEC avec les arbrés partagés. Master's Thesis, University Notre-Dame de la Paix, Namur, Belgium, 1996.
14. A. Rauzy. An introduction to binary decision diagrams and some of their applications to risk assessment. In O. Roux, editor, Actes de l'école d'été, Moddlisation et Vdrification de Processus Paralléles, MOVEP'96, 1996. Also Technical Report 1121-96, Laboratoire Bordelals de Recherche en Informatique.
15. Antoine Rauzy and Marc-Michel Corsini. First experiments with Toupie. Technical Report 581-93, Laboratoire Bordelais de Recherche en Informatique, 1993.
16. I. V. Ramakrishnan and R. Verma. Nonoblivious normalization algorithms for nonlinear systems. In Proceedings of the International Conference on Automata, Languages, and Programming, 1990.
17. David J. Sherman. Lazy directed congruence closure. Technical Report 90-028, University of Chicago Department of Computer Science, 1990.
18. David J. Sherman. Run-time and Compile-time Improvements to Equational Programs. PhD thesis, University of Chicago, Chicago, Illinois, 1994.
19. David J. Sherman. Factotum: Automatic and systematic sharing support for symbolic computation. Technical Report 1174-97, Laboratoire Bordelais de Recherche en Informatique, September 1997.
20. David J. Sherman. On referential transparency in the presence of uniform sharing. Technical Report 1179-97, Laboratoire Bordelals de Recherche en Informatique, October 1997.
21. Robert Strandh. A dynamic hash library. Available at ftp://ftp.labri.u-bordeaux.fr/, March 1992. Based on Larson, CACM 31(4).
22. Rakesh M. Verma. A theory of using history for equational systems with applications. Journal of the ACM, 42(5):984-1020, 1995.
23. Paul R. Wilson. Garbage collection. ACM Computing Surveys, 1995. Available at file://ftp.cs.utexas.edu/pub/garbage/bigsurv.ps.
24. Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles. Dynamic storage allocation: A survey and critical review. Technical report, University of Texas, 1995. Available at file:/fftp.cs.utexas.edu/pub/garbage/allocsurv.ps.
25. D. Zampunieris and B. Le Charlier. Efficient handling of large sets of tupies with sharing trees. In Proceedings of Data Compression Conference, DCC'95, October 1995. Also Research Paper RP-94-004, Facultés Universitaires Notre-Dame de la Paix, Namur, Belgium.
26. Didier Zampuniéris and Bandouin Le Charlier. An efficient algorithm to compute the synchronized product. In Int'l Workshop MASCOTS, 1995.