Using concept lattices to uncover causal dependencies in software

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

Volumn 3874 LNAI, Issue , 2006, Pages 233-247

  Pfaltz, John L ^a  

^a University of Virginia   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXECUTION TRACE STREAMS; FORCE EXECUTION; FORMAL CONCEPT ANALYSIS; LEGACY CODES;

CODES (SYMBOLS); COMPUTER OPERATING SYSTEMS; COMPUTER SCIENCE; FORMAL LANGUAGES; INFORMATION TECHNOLOGY; LEGACY SYSTEMS; MIDDLEWARE;

COMPUTER SOFTWARE;

EID: 33745532569     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671404_16     Document Type: Conference Paper

References (28)

1. Thomas Ball. The Concept of Dynamic Analysis. Proc. Seventh European Software Engineering Conf., pages 216-234, Sept. 1999.
2. E. Allen Emerson. Temporal and Modal Logic. In Handbood of Theoretical Computer Science, pages 997-1071. Elsevier Science, 1990.
3. Michael D. Ernst, Jake Cockrell, William G. Griswold, and David Notkin. Dynamically Discovering Likely Program Invariants to Support Program Evolution. IEEE Trans. Software Eng., 27(2):1-25, Feb. 2001.
4. Michael Fisher. A Model Checker for Linear Time Temporal Logic. Formal Aspects of Computing, 4(3):299-319, 1992.
5. Bernhard Ganter and Rudolf Wille. Formal Concept Analysis - Mathematical Foundations. Springer Verlag, Heidelberg, 1999.
6. Rob Gerth, Doron Peled, Moshe Y. Vardi, and Pierre Wolper. Simple on-the-fly Automatic Verification of Linear Temporal Logic. In Piotr Dembinski and Marek Sredniawa, editors, Protocol Specification, Testing and Verification XV, Proc. of 15th IFIP Workshop, pages 3-18, Warsaw, Juue 1996.
7. R. Godin and Hafedh Mili. Building and Maintaining Analysis-Level Class Hierarchies Using Galois Lattices. In ACM Conf. on Object-Oriented Programming Systems, Languages and Applications (OOPSLA '93), pages 394-410, Washington, DC, 1993.
8. Robert Godin and Rokia Missaoui. An Incremental Concept Formation Approach for Learning from Databases. In Theoretical Comp. Sci., volume 133, pages 387-419, 1994.
9. Robert Godin, Rokia Missaoui, and Hassan Alaoui. Incremental Concept Formation Algorithms Based on Galois (Concept) Lattices, Computational Intelligence,11l(2):246-267, 1995.
10. Karam Gouda and Mohammed J. Zaki. Efficiently Mining Maximal Frequent Item Sets. In 1st IEEE Intern'l Conf. on Data Mining, San Jose, CA, Nov. 2001.
11. Robert E. Jamison and John L. Pfaltz. Closure Spaces that are not Uniquely Generated. Discrete Appl Math., 147:69-79, Feb. 2005.
12. also in Ordinal and Symbolic Data Analysis, OSDA 2000, Brussels, Belgium July 2000.
13. Christian Lindig and Gregor Snelting. Assessing Modular Structure of Legacy Code Based on Mathematical Concept Analysis. In Proc of 1997 International Conf. on Software Engineering, pages 349-359, Boston, MA, May 1997.
14. Oystein Ore. Galois Connexions. Trans. of AMS, 55:493-513, 1944.
15. Jeff H. Perkins and Michael D. Ernst, Efficient Incremental Algorithms for Dynamic Detection of Likely Invariants. Proc. SJGSOFT'04/FSE-2, pages 23-32, Nov. 2004.
16. John L. Pfaltz and Christopher M. Taylor. Closed Set Mining of Biological Data. In BIOKDD 2008, end Workshop on Data Mining in Bioinformatics, pages 43-48, Edmonton, Alberta, July 2002.
17. John L. Pfaltz and Christopher M. Taylor. Concept Lattices as a Scientific Knowledge Discovery Technique. In Workshop on Discrete Mathematics and Data Mining, 2nd SIAM International Conference on Data Mining, pages 65-74, Arlington, VA, Apr. 2002.
18. Michael Siffand Thomas Reps. Identifying Modules via Concept Analysis. In Intn'l Conf. on Software Maintenance, pages 170-179, Bari, Italy, Oct. 1997.
19. Gregor Snelting and Frank Tip, Reengineering Class Hierarchies Using Concept Analysis. In Proc. A CM SIGSOFT 6th International Symposium on Foundations of Software Engineering, FSE-6, pages 99-110, Lake Buena Vista, FL, 1998.
20. Paulo Tabuada and George J. Pappas. Linear Time Logic Control of Discrete-time Linear Systems. IEEE Trans. on Automatic Control, page (in revision), 2005.
21. Potko Valtchev, Ilokia Missaoni, and Robert Godin. A Framework for Incremental Generation of Frequent Closed Itemsets. In Peter Hammer, editor, Workshop on Discrete Mathematics & Data Mining, 2nd SIAM Conf. on Data Mining, pages 75-86, Arlington, VA, April 2002.
22. Petko Valtchev, Ilokia Missaoui, Rouane Hacene, and Robert Godin, Incremental Maintenance of Association Rule Bases, In Proc. Workshop on Discrete Mathematic and Data Mining, San Francisco, CA, 2003.
23. Rudolf Wille. Restructuring Lattice Theory; An approach based on hierarchies of concepts. In Ivan Rival, editor, Ordered Sets, pages 445-470. Reidel, 1982.
24. Jinlin Yang and David Evans. Automatically Inferring Temporal Properties for Program Evolution. In 15th IEEE Symposium on Software Reliability Engineering (ISSRE 8004), Saint-Malo, France, Nov. 2004.
25. Jinlin Yang and David Evans. Dynamically Inferring Temporal Properties. In Proc. ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE 2004, Washington, DC, June 2004.
26. Jinlin Yang, David Evans, Deepali Bhardwaj, Thirumalesh Bhat, and Manuvir Dos. Terracotta: Mining Temporal API Rules from Imperfect Traces. In 28th Internl. Conf. on Software Engineering (ICSE 2006), page (submitted), Shanghai, China, May 2006.
27. Mohammed J. Zaki. Generating Non-Redundant Association Rules. In 6th ACM SIGKDD Intern'l Conf. on Knowledge Discovery and Data Mining, pages 34-43, Boston, MA, Aug. 2000.
28. Mohammed J. Zaki and Ching-Jui Hsiao. CHARM: An Efficient Algorithm for Closed Association Rule Mining. In Robert Grossman, editor, 2nd SIAM International Conf. on Data Mining, pages 457-473, Arlington, VA, April 2002.