Find

For students
For PhDs
For employees

Department of Computer Science

Publications

Contribution to journal

Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R. & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraicqueries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems, 41(4), Article 23. https://doi.org/10.1145/3363525

Chatterjee, K., Ibsen-Jensen, R. & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design, 57(3), 401-428. https://doi.org/10.1007/s10703-021-00373-5

Chatterjee, K., Choudhary, B. & Pavlogiannis, A. (2018). Optimal Dyck Reachability for Data-Dependence and Alias Analysis. Proceedings of the ACM on Programming Languages, 2(POPL), Article 30. https://dl.acm.org/doi/abs/10.1145/3158118

Chatterjee, K., Svoboda, J., Žikelić, Đ., Pavlogiannis, A. & Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E, 106(3), Article 034321. https://doi.org/10.1103/PhysRevE.106.034321

Chatterjee, K., Pavlogiannis, A. & Toman, V. (2019). Value-centric Dynamic Partial Order Reduction. Proceedings of the ACM on Programming Languages, 3(OOPSLA), Article 124. https://doi.org/10.1145/3360550

Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A. & Spirakis, P. G. (2011). All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model. Mathematical Foundations of Computer Science 2010, Lecture Notes in Computer Science, 6281, 270. https://doi.org/10.1007/978-3-642-15155-2_25

Cherabini, L. & Danvy, O. (2011). A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration. Journal of Formalized Reasoning, 4(1), 85-109. http://jfr.cib.unibo.it/article/view/2225

Christensen, A. S., Møller, A. & Schwartzbach, M. I. (2003). Extending Java for High-Level Web Service Construction. A C M Transactions on Programming Languages and Systems, 25(6), 814-875. https://doi.org/10.1145/945885.945890

Christensen, A. S. & Møller, A. (2002). JWIG User Manual. B R I C S Notes Series, (NS-02-6).

Clausen, C., Danvy, O. & Masuko, M. (2014). A Characterization of Moessner's Sieve. Theoretical Computer Science, 546(August), 244–256. https://doi.org/10.1016/j.tcs.2014.03.012

Damian, D. & Danvy, O. (2001). A Simple CPS Transformation of Control-Flow Information. B R I C S Report Series, (RS-01-55).

Damian, D. & Danvy, O. (2002). A Simple CPS Transformation of Control-Flow Information. Logic Journal of the IGPL, 10(5), 501-515. https://doi.org/10.1093/jigpal/10.5.501

Damian, D. & Danvy, O. (2003). CPS Transformation of Flow Information, Part II: Administrative Reductions. Journal of Functional Programming, 13(5), 925-933. https://doi.org/10.1017/S0956796803004702

Damian, D. & Danvy, O. (2002). CPS Transformation of Flow Information, Part II: Administrative Reductions. B R I C S Report Series, (RS-02-36).

Damian, D. & Danvy, O. (2001). CPS Transformation of Flow Information, Part II: Administrative Reductions. B R I C S Report Series, (RS-01-40).

Damian, D. & Danvy, O. (2001). Syntactic Accidents in Program Analysis: On the Impact of the CPS Transformation. B R I C S Report Series, (RS-01-54).

Damian, D. & Danvy, O. (2003). Syntactic accidents in program analysis: on the impact of the CPS transformation. Journal of Functional Programming, 13(5), 867-904. https://doi.org/10.1017/S0956796802004379

Daniel, D. & Danvy, O. (2000). Syntactic Accidents in Program Analysis: On the Impact of the CPS Transformation. B R I C S Report Series, (RS-00-15).

Danvy, O., Glück, R. & Thiemann, P. (1998). 1998 Symposium on Partial Evaluation. A C M Computing Surveys, 30(3). https://doi.org/10.1145/292469.293684

Danvy, O. & Nielsen, L. R. (2003). A First-Order One-Pass CPS Transformation. Theoretical Computer Science, 308(1), 239-257.

Danvy, O. & Nielsen, L. R. (2001). A First-Order One-Pass CPS Transformation. B R I C S Report Series, RS-01-49.

Danvy, O. & Nielsen, L. R. (2000). A Higher-Order Colon Translation. B R I C S Report Series, (RS-00-33).

Danvy, O. (2002). A Lambda-Revelation of the SECD Machine. B R I C S Report Series, (RS-02-53).

Danvy, O. (2002). A New One-Pass Transformation into Monadic Normal Form. B R I C S Report Series, (RS-02-52).

Danvy, O. (1998). An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. B R I C S Report Series, (RS-98-2).

Danvy, O. (1999). An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. B R I C S Report Series, (RS-99-21).

Danvy, O. & Yang, Z. (1998). An Operational Investigation of the CPS Hierarchy. B R I C S Report Series, (RS-98-35).

Danvy, O. & Millikin, K. (2006). A Rational Deconstruction of Landin's J Operator. B R I C S Report Series, (RS-06-17). http://www.brics.dk/RS/06/17/BRICS-RS-06-17.pdf

Danvy, O. & Millikin, K. (2007). A Rational Deconstruction of Landin's J Operator. Lecture Notes in Computer Science, 4015, 55-73.

Danvy, O. (2003). A Rational Deconstruction of Landin's SECD Machine. B R I C S Report Series, (RS-03-33).

Danvy, O. & Millikin, K. (2008). A Rational Deconstruction of Landin's SECD Machine with the J Operator. Logical Methods in Computer Science, 4(4:12), 1.

Danvy, O. & Millikin, K. (2007). A Simple Application of Lightweight Fusion to Proving the Equivalence of Abstract Machines. B R I C S Report Series, (RS-07-8).

Danvy, O. (1998). A Simple Solution to Type Specialization. B R I C S Report Series, (RS-98-1).

Danvy, O. & Rhiger, M. (2000). A Simple Take on Typed Abstract Syntax in Haskell-Like Languages. B R I C S Report Series, (RS-00-34).

Danvy, O., Grobauer, B. & Rhiger, M. (2001). A Unifying Approach to Goal-Directed Evaluation. New Generation Computing, 20(1), 53-74. https://doi.org/10.1007/BF03037259

Danvy, O., Grobauer, B. & Rhiger, M. (2001). A Unifying Approach to Goal-Directed Evaluation. B R I C S Report Series, (RS-01-29).

Danvy, O. & Lawall, J. (1996). Back to Direct Style II: First-Class Continuations. B R I C S Report Series, (RS-96-20).

Danvy, O. & Rhiger, M. (1998). Compiling Actions by Partial Evaluation, Revisited. B R I C S Report Series, (RS-98-13).

Danvy, O. & Nielsen, L. R. (2004). CPS Transformation of Beta-Redexes. B R I C S Report Series, (RS-04-39).

Danvy, O. & Nielsen, L. (2005). CPS Transformation of Beta-Redexes. Information Processing Letters, 94(5), 217-224. https://doi.org/10.1016/j.ipl.2005.02.002

Danvy, O. & Nielsen, L. R. (2000). CPS Transformation of Beta-Redexes. B R I C S Report Series, (RS-00-35).

Danvy, O. & Nielsen, L. R. (2001). Defunctionalization at Work. B R I C S Report Series, (RS-01-23).

Danvy, O., Malmkjær, K. & Palsberg, J. (1996). Eta-expansion does The Trick. ACM Transactions on Programming Langauges and Systems (TOPLAS), 18(6), 730-751. https://doi.org/10.1145/236114.236119

Danvy, O., Malmkjær, K. & Palsberg, J. (1995). Eta-Expansion Does The Trick. B R I C S Report Series, (RS-95-41).

Danvy, O., Malmkjær, K. & Palsberg, J. (1996). Eta-Expansion Does The Trick. B R I C S Report Series, (RS-96-17).

Danvy, O. (1999). Formalizing Implementation Strategies for First-Class Continuations. B R I C S Report Series, (RS-99-51).

Danvy, O. (1998). Formatting Strings in ML. B R I C S Report Series, (RS-98-5).

Danvy, O. (2005). From Reduction-based to Reduction-free Normalization. Electronic Notes in Theoretical Computer Science, 124(2), 79-100.

Danvy, O. (2004). From Reduction-Based to Reduction-Free Normalization. B R I C S Report Series, (RS-04-30).

Danvy, O. (2000). Functional unparsing. Journal of Functional Programming, 621-625.

Displaying results 51 to 100 out of 444

2

Revised 17.04.2023

-

Sofia Hedegaard Rasmussen