Alexander Serebrenik

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
83Process Mining Software Repositories: Do Developers Work as Expected?. Alexander Serebrenik, Wouter Poncin, Mark van den Brand. ERCIM News (2012) (2012). Web SearchBibTeXDownload
82Seeing the Forest for the Trees with New Econometric Aggregation Techniques. Alexander Serebrenik, Mark van den Brand, Bogdan Vasilescu. ERCIM News (2012) (2012). Web SearchBibTeXDownload
2011
81Process Mining Software Repositories. Wouter Poncin, Alexander Serebrenik, Mark van den Brand. CSMR 2011, 5-14. Web SearchBibTeXDownload
80Less is more: unparser-completeness of metalanguages for template engines. B. J. Arnoldus, M. G. J. van den Brand, Alexander Serebrenik. GPCE 2011, 137-146. Web SearchBibTeXDownload
79You can't control the unfamiliar: A study on the relations between aggregation techniques for software metrics. Bogdan Vasilescu, Alexander Serebrenik, Mark van den Brand. ICSM 2011, 313-322. Web SearchBibTeXDownload
78Mining student capstone projects with FRASR and ProM. Wouter Poncin, Alexander Serebrenik, Mark van den Brand. OOPSLA Companion 2011, 87-96. Web SearchBibTeXDownload
77I2SD: Reverse Engineering Sequence Diagrams from Enterprise Java Beans with Interceptors. Serguei A. Roubtsov, Alexander Serebrenik, Aurélien Mazoyer, Mark van den Brand. SCAM 2011, 155-164. Web SearchBibTeXDownload
2010
76Automated Termination Analysis for Logic Programs with Cut. Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann. CoRR (abs/1007.4908) (2010). Web SearchBibTeXDownload
75Detecting Modularity "Smells" in Dependencies Injected with Java Annotations. Serguei A. Roubtsov, Alexander Serebrenik, Mark van den Brand. CSMR 2010, 244-247. Web SearchBibTeXDownload
74An empirical study of the evolution of Eclipse third-party plug-ins. John Businge, Alexander Serebrenik, Mark van den Brand. EVOL/IWPSE 2010, 63-72. Web SearchBibTeXDownload
73Theil index for aggregation of software metrics values. Alexander Serebrenik, Mark van den Brand. ICSM 2010, 1-9. Web SearchBibTeXDownload
72Formally specified type checkers for domain specific languages: experience report. Mark van den Brand, A. P. van der Meer, Alexander Serebrenik, Albert T. Hofkamp. LDTA 2010, 12. Web SearchBibTeXDownload
71Requirements Certification for Offshoring Using LSPCM. Alexander Serebrenik, Amrita Mishra, Thomas Delissen, Martijn Klabbers. QUATIC 2010, 177-182. Web SearchBibTeXDownload
70Automated termination analysis for logic programs with cut. Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann. TPLP (10): 365-381 (2010). Web SearchBibTeXDownload
2009
69Automated termination proofs for logic programs by term rewriting. Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. ACM Trans. Comput. Log. (11) (2009). Web SearchBibTeXDownload
68SQuAVisiT: A Flexible Tool for Visual Software Analytics. Mark van den Brand, Serguei A. Roubtsov, Alexander Serebrenik. CSMR 2009, 331-332. Web SearchBibTeXDownload
67Process Discovery using Integer Linear Programming. Jan Martijn E. M. van der Werf, Boudewijn F. van Dongen, Cor A. J. Hurkens, Alexander Serebrenik. Fundam. Inform. (94): 387-412 (2009). Web SearchBibTeXDownload
66Dn-based architecture assessment of Java Open Source software systems. Alexander Serebrenik, Serguei A. Roubtsov, Mark van den Brand. ICPC 2009, 198-207. Web SearchBibTeXDownload
65Type Checking Evolving Languages with MSOS. M. G. J. van den Brand, A. P. van der Meer, Alexander Serebrenik. Semantics and Algebraic Specification 2009, 207-226. Web SearchBibTeXDownload
64Reverse Engineering Sequence Diagrams for Enterprise JavaBeans with Business Method Interceptors. Alexander Serebrenik, Serguei A. Roubtsov, Ella E. Roubtsova, Mark van den Brand. WCRE 2009, 269-273. Web SearchBibTeXDownload
2008
63Automated Termination Proofs for Logic Programs by Term Rewriting. Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. CoRR (abs/0803.0014) (2008). Web SearchBibTeXDownload
62History-based joins: Semantics, soundness and implementation. Kees M. van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve. Data Knowl. Eng. (64): 24-37 (2008). Web SearchBibTeXDownload
61Working with the Past: Integrating History in Petri Nets. Kees M. van Hee, Alexander Serebrenik, Natalia Sidorova, Wil M. P. van der Aalst. Fundam. Inform. (88): 387-409 (2008). Web SearchBibTeXDownload
60Token History Petri Nets. Kees M. van Hee, Alexander Serebrenik, Natalia Sidorova. Fundam. Inform. (85): 219-234 (2008). Web SearchBibTeXDownload
59Can I find a partner? Undecidability of partner existence for open nets. Peter Massuthe, Alexander Serebrenik, Natalia Sidorova, Karsten Wolf. Inf. Process. Lett. (108): 374-378 (2008). Web SearchBibTeXDownload
58Process Discovery Using Integer Linear Programming. Jan Martijn E. M. van der Werf, Boudewijn F. van Dongen, Cor A. J. Hurkens, Alexander Serebrenik. Petri Nets 2008, 368-387. Web SearchBibTeXDownload
57Improving Prolog programs: Refactoring for Prolog. Alexander Serebrenik, Tom Schrijvers, Bart Demoen. TPLP (8): 201-215 (2008). Web SearchBibTeXDownload
56Recurrence with affine level mappings is P-time decidable for CLP(R). Frédéric Mesnard, Alexander Serebrenik. TPLP (8): 111-119 (2008). Web SearchBibTeXDownload
2007
55Modelling with History-Dependent Petri Nets. Kees M. van Hee, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve, Jan Martijn E. M. van der Werf. BPM 2007, 320-327. Web SearchBibTeXDownload
54Adaptive Workflows for Healthcare Information Systems. Kees M. van Hee, Helen Schonenberg, Alexander Serebrenik, Natalia Sidorova, Jan Martijn E. M. van der Werf. Business Process Management Workshops 2007, 359-370. Web SearchBibTeXDownload
53Fingerprinting Logic Programs. Alexander Serebrenik, Wim Vanhoof. CoRR (abs/cs/0701081) (2007). Web SearchBibTeXDownload
52Improving Prolog programs: Refactoring for Prolog. Alexander Serebrenik, Tom Schrijvers, Bart Demoen. CoRR (abs/cs/0702083) (2007). Web SearchBibTeXDownload
51Recurrence with affine level mappings is P-time decidable for CLP(R). Frédéric Mesnard, Alexander Serebrenik. CoRR (abs/cs/0701082) (2007). Web SearchBibTeXDownload
50Scheduling-free resource management. Kees M. van Hee, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve, Jan van der Wal. Data Knowl. Eng. (61): 59-75 (2007). Web SearchBibTeXDownload
49Termination of Programs using Term Rewriting and SAT Solving. Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik. Deduction and Decision Procedures 2007. Web SearchBibTeXDownload
48Checking Properties of Adaptive Workflow Nets. Kees M. van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve, Irina A. Lomazova. Fundam. Inform. (79): 347-362 (2007). Web SearchBibTeXDownload
47History-Dependent Petri Nets. Kees M. van Hee, Alexander Serebrenik, Natalia Sidorova, Wil M. P. van der Aalst. ICATPN 2007, 164-183. Web SearchBibTeXDownload
46A software framework for automated verification. Ivo Raedts, Marija Petkovic, Alexander Serebrenik, Jan Martijn E. M. van der Werf, Lou J. Somers, Maarten Boote. SAC 2007, 1031-1032. Web SearchBibTeXDownload
45LogLogics: A logic for history-dependent business processes. Kees M. van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve. Sci. Comput. Program. (65): 30-40 (2007). Web SearchBibTeXDownload
2006
44History-Based Joins: Semantics, Soundness and Implementation. Kees M. van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve. Business Process Management 2006, 225-240. Web SearchBibTeXDownload
43Nested Nets for Adaptive Systems. Kees M. van Hee, Irina A. Lomazova, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve. ICATPN 2006, 241-260. Web SearchBibTeXDownload
42Automated Termination Analysis for Logic Programs by Term Rewriting. Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. LOPSTR 2006, 177-193. Web SearchBibTeXDownload
41Modelling History-Dependent Business Processes. Kees M. van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve. MSVVEIS 2006, 76-85. Web SearchBibTeX
2005
40The Price of Coordination in Resource Management. Kees M. van Hee, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve, Jan van der Wal. Business Process Management 2005, 96-108. Web SearchBibTeXDownload
39Proceedings of the 15th Workshop on Logic-based methods in Programming Environments WLPE'05 -- October 5, 2005 -- Sitges (Barcelona), Spain. Alexander Serebrenik, Susana Muńoz-Hernández. CoRR (abs/cs/0508078) (2005). Web SearchBibTeXDownload
38Looking for Stability. Cornelis Huizing, Ruurd Kuiper, Teade Punter, Alexander Serebrenik. DDoPS 2005, 31-44. Web SearchBibTeX
37Analysing the BKE-security Protocol with µCRL. Stefan Blom, Jan Friso Groote, Sjouke Mauw, Alexander Serebrenik. Electr. Notes Theor. Comput. Sci. (139): 49-90 (2005). Web SearchBibTeXDownload
36Soundness of Resource-Constrained Workflow Nets. Kees M. van Hee, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve. ICATPN 2005, 250-267. Web SearchBibTeXDownload
35Termination of Floating-Point Computations. Alexander Serebrenik, Danny De Schreye. J. Autom. Reasoning (34): 141-177 (2005). Web SearchBibTeXDownload
34On termination of meta-programs. Alexander Serebrenik, Danny De Schreye. TPLP (5): 355-390 (2005). Web SearchBibTeXDownload
2004
33Improving Prolog Programs: Refactoring for Prolog. Tom Schrijvers, Alexander Serebrenik. ICLP (cs.SE/0406026): 58-72 (2004). Web SearchBibTeXDownload
32On Termination of Binary CLP Programs. Alexander Serebrenik, Frédéric Mesnard. LOPSTR 2004, 231-244. Web SearchBibTeXDownload
31Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik. Program Development in Computational Logic 2004, 453-498. Web SearchBibTeXDownload
30Inference of termination conditions for numerical loops in Prolog. Alexander Serebrenik, Danny De Schreye. TPLP (4): 719-751 (2004). Web SearchBibTeXDownload
2003
29Termination Analysis of Logic Programs: Extended Abstract. Alexander Serebrenik. ICLP 2003, 507-508. Web SearchBibTeXDownload
28Refactoring Logic Programs: Extended Abstract. Alexander Serebrenik, Bart Demoen. ICLP 2003, 509-510. Web SearchBibTeXDownload
27Proving Termination with Adornments. Alexander Serebrenik, Danny De Schreye. LOPSTR 2003, 108-109. Web SearchBibTeXDownload
26Hasta-La-Vista: Termination Analyser for Logic Programs. Alexander Serebrenik, Danny De Schreye. WLPE 2003, 60-74. Web SearchBibTeX
2002
25Acceptability with General Orderings. Danny De Schreye, Alexander Serebrenik. Computational Logic: Logic Programming and Beyond 2002, 187-210. Web SearchBibTeXDownload
24EquiX - A search and query language for XML. Sara Cohen, Yaron Kanza, Yakov A. Kogan, Yehoshua Sagiv, Werner Nutt, Alexander Serebrenik. JASIST (53): 454-466 (2002). Web SearchBibTeX
23On Termination of Logic Programs with Floating Point Computations. Alexander Serebrenik, Danny De Schreye. SAS 2002, 151-164. Web SearchBibTeXDownload
2001
22A General Framework for Automatic Termination Analysis of Logic Programs. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik. Appl. Algebra Eng. Commun. Comput. (12): 117-156 (2001). Web SearchBibTeXDownload
21Acceptability with general orderings. Danny De Schreye, Alexander Serebrenik. CoRR (cs.PL/0106052) (2001). Web SearchBibTeXDownload
20Inference of termination conditions for numerical loops. Alexander Serebrenik, Danny De Schreye. CoRR (cs.PL/0106053) (2001). Web SearchBibTeXDownload
19Inference of termination conditions for numerical loops in Prolog. Alexander Serebrenik, Danny De Schreye. CoRR (cs.PL/0110034) (2001). Web SearchBibTeXDownload
18On termination of meta-programs. Alexander Serebrenik, Danny De Schreye. CoRR (cs.PL/0110035) (2001). Web SearchBibTeXDownload
17EquiX - A Search and Query Language for XML. Sara Cohen, Yaron Kanza, Yakov A. Kogan, Werner Nutt, Yehoshua Sagiv, Alexander Serebrenik. CoRR (cs.DB/0110044) (2001). Cited by 20Web SearchBibTeXDownload
16Inference of Termination Conditions for Numerical Loops in Prolog. Alexander Serebrenik, Danny De Schreye. LPAR 2001, 654-668. Web SearchBibTeXDownload
15On Termination of Meta-Programs. Alexander Serebrenik, Danny De Schreye. LPAR 2001, 517-530. Web SearchBibTeXDownload
2000
14Algorithms for Rewriting Aggregate Queries Using Views. Sara Cohen, Werner Nutt, Alexander Serebrenik. ADBIS-DASFAA (cs.DB/0011024): 65-78 (2000). Cited by 32Web SearchBibTeXDownload
13Combining the Power of Searching and Querying. Sara Cohen, Yaron Kanza, Yakov A. Kogan, Werner Nutt, Yehoshua Sagiv, Alexander Serebrenik. CoopIS 2000, 54-65. Cited by 12Web SearchBibTeXDownload
12EquiX - A Search and Query Language for XML. Sara Cohen, Yaron Kanza, Yakov A. Kogan, Werner Nutt, Yehoshua Sagiv, Alexander Serebrenik. CoRR (cs.DB/0011041) (2000). Cited by 20Web SearchBibTeXDownload
11A General Framework for Automatic Termination Analysis of Logic Programs. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik. CoRR (cs.PL/0012008) (2000). Web SearchBibTeXDownload
10Termination analysis of logic programs using acceptability with general term orders. Alexander Serebrenik, Danny De Schreye. CoRR (cs.PL/0011025) (2000). Web SearchBibTeXDownload
9Automatic Termination Analysis of Programs Containing Arithmetic Predicates. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik. CoRR (cs.PL/0011036) (2000). Web SearchBibTeXDownload
8Non-tranformational termination analysis of logic programs, based on general term-orderings. Alexander Serebrenik, Danny De Schreye. LOPSTR 2000. Web SearchBibTeX
7Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings. Alexander Serebrenik, Danny De Schreye. LOPSTR (LNCS 2042: Selected Papers) 2000, 69-85. Web SearchBibTeXDownload
1999
6Algorithms for Rewriting Aggregate Queries Using Views. Sara Cohen, Werner Nutt, Alexander Serebrenik. DMDW 1999, 9. Cited by 32Web SearchBibTeXDownload
5Automatic Termination Analysis of Programs Containing Arithmetic Predicates. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik. Electr. Notes Theor. Comput. Sci. (30): 39-58 (1999). Web SearchBibTeXDownload
4Rewriting Aggregate Queries Using Views. Sara Cohen, Werner Nutt, Alexander Serebrenik. PODS 1999, 155-166. Cited by 141Web SearchBibTeX
3EquiX Easy Querying in XML Databases. Sara Cohen, Yaron Kanza, Yakov A. Kogan, Werner Nutt, Yehoshua Sagiv, Alexander Serebrenik. WebDB (Informal Proceedings) 1999, 43-48. Cited by 41Web SearchBibTeXDownload
1997
2TermiLog: A System for Checking Termination of Queries to Logic Programs. Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik. CAV 1997, 444-447. Web SearchBibTeXDownload
1Unfolding the Mystery of Mergesort. Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik. LOPSTR 1997, 206-225. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research