| 2008 |
|---|
| 64 | EE | Jan Martijn E. M. van der Werf,
Boudewijn F. van Dongen,
Cor A. J. Hurkens,
Alexander Serebrenik:
Process Discovery Using Integer Linear Programming.
Petri Nets 2008: 368-387 |
| 63 | EE | Peter Schneider-Kamp,
Jürgen Giesl,
Alexander Serebrenik,
René Thiemann:
Automated Termination Proofs for Logic Programs by Term Rewriting
CoRR abs/0803.0014: (2008) |
| 62 | EE | Kees M. van Hee,
Olivia Oanea,
Alexander Serebrenik,
Natalia Sidorova,
Marc Voorhoeve:
History-based joins: Semantics, soundness and implementation.
Data Knowl. Eng. 64(1): 24-37 (2008) |
| 61 | EE | Frédéric Mesnard,
Alexander Serebrenik:
Recurrence with affine level mappings is P-time decidable for CLP(R).
TPLP 8(1): 111-119 (2008) |
| 60 | EE | Alexander Serebrenik,
Tom Schrijvers,
Bart Demoen:
Improving Prolog programs: Refactoring for Prolog.
TPLP 8(2): 201-215 (2008) |
| 2007 |
|---|
| 59 | EE | Kees M. van Hee,
Alexander Serebrenik,
Natalia Sidorova,
Marc Voorhoeve,
Jan Martijn E. M. van der Werf:
Modelling with History-Dependent Petri Nets.
BPM 2007: 320-327 |
| 58 | EE | Kees M. van Hee,
Helen Schonenberg,
Alexander Serebrenik,
Natalia Sidorova,
Jan Martijn E. M. van der Werf:
Adaptive Workflows for Healthcare Information Systems.
Business Process Management Workshops 2007: 359-370 |
| 57 | EE | 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 2007 |
| 56 | EE | Kees M. van Hee,
Alexander Serebrenik,
Natalia Sidorova,
Wil M. P. van der Aalst:
History-Dependent Petri Nets.
ICATPN 2007: 164-183 |
| 55 | EE | Ivo Raedts,
Marija Petkovic,
Alexander Serebrenik,
Jan Martijn E. M. van der Werf,
Lou J. Somers,
Maarten Boote:
A software framework for automated verification.
SAC 2007: 1031-1032 |
| 54 | EE | Alexander Serebrenik,
Wim Vanhoof:
Fingerprinting Logic Programs
CoRR abs/cs/0701081: (2007) |
| 53 | EE | Frédéric Mesnard,
Alexander Serebrenik:
Recurrence with affine level mappings is P-time decidable for CLP(R)
CoRR abs/cs/0701082: (2007) |
| 52 | EE | Alexander Serebrenik,
Tom Schrijvers,
Bart Demoen:
Improving Prolog programs: Refactoring for Prolog
CoRR abs/cs/0702083: (2007) |
| 51 | EE | Kees M. van Hee,
Alexander Serebrenik,
Natalia Sidorova,
Marc Voorhoeve,
Jan van der Wal:
Scheduling-free resource management.
Data Knowl. Eng. 61(1): 59-75 (2007) |
| 50 | EE | Kees M. van Hee,
Olivia Oanea,
Alexander Serebrenik,
Natalia Sidorova,
Marc Voorhoeve,
Irina A. Lomazova:
Checking Properties of Adaptive Workflow Nets.
Fundam. Inform. 79(3-4): 347-362 (2007) |
| 49 | EE | Kees M. van Hee,
Olivia Oanea,
Alexander Serebrenik,
Natalia Sidorova,
Marc Voorhoeve:
LogLogics: A logic for history-dependent business processes.
Sci. Comput. Program. 65(1): 30-40 (2007) |
| 2006 |
|---|
| 48 | EE | Kees M. van Hee,
Olivia Oanea,
Alexander Serebrenik,
Natalia Sidorova,
Marc Voorhoeve:
History-Based Joins: Semantics, Soundness and Implementation.
Business Process Management 2006: 225-240 |
| 47 | EE | Kees M. van Hee,
Irina A. Lomazova,
Olivia Oanea,
Alexander Serebrenik,
Natalia Sidorova,
Marc Voorhoeve:
Nested Nets for Adaptive Systems.
ICATPN 2006: 241-260 |
| 46 | EE | Peter Schneider-Kamp,
Jürgen Giesl,
Alexander Serebrenik,
René Thiemann:
Automated Termination Analysis for Logic Programs by Term Rewriting.
LOPSTR 2006: 177-193 |
| 45 | | Kees M. van Hee,
Olivia Oanea,
Alexander Serebrenik,
Natalia Sidorova,
Marc Voorhoeve:
Modelling History-Dependent Business Processes.
MSVVEIS 2006: 76-85 |
| 2005 |
|---|
| 44 | EE | Alexander Serebrenik,
Susana Muñoz-Hernández:
Proceedings of the 15th International Workshop on Logic Programming Environments, Sitges (Barcelona), October 5, 2005
WLPE 2005 |
| 43 | EE | Kees M. van Hee,
Alexander Serebrenik,
Natalia Sidorova,
Marc Voorhoeve,
Jan van der Wal:
The Price of Coordination in Resource Management.
Business Process Management 2005: 96-108 |
| 42 | | Cornelis Huizing,
Ruurd Kuiper,
Teade Punter,
Alexander Serebrenik:
Looking for Stability.
DDoPS 2005: 31-44 |
| 41 | EE | Kees M. van Hee,
Alexander Serebrenik,
Natalia Sidorova,
Marc Voorhoeve:
Soundness of Resource-Constrained Workflow Nets.
ICATPN 2005: 250-267 |
| 40 | EE | Alexander Serebrenik,
Susana Muñoz-Hernández:
Proceedings of the 15th Workshop on Logic-based methods in Programming Environments WLPE'05 -- October 5, 2005 -- Sitges (Barcelona), Spain
CoRR abs/cs/0508078: (2005) |
| 39 | EE | Stefan Blom,
Jan Friso Groote,
Sjouke Mauw,
Alexander Serebrenik:
Analysing the BKE-security Protocol with µCRL.
Electr. Notes Theor. Comput. Sci. 139(1): 49-90 (2005) |
| 38 | EE | Alexander Serebrenik,
Danny De Schreye:
Termination of Floating-Point Computations.
J. Autom. Reasoning 34(2): 141-177 (2005) |
| 37 | EE | Alexander Serebrenik,
Danny De Schreye:
On termination of meta-programs.
TPLP 5(3): 355-390 (2005) |
| 2004 |
|---|
| 36 | EE | Tom Schrijvers,
Alexander Serebrenik:
Improving Prolog Programs: Refactoring for Prolog.
ICLP 2004: 58-72 |
| 35 | EE | Alexander Serebrenik,
Frédéric Mesnard:
On Termination of Binary CLP Programs.
LOPSTR 2004: 231-244 |
| 34 | EE | Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach.
Program Development in Computational Logic 2004: 453-498 |
| 33 | EE | Tom Schrijvers,
Alexander Serebrenik:
Improving Prolog Programs: Refactoring for Prolog
CoRR cs.SE/0406026: (2004) |
| 32 | | Alexander Serebrenik,
Danny De Schreye:
Inference of termination conditions for numerical loops in Prolog.
TPLP 4(5-6): 719-751 (2004) |
| 2003 |
|---|
| 31 | | Frédéric Mesnard,
Alexander Serebrenik:
Proceedings of the 13th International Workshop on Logic Programming Environments, Tata Institute of Fundamental Research, Mumbai, India, December 8, 2003
Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan 200A, B-3001 Heverlee (Belgium) 2003 |
| 30 | EE | Alexander Serebrenik:
Termination Analysis of Logic Programs: Extended Abstract.
ICLP 2003: 507-508 |
| 29 | EE | Alexander Serebrenik,
Bart Demoen:
Refactoring Logic Programs: Extended Abstract.
ICLP 2003: 509-510 |
| 28 | EE | Alexander Serebrenik,
Danny De Schreye:
Proving Termination with Adornments.
LOPSTR 2003: 108-109 |
| 27 | | Alexander Serebrenik,
Danny De Schreye:
Hasta-La-Vista: Termination Analyser for Logic Programs.
WLPE 2003: 60-74 |
| 2002 |
|---|
| 26 | EE | Danny De Schreye,
Alexander Serebrenik:
Acceptability with General Orderings.
Computational Logic: Logic Programming and Beyond 2002: 187-210 |
| 25 | EE | Alexander Serebrenik,
Danny De Schreye:
On Termination of Logic Programs with Floating Point Computations.
SAS 2002: 151-164 |
| 24 | | Sara Cohen,
Yaron Kanza,
Yakov A. Kogan,
Yehoshua Sagiv,
Werner Nutt,
Alexander Serebrenik:
EquiX - A search and query language for XML.
JASIST 53(6): 454-466 (2002) |
| 2001 |
|---|
| 23 | EE | Alexander Serebrenik,
Danny De Schreye:
On Termination of Meta-Programs.
LPAR 2001: 517-530 |
| 22 | EE | Alexander Serebrenik,
Danny De Schreye:
Inference of Termination Conditions for Numerical Loops in Prolog.
LPAR 2001: 654-668 |
| 21 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
A General Framework for Automatic Termination Analysis of Logic Programs.
Appl. Algebra Eng. Commun. Comput. 12(1/2): 117-156 (2001) |
| 20 | EE | Sara Cohen,
Yaron Kanza,
Yakov A. Kogan,
Werner Nutt,
Yehoshua Sagiv,
Alexander Serebrenik:
EquiX - A Search and Query Language for XML
CoRR cs.DB/0110044: (2001) |
| 19 | EE | Danny De Schreye,
Alexander Serebrenik:
Acceptability with general orderings
CoRR cs.PL/0106052: (2001) |
| 18 | EE | Alexander Serebrenik,
Danny De Schreye:
Inference of termination conditions for numerical loops
CoRR cs.PL/0106053: (2001) |
| 17 | EE | Alexander Serebrenik,
Danny De Schreye:
Inference of termination conditions for numerical loops in Prolog
CoRR cs.PL/0110034: (2001) |
| 16 | EE | Alexander Serebrenik,
Danny De Schreye:
On termination of meta-programs
CoRR cs.PL/0110035: (2001) |
| 2000 |
|---|
| 15 | EE | Sara Cohen,
Werner Nutt,
Alexander Serebrenik:
Algorithms for Rewriting Aggregate Queries Using Views.
ADBIS-DASFAA 2000: 65-78 |
| 14 | EE | Sara Cohen,
Yaron Kanza,
Yakov A. Kogan,
Werner Nutt,
Yehoshua Sagiv,
Alexander Serebrenik:
Combining the Power of Searching and Querying.
CoopIS 2000: 54-65 |
| 13 | EE | Alexander Serebrenik,
Danny De Schreye:
Non-tranformational termination analysis of logic programs, based on general term-orderings.
LOPSTR 2000 |
| 12 | EE | Alexander Serebrenik,
Danny De Schreye:
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings.
LOPSTR (LNCS 2042: Selected Papers) 2000: 69-85 |
| 11 | EE | Sara Cohen,
Werner Nutt,
Alexander Serebrenik:
Algorithms for Rewriting Aggregate Queries Using Views
CoRR cs.DB/0011024: (2000) |
| 10 | EE | Sara Cohen,
Yaron Kanza,
Yakov A. Kogan,
Werner Nutt,
Yehoshua Sagiv,
Alexander Serebrenik:
EquiX - A Search and Query Language for XML
CoRR cs.DB/0011041: (2000) |
| 9 | EE | Alexander Serebrenik,
Danny De Schreye:
Termination analysis of logic programs using acceptability with general term orders
CoRR cs.PL/0011025: (2000) |
| 8 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
CoRR cs.PL/0011036: (2000) |
| 7 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
A General Framework for Automatic Termination Analysis of Logic Programs
CoRR cs.PL/0012008: (2000) |
| 1999 |
|---|
| 6 | EE | Sara Cohen,
Werner Nutt,
Alexander Serebrenik:
Algorithms for Rewriting Aggregate Queries Using Views.
DMDW 1999: 9 |
| 5 | EE | Sara Cohen,
Werner Nutt,
Alexander Serebrenik:
Rewriting Aggregate Queries Using Views.
PODS 1999: 155-166 |
| 4 | EE | Sara Cohen,
Yaron Kanza,
Yakov A. Kogan,
Werner Nutt,
Yehoshua Sagiv,
Alexander Serebrenik:
EquiX Easy Querying in XML Databases.
WebDB (Informal Proceedings) 1999: 43-48 |
| 3 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
Automatic Termination Analysis of Programs Containing Arithmetic Predicates.
Electr. Notes Theor. Comput. Sci. 30(1): (1999) |
| 1997 |
|---|
| 2 | | Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
TermiLog: A System for Checking Termination of Queries to Logic Programs.
CAV 1997: 444-447 |
| 1 | EE | Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
Unfolding the Mystery of Mergesort.
LOPSTR 1997: 206-225 |
