Peer-Reviewed Publications

2010

  • Endrullis, J. and Hendriks, D. and Klop, J.W.
    Modular Construction of Fixed Point Combinators and Clocked Boehm Trees
    In Proc. Conf. on Logic in Computer Science (LICS'10), IEEE Computer Society, 2010.
    To appear.
  • Endrullis, J. and Grabmayer, C. and Hendriks, D. and Isihara, A. and Klop, J.W.
    Productivity of Stream Definitions
    In Theoretical Computer Science, 411(4-5):765-782, 2010.
    Special issue devoted to selected papers from Fundamentals of Computation Theory 2007.
  • Endrullis, J. and Hendriks, D.
    Transforming Outermost into Context-Sensitive Rewriting
    In Logical Methods in Computer Science, 2010.
    Special Issue of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009). To appear.
  • Endrullis, J. and Vrijer, R.C de and Waldmann, J.
    Local Termination: Theory and Practice
    In Logical Methods in Computer Science, Springer, 2010.
    Special Issue of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009). To appear.
  • Endrullis, J. and Grabmayer, C. and Hendriks, D. and Klop, J.W. and van Oostrom, V.
    Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting
    In Proc. Conf. on Rewriting Techniques and Applications (RTA '10), LNCS, Springer, 2010.
    To appear.
  • Bakhshi, R. and Endrullis, J. and Fokkink, W. and Pang, J.
    Brief Announcement: Asynchronous Bounded Expected Delay Networks
    In Proc. Conf. on Principles of Distributed Computing (PODC '10), ACM, 2010.
    To appear.
  • Bakhshi, R. and Endrullis, J. and Endrullis, S. and Fokkink, W. and Haverkort, B.
    Automating the Mean-Field Method for Large Dynamic Networks
    In Proc. Conf. on Quantitative Evaluation of SysTems (QEST '10), IEEE Computer Society, 2010.
    To appear.

2009

  • Endrullis, J. and Grabmayer, C. and Hendriks, D. and Klop, J.W. and Vrijer, R.C de
    Proving Infinitary Normalization
    In Proc. Conf. on Types for Proofs and Programs (TYPES '09), number 5497 in LNCS, pages 64-82. Springer, 2009.
  • Endrullis, J. and Vrijer, R.C de and Waldmann, J.
    Local Termination
    In Proc. Conf. on Rewriting Techniques and Applications (RTA '09), number 5595 in LNCS, pages 270-284. Springer, 2009.
  • Endrullis, J. and Hendriks, D.
    From Outermost to Context-Sensitive Rewriting
    In Proc. Conf. on Rewriting Techniques and Applications (RTA '09), number 5595 in LNCS, pages 305-319. Springer, 2009.
    Best paper award.
  • Endrullis, J. and Grabmayer, C. and Hendriks, D.
    Complexity of Fractran and Productivity
    In Proc. Conf. on Automated Deduction (CADE '09), number 5663 in LNCS, pages 371-387. Springer, 2009.
  • Endrullis, J. and Geuvers, H. and Zantema, H.
    Degrees of Undecidability in Term Rewriting
    In Proc. Conf. on Computer Science Logic (CSL '09), number 5771 in LNCS, pages 255-270. Springer, 2009.

2008

  • Endrullis, J. and Grabmayer, C. and Hendriks, D.
    Data-Oblivious Stream Productivity
    In Proc. Conf. on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '08), number 5330 in LNCS, pages 79-96. Springer, 2008.
  • Endrullis, J. and Waldmann, J. and Zantema, H.
    Matrix Interpretations for Proving Termination of Term Rewriting
    In J. Automated Reasoning, 40(2-3):195-220, Springer, 2008.
  • Endrullis, J. and Vrijer, R.C de
    Reduction Under Substitution
    In Proc. Conf. on Rewriting Techniques and Applications (RTA '08), volume 5117 of LNCS, pages 425-440. Springer, 2008.

2007

2006

  • Endrullis, J. and Waldmann, J. and Zantema, H.
    Matrix Interpretations for Proving Termination of Term Rewriting
    In Proc. Conf. on Automated Reasoning (IJCAR '06), volume 4130 of LNCS, pages 574-588. Springer, 2006.
  • Endrullis, J. and Hofbauer, D. and Waldmann, J.
    Decomposing Terminating Rewrite Relations
    In Proc. Workshop on Termination (WST '06), pages 39-43. 2006.

Miscellaneous

2009

2008