Alexander Serebrenik

Assistant Professor (UD), SET

HG 5.41
Den Dolech 2
P.O. Box 513
5600 MB Eindhoven
The Netherlands

e-mail: a.serebrenik at tue.nl (stupid mail-bots, shame on you!)
phone: +31 40 247 3595 (office)

Since August 1, 2008 I’m a member of SET. Before this I used to be an assistant professor at LaQuSo (July 2004-July 2008). Before this I’ve been a postdoc researcher in the Sémantique, preuve et interprétation abstraite (Semantics, Proof and Abstract Interpretation) group lead by Radhia Cousot. Till December 2003 I've used to work at the Declarative Languages and Artificial Intelligence group at Katholieke Universiteit Leuven. In July 2003 I have defended a Ph.D. thesis entitled Termination Analysis of Logic Programs (Ph.D. advisor: Prof. Danny De Schreye). In 1999 I've obtained my masters degree from the Hebrew University, Jerusalem Israel. My supervisors were Dr. Naomi Lindenstrauss and Prof. Yehoshua Sagiv. My students.

My research interests include static analysis, process modeling and verification, termination analysis, logic programming, Petri nets, abstract interpretation, software engineering, database query languages, term-rewriting.

PC chair: WLPE'03 (together with Fred Mesnard), Termination day in Leuven 2003, WLPE’05 (together with Susana Muñoz Hernández), WST’07 (together with Dieter Hofbauer), BENEVOL’08, APNOC’09 (together with Natalia Sidorova).

PC member: JFPLC 2004, WLPE'04, WLPE'06, LOPSTR’07, WLPE’07, WLPE’08, CSR’09, SLE'09, WLPE'09, CSMR'10.

Publicity Chair for ICLP’06, SLE’09.

Organiser: VVSS 2007 (together with Marko van Eekelen).

Teaching

2009-2010

 2ID05 Datamodelleren en databases
  2IS95 Seminar software engineering and technology
  2IS55 Software evolution

2008-2009

 2ID05 Datamodelleren en databases
  2IM23 Minor project (Verdiepende minor)
  2IM24 Minor project (Minor TI)
  2IC95 Seminar security
  2IF03 Seminar information security technology
  2IP35 Software engineering project
  2IS99 Capita selecta software engineering and technology
2007-2008 2IF03 Seminar information security technology
  2IF25 Formal methods
  2IM23 Minor project (evaluatieresultaten)
2006-2007 2IF03 Seminar information security technology
  2L340 Kennissystemen

Termination analysers for logic programs:

My Erdös number turned out to be much smaller than I've thought:

  1. first kind (all papers) 3 (Erdös - Frankel - Dershowitz - Serebrenik)
  2. second kind (only two-authored papers) 6 (Erdös - Shelah - Weiss - Connes – van Daele - De Schreye - Serebrenik)

My H-number according to Google Scholar is 13.

Publications (DBLP):

  1. Alexander Serebrenik, Serguei Roubtsov, Ella Roubtsova, Mark van den Brand. Reverse Engineering Sequence Diagrams for Enterprise Java Beans with Business Method Interceptors. 16th Working Conference on Reverse Engineering, IEEE Computer Society, 2009, to appear
  2. Mark van den Brand, Arjan van der Meer, Alexander Serebrenik. Type Checking Evolving Languages with MSOS, Lecture Notes in Computer Science, vol. 5700, Springer Verlag, 2009, pp. 207-226.
  3. Alexander Serebrenik, Natalia Sidorova. Predicting Service Request Rates for Adaptive Resource Allocation in SOA. 5th International Workshop on Enterprise & Organizational Modeling and Simulation, 2009, accepted.
  4. Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, Thomas Ströder, René Thiemann. Proving Termination for Logic Programs with Cut. In 10th International Workshop on Termination, Leipzig 2009.
  5. Alexander Serebrenik, Serguei Roubtsov, Mark van den Brand. Dn-based Architecture Assessment of Java Open Source Software Systems. 17th IEEE International Conference on Program Comprehension, IEEE Computer Society, 2009, pp. 198-207.
  6. Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. Automated Termination Proofs for Logic Programs by Term Rewriting. ACM Transactions on Computational Logic (TOCL), 2009, accepted.
  7. Mark van den Brand, Serguei Roubtsov, Alexander Serebrenik. SQuAVisiT: A Flexible Tool for Visual Software Analytics. In Andreas Winter, Rudolf Ferenc, Jens Knodel (Eds.): 13th European Conference on Software Maintenance and Reengineering, CSMR 2009, Architecture-Centric Maintenance of Large-SCale Software Systems, Kaiserslautern, Germany, 24-27 March 2009. IEEE 2009, pp. 331-332
  8. Serguei Roubtsov, Alexander Serebrenik. Quality analysis of industrial legacy systems: An integrated approach. Third International Workshop on Software Quality and Maintainability, 2009, pp. 45-53.
  9. Marija Petković, Mark van den Brand, Alexander Serebrenik, Elena Korshunova, Computing System Metrics through Reverse Engineering. In Setting Quality Standards. Proceedings of the CONQUEST 2008. 11th International Conference of Quality Engineering in Software Technology (Ina Schieferdecker and Stephan Goericke, editors). Potsdam, Germany, September 2008, pp. 261-270
  10. Peter Massuthe, Alexander Serebrenik, Natalia Sidorova, Karsten Wolf. Can I Find a Partner? Undecidablity of Partner Existence for Open Nets. Information Processing Letters 108(6):374-378 (2008).
  11. Kees van Hee, Alexander Serebrenik, Natalia Sidorova Token History Nets, Fundamenta Informaticae 85(1-4):219-234 (2008)
  12. Kees van Hee, Alexander Serebrenik, Natalia Sidorova, Wil van der Aalst. Working with the Past: Integrating History in Petri Nets, Fundamenta Informaticae 88(3):387-409, 2008.
  13. Jan Martijn E. M. van der Werf, Boudewijn F. van Dongen, Cor A. J. Hurkens, Alexander Serebrenik. Process Discovery using Integer Linear Programming. 29th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency. Lecture Notes in Computer Science, vol. 5062, Springer Verlag, 2008, pp. 367-387.
  14. Kees van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve. History-based Joins: Semantics, Soundness and Implementation. Journal of Data and Knowledge Engineering, 64(1):24-37 (2008). Preliminary version of this paper has appeared as:
    • Kees van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova and Marc Voorhoeve. History-based Joins: Semantics, Soundness and Implementation. 4th International Conference on Business Process Management. (S. Dustdar, J. Fiadeiro and A. P. Sheth, eds.), Lecture Notes in Computer Science, vol. 4102, Springer Verlag, 2006, pp. 225--240
  15. Fred Mesnard, Alexander Serebrenik. Recurrence with affine level mappings is P-time decidable for CLP(R). Theory and Practice of Logic Programming, 8(1):111-119, 2008.
  16. Alexander Serebrenik, Tom Schrijvers , and Bart Demoen . Improving Prolog Programs: Refactoring for Prolog. Theory and Practice of Logic Programming, 8(2):201-215, 2008.
  17. Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik:
    Termination of Programs using Term Rewriting and SAT Solving. Deduction and Decision Procedures (Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis, eds.), 30.09. - 05.10.2007.Dagstuhl Seminar Proceedings 07401 Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2007
  18. Kees van Hee , Helen Schonenberg, Alexander Serebrenik, Natalia Sidorova, Jan Martijn van der Werf . Adaptive Workflows for Healthcare Information Systems. ProHealth 2007, Brisbane, Australia, September 2007, Lecture Notes in Computer Science, vol. 4928, Springer Verlag, p. 359-370, 2007.
  19. Ivo Raedts, Marija Petković, Alexander Serebrenik, Lou Somers. Transformation + Analysis = Validation. CONQUEST 2007.
  20. Kees van Hee, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve, and Jan Martijn van der Werf, Modelling with History-Dependent Petri Nets. Proc. of the 5th International Conference on Business Process Management, Lecture Notes in Computer Science, vol. 4714, Springer Verlag, p. 320-327, 2007.
  21. Kees van Hee , Alexander Serebrenik, Natalia Sidorova and Wil van der Aalst. History-Dependent Petri Nets. 28th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency. Siedlce Poland, June 25-29, 2007, (Jetty Kleijn and Alex Yakovlev, eds.), Lecture Notes in Computer Science, vol. 4546, Springer Verlag, 2007, pp. 164-183.
  22. Ivo Raedts, Marija Petković, Alexander Serebrenik, Jan Martijn van der Werf, Lou Somers, Maarten Boote. A Software Framework for Automated Verification. The 22nd Annual ACM Symposium on Applied Computing, March 11-15, 2007, Korea, pp. 1031-1032.
  23. Kees van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve, Irina A. Lomazova. Checking Properties of Adaptive Workflow Nets. Fundamenta Informaticae, 79(3-4): 347-362 (2007). Preliminary version of this paper has appeared as:
  24. Kees van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova and Marc Voorhoeve. LogLogics: A Logic for History-Dependent Business Processes. Science of Computer Programming, volume 65, issue 1, March 2007, Special Issue of Science of Computer Programming on "Increasing Adequacy & Reliability of EIS" (J. Barjis, U. Ultes-Nitsche, J. Augusto, eds.), pages 30-40. Preliminary version of this paper has appeared as:
  25. Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik and René Thiemann .Termination Analysis for Logic Programs by Term Rewriting Revisited . Eighth International Workshop on Termination (A. Geser and H. Søndergaard, eds.) August 15 - 16, 2006 Seattle, Washington, USA, pp. 2-6.
  26. Peter Schneider-Kamp , Jürgen Giesl , Alexander Serebrenik and René Thiemann . Automated Termination Analysis for Logic Programs by Term Rewriting. International Symposium on Logic-based Program Synthesis and Transformation, July 12 - 14, 2006 S. Servolo, Venice – Italy , Lecture Notes in Computer Science, vol. 4407, Springer Verlag, 2006, pp. 177-193
  27. Kees van Hee , Alexander Serebrenik, Natalia Sidorova Marc Voorhoeve and Jan van der Wal. Scheduling-Free Resource Management. Journal of Data and Knowledge Engineering, 61(1): 59-75 (2007). Preliminary version of this paper has appeared as:
  28. Kees van Hee, Irina A. Lomazova, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova and Marc Voorhoeve . Nested Nets for Adaptive Systems. 27th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency. Turku, Finland, June 26-30, 2006, (S. Donatelli and P. S. Thiagarajan, eds), Lecture Notes in Computer Science, vol. 4024, Springer Verlag, 2006, pp. 241--260.
  29. Alexander Serebrenik and Danny De Schreye. Termination of Floating Point Computations. Journal of Automated Reasoning, special issue on "Techniques for Automated Termination Proofs" (Deepak Kapur and Jürgen Giesl, editors), 34(2):141–177, December 2005.
  30. Alexander Serebrenik and Susana Muñoz-Hernández Proceedings of the 15th International Workshop on Logic-based methods in Programming Environments, October 2005.
  31. Alexander Serebrenik and Danny De Schreye, On termination of meta-programs, Theory and Practice of Logic Programming, 5(3): 355-390 (2005).
  32. Cornelis Huizing , Ruurd Kuiper, Teade Punter and Alexander Serebrenik. Looking for Stability. Development and Deployment of Product Software 2005 (S. Brinkkemper, L. Xu, eds.), San Diego, California, USA, June 26, 2005
  33. Kees van Hee, Alexander Serebrenik, Natalia Sidorova and Marc Voorhoeve.Soundness of Resource-Constrained Workflow Nets. 26th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency. Miami, Florida, USA, June 20-25, 2005, (Gianfranco Ciardo, and Philippe Darondeau, eds.), Lecture Notes in Computer Science, vol. 3536, Springer Verlag, 2005, pp. 250—267.
  34. Stefan Blom, Jan Friso Groote, Sjouke Mauw and Alexander Serebrenik. Analysing the BKE-security protocol with μCRL. Proceedings of ARTS 2004, the 6th AMAST Workshop on Real-Time Systems (ARTS 2004). Electronic Notes in Theoretical Computer Science. volume 139, Issue 1, November 2005, Pages 49-90. Preliminary version of this paper appeared also as
  35. Alexander Serebrenik and Danny De Schreye, Inference of termination conditions for numerical loops in Prolog, Theory and Practice of Logic Programming, 4 (5&6), pp. 719-751, 2004
  36. Alexander Serebrenik, Fred Mesnard, On termination of binary CLP programs Proceedings of the International Symposium on LOgic-based Program Synthesis and Transformation, Lecture Notes in Computer Science, vol. 3573, Springer Verlag, 2004 (Etalle, Sandro ed.), pp. 231-244. Preliminary version of this paper also appeared as:
    • Alexander Serebrenik, Fred Mesnard, On termination of binary CLP programs Proceedings of the 14th international workshop on Logic Programming environments (Munoz-Hernandez Susana and Gomez-Perez Jose, eds.)
  37. Tom Schrijvers, Alexander Serebrenik, Improving Prolog Programs: Refactoring for Prolog Proceedings of The 20th International Conference on Logic Programming, St.-Malo, France ( Lifschitz, Vladimir and Demoen, Bart, eds.), 2004, Lecture Notes in Computer Science, vol. 3132, Springer Verlag, 2004, pp. 58-72. Preliminary version of this paper appeared also as
    • Tom Schrijvers, Alexander Serebrenik, and Bart Demoen, Refactoring Prolog Code, Proceedings of the 18th Workshop on (Constraint) Logic Programming (M. Hanus, ed.), Berlin, Germany
    • Alexander Serebrenik and Bart Demoen, Refactoring logic programs, Ninetheen International Conference on Logic Programming, ICLP 2003, Mumbay, India, December 9-13, 2003, Lecture Notes in Computer Science 2916, pp. 509-510. (poster)
  38. Naomi Lindenstrauss, Yehoshua Sagiv and Alexander Serebrenik, Proving termination for logic programs by the query-mapping pairs approach, "Program Development in Computational Logic" (Maurice Bruynooghe and Kung-Kiu Lau, editors), Lecture Notes in Computer Science, volume 3049, 2004, pp. 453-498
  39. Alexander Serebrenik and Danny De Schreye.Hasta-La-Vista: Termination analyzer for logic programs. In Proceedings of the 13th International Workshop on Logic Programming Environments (Fred Mesnard and Alexander Serebrenik, eds.) Published as K.U.Leuven technical report CW-371, November 2003. Preliminary version of this paper appeared also as
    • Alexander Serebrenik and Danny De Schreye. Hasta-La-Vista: Termination analyzer for logic programs, Albert Rubio (ed.) 6th International Workshop on Termination, WST'03, Valencia, Spain, June 13-14, 2003, pp. 55-57
  40. Fred Mesnard and Alexander Serebrenik (eds.) Proceedings of the 13th International Workshop on Logic Programming Environments. Published as K.U.Leuven technical report CW-371, November 2003
  41. Alexander Serebrenik, Termination analysis of logic programs, Ninetheen International Conference on Logic Programming, ICLP 2003, Mumbay, India, December 9-13, 2003, , Lecture Notes in Computer Science 2916, pp. 507-508. (poster)
  42. Alexander Serebrenik and Danny De Schreye, Proving termination with adornments, Proceedings of International Symposium on Logic-based Program Synthesis and Transformation, Uppsala, Sweden (Bruynooghe, M., ed.), 2003, pp.108-109. Preliminary version of this paper appeared also as
    • Alexander Serebrenik and Danny De Schreye. Proving termination with adornments, Albert Rubio (ed.) 6th International Workshop on Termination, WST'03, Valencia, Spain, June 13-14, 2003, pp. 5-7
  43. Danny De Schreye and Alexander Serebrenik. Acceptability with General Orderings. In Fariba Sadri, Antonis Kakas (eds.) Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I. Lecture Notes in Computer Science 2407 Springer Verlag 2002, pp. 187-210. Preliminary version of this paper appeared also
    • Alexander Serebrenik and Danny De Schreye. Termination analysis of logic programs using acceptability with general term orders Technical report, CW-291, May 2000
  44. Alexander Serebrenik and Danny De Schreye.
    On termination of logic programs with floating point computations 9th International Static Analysis Symposium, Madrid, Spain, September 17-20, 2002. Preliminary version of this paper appeared also as
    • Alexander Serebrenik and Danny De Schreye.
      On termination of programs with real numbers computations
      Technical report, CW-331, May 2002.
  45. Sara Cohen, Yaron Kanza ,Yakov Kogan, Werner class=MsoHyperlink> Nutt, Yehoshua Sagiv and Alexander Serebrenik. EquiX: a search and query language for XML, Journal of the American Society for Information Science and Technology 53(6): 454-466, 2002
  46. Alexander Serebrenik and Danny De Schreye.
    Inference of termination conditions for numerical loops in Prolog 8th International Conference on Logic for Programming, AI and Reasoning, Havana, Cuba, December 3-7, 2001. Preliminary versions of this paper appeared as
    • Alexander Serebrenik and Danny De Schreye. Inference of termination conditions for numerical loops, BNAIC'02 - Belgian-Dutch Conference on Artificial Intelligence, Leuven, Belgium, October 21-22, 2002
    • Alexander Serebrenik. Inference of termination conditions for numerical loops < F.N.R.S. meeting on Validation and Verification of Formal Descriptions, ULB, Brussel, June 6, 2001.
    • Alexander Serebrenik. Inference of termination conditions for numerical loops Fifth International Workshop on Termination, Utrecht, The Netherlands, May 20-21, 2001.
    • Alexander Serebrenik and Danny De Schreye. Inference of termination conditions for numerical loops Technical report, CW-308, May 2001
  47. Alexander Serebrenik and Danny De Schreye. On termination of meta-programs 8th International Conference on Logic for Programming, AI and Reasoning, Havana, Cuba, December 3-7, 2001. Preliminary versions of this paper appeared
    • Alexander Serebrenik, and Danny De Schreye. On termination of meta-programs, BNAIC'02 - Belgian-Dutch Conference on Artificial Intelligence, Leuven, Belgium, October 21-22, 2002
    • Alexander Serebrenik. On termination of meta-programs
      Fifth International Workshop on Termination, Utrecht, The Netherlands, May 20-21, 2001
    • Alexander Serebrenik and Danny De Schreye.
      On termination of meta-programs Technical report, CW-306, February 2001
  48. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv and Alexander Serebrenik. A general framework for automatic termination analysis of logic programs In Applicable Algebra in Engineering, Communication and Computing, volume 2001, issue 1/2, 2001. Jürgen Giesl , Pierre Lescanne (eds).
  49. Sara Cohen, Yaron Kanza,Yakov Kogan,Werner Nutt, Yehoshua Sagiv and Alexander Serebrenik. Combining the Power of Searching and Querying In Opher Etzion, Peter Scheuermann (eds.) Proceedings of International Conference on Cooperative Information Systems (CoopIS'2000), Eilat, Israel, September 6-8, 2000 Springer Verlag, Lecture Notes in Computer Science, volume 1901, 2000. Extended version of this paper has been published a technical report 2000-28 of Leibniz Center for Research in Computer Science, Hebrew University, Jerusalem, Israel. June, 2000.
  50. Sara Cohen , Werner Nutt and Alexander Serebrenik. Algorithms for Rewriting Aggregate Queries Using Views Symposium on Advances in Databases and Information Systems, Enlarged Fourth East-European Conference on Advances in Databases and Information Systems, Prague, Czech Republik, September 5-8, 2000 Springer Verlag, Lecture Notes in Computer Science, Vol. 1884, 2000. Extended version of this paper has been published a KULeuven technical report CW-292, May 2000. Preliminary version of this paper appeared also in Proceedings of the International Workshop on Design and Management of Data Warehouses (DMDW'99), June 1999.
  51. Alexander Serebrenik and Danny De Schreye. Non-transformational termination analysis of Logic Programs, based on general term-orderings, Tenth International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR 2000), London, July, 24-28, 2000. Preliminary version of this paper has been published in Technical Report Report Series, Department of Computer Science, University of Manchester, ISSN 1361-6161. Report number UMCS-00-6-1, pp. 45-54. Preliminary version of this paper also appeared as a KULeuven technical report, CW-284, January 2000
  52. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv and Alexander Serebrenik. Automatic Termination Analysis of Programs Containing Arithmetic Predicates Workshop on Verification of Logic Programs, December 1999. Also in ENTCS, volume 30, number 1.
  53. Sara Cohen, Yaron Kanza,Yakov Kogan,Werner Nutt, Yehoshua Sagiv and Alexander Serebrenik. EquiX---Easy Querying in XML Databases In ACM Sigmod Workshop on the Web and Databases (WebDB'99), June 1999.
  54. Sara Cohen , Werner Nutt and Alexander Serebrenik. Rewriting Aggregate Queries Using Views In Proc. 18th Symposium on Principles of Database Systems, June 1999.
  55. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv and Alexander Serebrenik. When Linear Norms Are Not Enough Workshop on Termination, May 1999.
  56. Naomi Lindenstrauss , Yehoshua Sagiv and Alexander Serebrenik. Unfolding the Mystery of Mergesort In Norbert Fuchs (ed.) Proceedings of the Seventh International Workshop on Logic Program Synthesis and Transformation. Springer Verlag, Lecture Notes in Computer Science, volume 1463, 1997.
  57. Naomi Lindenstrauss, Yehoshua Sagiv and Alexander Serebrenik. TermiLog: A System for Checking Termination of Queries to Logic Programs In Orna Grumberg (ed.) Computer Aided Verification, 9th International Conference. Springer Verlag, Lecture Notes in Computer Science, volume 1254, 1997.