References

  1. P. Collingbourne & P. Kelly (2009): A Compile-Time Infrastructure for GCC Using Haskell. In: GROW09 workshop, within HIPEAC09, http://www.doc.ic.ac.uk/ phjk/GROW09/, Paphos, Cyprus.
  2. P. Cousot & R. Cousot (1992): Abstract Interpretation Frameworks. J. Logic and Computation 2(4), pp. 511–547, doi:10.1093/logcom/2.4.511.
  3. P. Cousot & R. Cousot (2004): Basic Concepts of Abstract Interpretation, pp. 359–366. Kluwer Academic Publishers, doi:10.1007/978-1-4020-8157-6_27.
  4. P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux & X. Rival (2005): The ASTRÉE Analyser. In: Proc. ESOP'05 LNCS 3444, Edinburgh, Scotland, pp. 21–30, doi:10.1007/978-3-540-31987-0_3.
  5. P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Min\IeC é, D. Monniaux & X. Rival (2006): Combination of Abstractions in the ASTRÉE Static Analyzer. In: M. Okada & I. Satoh: Eleventh Annual Asian Computing Science Conference (ASIAN'06) 4435. Springer, Berlin, Tokyo, Japan, LNCS, pp. 1–24, doi:10.1007/978-3-540-77505-8_23.
  6. D. Engler, B. Chelf, A. Chou & S. Hallem (2000): Checking system rules using system-specific, programmer-written compiler extensions. In: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4, OSDI'00. USENIX Association, Berkeley, CA, USA, pp. 1–16.
  7. C. Flanagan, A. Sabry, B. F. Duba & M. Felleisen (2004): The essence of compiling with continuations. SIGPLAN Not. 39, pp. 502–514, doi:10.1145/989393.989443.
  8. GCC community (2011): -0.5GCCinternals doc.. Available at http://gcc.gnu.org/onlinedocs/gccint/.
  9. T. Glek & D. Mandelin (2008): Using GCC instead of Grep and Sed. In: GCC Summit 2008, Ottawa, pp. 21–32.
  10. D. Guilbaud, E. Goubault, A. Pacalet, B. Starynk\IeC évitch & F. V\IeC édrine (2001): A Simple Abstract Interpreter for Threat Detection and Test Case Generation. In: WAPATV'01, with ICSE'01, Toronto.
  11. R. Jones & R. D. Lins (1996): Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley.
  12. F. Le Fessant & L. Maranget (2001): Optimizing Pattern-Matching. In: Proc. 2001 ICFP. ACM Press.
  13. A. Lissy (2011): Model Checking the Linux Kernel (FOSDEM2011).
  14. L. Maranget (2007): Warnings for pattern matching. J. Functional Programming 17.
  15. L. Maranget (2008): Compiling Pattern Matching to Good Decision Trees.
  16. G. Marpons-Ucero, J. Mariño-Carballo, M. Carro, Á. Herranz-Nieva, J. J. Moreno-Navarro & L. Fredlund (2008): Automatic Coding Rule Conformance Checking Using Logic Programming. In: PADL, pp. 18–34, doi:10.1007/978-3-540-77442-6_3.
  17. B. Monate & J. Signoles (2008): Slicing for Security of Code. In: TRUST, pp. 133–142, doi:10.1007/978-3-540-68979-9_10.
  18. J. Pitrat (1995): Speaking about and Acting upon Oneself. Technical Report 1995/29. LIP6/Laforia.
  19. J. Pitrat (1996): Implementation of a reflective system. Future Gener. Comput. Syst. 12(2-3), pp. 235–242, doi:10.1016/0167-739X(96)00011-8.
  20. J. Pitrat (2009): Artificial Beings (the conscience of a conscious machine). Wiley / ISTE, doi:10.1002/9780470611791.
  21. S. Pop (2006): The SSA Representation Framework: Semantics, Analyses and GCC Implementation.. Ecole des Mines de Paris. Available at http://www.cri.ensmp.fr/classement/doc/A-381.pdf.
  22. C. Queinnec (1996): Lisp in Small Pieces. Cambridge Univ. Pr., New York, NY, USA.
  23. N. Ramsey & S.P. Jones (2000): A single intermediate language that supports multiple implementations of exceptions. In: Proc. PLDI '00. ACM, New York, NY, USA, pp. 285–298, doi:10.1145/349299.349337.
  24. B. Starynkevitch (2006-2011): MELTcode -1[GPLv3] within GCC. http://gcc-melt.org/ and svn://gcc.gnu.org/svn/gcc/branches/melt-branch.
  25. B. Starynkevitch (2007): Multi-Stage Construction of a Global Static Analyzer. In: GCC Summit 2007, Ottawa, pp. 143–156.
  26. B. Starynkevitch (2009): Middle End Lisp Translator for GCC, achievements and issues. In: GROW09 workshop, within HIPEAC09, http://www.doc.ic.ac.uk/ phjk/GROW09/, Paphos, Cyprus.
  27. K. Trifunovic, A. Cohen, D. Edelsohn, F. Li, T. Grosser, H. Jagasia, R. Ladelsky, S. Pop, J. Sjödin & R. Upadrasta (2010): GRAPHITE Two Years After: First Lessons Learned From Real-World Polyhedral Compilation. In: GCC Research Opportunities Workshop (GROW'10), Pisa Italie. Available at http://hal.inria.fr/inria-00551516/en/.
  28. A. Venet & G. Brat (2004): Precise and efficient static array bound checking for large embedded C programs. In: PLDI '04: Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation. ACM Press, New York, NY, USA, pp. 231–242, doi:10.1145/996841.996869.
  29. N. Volanschi (2006): A Portable Compiler-Integrated Approach to Permanent Checking. In: ASE '06: Proceedings of the 21st IEEE International Conference on Automated Software Engineering (ASE'06). IEEE Computer Society, Washington, DC, USA, pp. 103–112, doi:10.1109/ASE.2006.8.
  30. P. Wadler (1987): Views: a way for pattern matching to cohabit with data abstraction. In: Proc. POPL '87. ACM, New York, NY, USA, pp. 307–313, doi:10.1145/41625.41653.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org