{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:59:16Z","timestamp":1725551956131},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322030"},{"type":"electronic","value":"9783540322047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671404_16","type":"book-chapter","created":{"date-parts":[[2006,1,23]],"date-time":"2006-01-23T12:03:57Z","timestamp":1138017837000},"page":"233-247","source":"Crossref","is-referenced-by-count":5,"title":["Using Concept Lattices to Uncover Causal Dependencies in Software"],"prefix":"10.1007","author":[{"given":"John L.","family":"Pfaltz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ball, T.: The Concept of Dynamic Analysis. In: Proc. Seventh European Software Engineering Conf., September 1999, pp. 216\u2013234 (1999)","DOI":"10.1007\/3-540-48166-4_14"},{"key":"16_CR2","first-page":"997","volume-title":"Handbood of Theoretical Computer Science","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and Modal Logic. In: Handbood of Theoretical Computer Science, pp. 997\u20131071. Elsevier Science, Amsterdam (1990)"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/32.908957","volume":"27","author":"M.D. Ernst","year":"2001","unstructured":"Ernst, M.D., Cockrell, J., Griswold, W.G., Notkin, D.: Dynamically Discovering Likely Program Invariants to Support Program Evolution. IEEE Trans. Software Eng.\u00a027(2), 1\u201325 (2001)","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01212306","volume":"4","author":"M. Fisher","year":"1992","unstructured":"Fisher, M.: A Model Checker for Linear Time Temporal Logic. Formal Aspects of Computing\u00a04(3), 299\u2013319 (1992)","journal-title":"Formal Aspects of Computing"},{"key":"16_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis - Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis - Mathematical Foundations. Springer, Heidelberg (1999)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple on-the-fly Automatic Verification of Linear Temporal Logic. In: Dembinski, P., Sredniawa, M. (eds.) Protocol Specification, Testing and Verification XV, Proc. of 15th IFIP Workshop, Warsaw, June 1996, pp. 3\u201318 (1996)","DOI":"10.1007\/978-0-387-34892-6_1"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Godin, R., Mili, H.: Building and Maintaining Analysis-Level Class Hierarchies Using Galois Lattices. In: ACM Conf. on Object-Oriented Programming Systems, Languages and Applications (OOPSLA 1993), Washington, DC, pp. 394\u2013410 (1993)","DOI":"10.1145\/165854.165931"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0304-3975(94)90195-3","volume":"133","author":"R. Godin","year":"1994","unstructured":"Godin, R., Missaoui, R.: An Incremental Concept Formation Approach for Learning from Databases. Theoretical Comp. Sci.\u00a0133, 387\u2013419 (1994)","journal-title":"Theoretical Comp. Sci."},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","volume":"11","author":"R. Godin","year":"1995","unstructured":"Godin, R., Missaoui, R., Alaoui, H.: Incremental Concept Formation Algorithms Based on Galois (Concept) Lattices. Computational Intelligence\u00a011(2), 246\u2013267 (1995)","journal-title":"Computational Intelligence"},{"key":"16_CR10","unstructured":"Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Frequent Item Sets. In: 1st IEEE Intern\u2019l Conf. on Data Mining, San Jose, CA (November 2001)"},{"key":"#cr-split#-16_CR11.1","doi-asserted-by":"crossref","unstructured":"Jamison, R.E., Pfaltz, J.L.: Closure Spaces that are not Uniquely Generated. Discrete Appl. Math.??147, 69???79 (2005);","DOI":"10.1016\/j.dam.2004.06.021"},{"key":"#cr-split#-16_CR11.2","unstructured":"Also in Ordinal and Symbolic Data Analysis, OSDA 2000, Brussels, Belgium (July 2000)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Lindig, C., Snelting, G.: Assessing Modular Structure of Legacy Code Based on Mathematical Concept Analysis. In: Proc. of 1997 International Conf. on Software Engineering, Boston, MA, May 1997, pp. 349\u2013359 (1997)","DOI":"10.1145\/253228.253354"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"493","DOI":"10.2307\/1990305","volume":"55","author":"O. Ore","year":"1944","unstructured":"Ore, O.: Galois Connexions. Trans. of AMS\u00a055, 493\u2013513 (1944)","journal-title":"Trans. of AMS"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Perkins, J.H., Ernst, M.D.: Efficient Incremental Algorithms for Dynamic Detection of Likely Invariants. In: Proc. SIGSOFT 2004\/FSE-2, November 2004, pp. 23\u201332 (2004)","DOI":"10.1145\/1029894.1029901"},{"key":"16_CR15","unstructured":"Pfaltz, J.L., Taylor, C.M.: Closed Set Mining of Biological Data. In: BIOKDD 2002, 2nd Workshop on Data Mining in Bioinformatics, Edmonton, Alberta, July 2002, pp. 43\u201348 (2002)"},{"key":"16_CR16","unstructured":"Pfaltz, J.L., Taylor, C.M.: Concept Lattices as a Scientific Knowledge Discovery Technique. In: Workshop on Discrete Mathematics and Data Mining, 2nd SIAM International Conference on Data Mining, Arlington, VA, April 2002, pp. 65\u201374 (2002)"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Siff, M., Reps, T.: Identifying Modules via Concept Analysis. In: Intn\u2019l Conf. on Software Maintenance, Bari, Italy, October 1997, pp. 170\u2013179 (1997)","DOI":"10.1109\/ICSM.1997.624243"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Snelting, G., Tip, F.: Reengineering Class Hierarchies Using Concept Analysis. In: Proc. ACM SIGSOFT 6th International Symposium on Foundations of Software Engineering, FSE-6, Lake Buena Vista, FL, pp. 99\u2013110 (1998)","DOI":"10.1145\/288195.288273"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Tabuada, P., Pappas, G.J.: Linear Time Logic Control of Discrete-time Linear Systems. IEEE Trans. on Automatic Control, in revision (2005)","DOI":"10.1109\/TAC.2006.886494"},{"key":"16_CR20","unstructured":"Valtchev, P., Missaoui, R., Godin, R.: A Framework for Incremental Generation of Frequent Closed Itemsets. In: Hammer, P. (ed.) Workshop on Discrete Mathematics & Data Mining, 2nd SIAM Conf. on Data Mining, Arlington, VA, April 2002, pp. 75\u201386 (2002)"},{"key":"16_CR21","unstructured":"Valtchev, P., Missaoui, R., Hacene, R., Godin, R.: Incremental Maintenance of Association Rule Bases. In: Proc. Workshop on Discrete Mathematic and Data Mining, San Francisco, CA (2003)"},{"key":"16_CR22","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring Lattice Theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. Reidel, Dordrechtz (1982)"},{"key":"16_CR23","unstructured":"Yang, J., Evans, D.: Automatically Inferring Temporal Properties for Program Evolution. In: 15th IEEE Symposium on Software Reliability Engineering (ISSRE 2004), Saint-Malo, France (November 2004)"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Yang, J., Evans, D.: Dynamically Inferring Temporal Properties. In: Proc. ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE 2004), Washington, DC (June 2004)","DOI":"10.1145\/996821.996832"},{"key":"16_CR25","unstructured":"Yang, J., Evans, D., Bhardwaj, D., Bhat, T., Das, M.: Terracotta: Mining Temporal API Rules from Imperfect Traces. In: 28th Internl. Conf. on Software Engineering (ICSE 2006), Shanghai, China (May 2006) (submitted)"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating Non-Redundant Association Rules. In: 6th ACM SIGKDD Intern\u2019l Conf. on Knowledge Discovery and Data Mining, Boston, MA, August 2000, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An Efficient Algorithm for Closed Association Rule Mining. In: Grossman, R. (ed.) 2nd SIAM International Conf. on Data Mining, Arlington, VA, April 2002, pp. 457\u2013473 (2002)","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671404_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:05:10Z","timestamp":1605643510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671404_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322030","9783540322047"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11671404_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}