haskell-cafe@haskell.org
[Top] [All Lists]

[Haskell-cafe] ANNOUNCE: SourceGraph-0.6.0.0 and Graphalyze-0.9.0.0

Subject: [Haskell-cafe] ANNOUNCE: SourceGraph-0.6.0.0 and Graphalyze-0.9.0.0
From: Ivan Lazar Miljenovic
Date: Sat, 09 Jan 2010 00:08:01 +1000
I'm pleased to announce the latest releases of SourceGraph [1] and
Graphalyze [2].

[1]: http://hackage.haskell.org/package/SourceGraph
[2]: http://hackage.haskell.org/package/Graphalyze

SourceGraph is a program that performs static code analysis on Haskell
projects on the by applying graph theoretic techniques to the project's
call graph.  Graphalyze is a library for analysing discrete data using
graph theory, and as such performs the heavy lifting for SourceGraph.

Sample analysis reports generated by SourceGraph are available at
http://code.haskell.org/~ivanm/Sample_SourceGraph/SampleReports.html .
I will also be demoing SourceGraph at PEPM [3] in Madrid on 19 January.

[3]: http://www.program-transformation.org/PEPM10/

Changes since the previous version include:

* Now supports "implicitly exported" entities (as requested by Curt
  Sampson).  This includes instantiated class methods from other
  modules and functions, etc. that start with an underscore (see
  http://www.haskell.org/ghc/docs/latest/html/users_guide/options-sanity.html
  for more information).

* All inaccessible entities are now reported, not just those that were
  root nodes in the call graph.

* Edges are now colour-coded based upon whether they are part of a
  clique, cycle or a chain.

* Level-based analyses: visualise how deep an entity is from those
  exported entities.

* A re-done TODO that lists in detail what is planned for SourceGraph.

* Lots of under-the-hood changes that don't sound as interesting as the
  above :-(

-- 
Ivan Lazar Miljenovic
Ivan.Miljenovic@xxxxxxxxx
IvanMiljenovic.wordpress.com
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@xxxxxxxxxxx
http://www.haskell.org/mailman/listinfo/haskell-cafe

<Prev in Thread] Current Thread [Next in Thread>