Publications

Danvy, O. (1998). Functional Unparsing. B R I C S Report Series, (RS-98-12).

Danvy, O. & Rose, K. H. (1997). Higher-Order Rewriting and Partial Evaluation. B R I C S Report Series, (RS-97-46).

Danvy, O. & Schultz, U. P. (1997). Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure. B R I C S Report Series, (RS-97-6).

Danvy, O. & Schultz, U. P. (1998). Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure. B R I C S Report Series, (RS-98-54).

Danvy, O. & Schultz, U. P. (1999). Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure. B R I C S Report Series, (RS-99-27).

Danvy, O. & Schultz, U. P. (2002). Lambda-Lifting in Quadratic Time. B R I C S Report Series, (RS-02-30).

Danvy, O. & Schultz, U. P. (2003). Lambda-Lifting in Quadratic Time. B R I C S Report Series, (RS-03-26).

Danvy, O. & Schultz, U. P. (2004). Lambda-Lifting in Quadratic Time. B R I C S Report Series, (RS-04-12).

Danvy, O., Dzafic, B. & Pfenning, F. (1999). On proving syntactic properties of CPS programs. B R I C S Report Series, (RS-99-23).

Danvy, O. & Malmkjær, K. (1996). On the Idempotence of the CPS Transformation. B R I C S Report Series, (RS-96-14).

Danvy, O. (1997). Online Type-Directed Partial Evaluation. B R I C S Report Series, (RS-97-53).

Danvy, O. & Goldberg, M. (1997). Partial Evaluation of the Euclidian Algorithm. B R I C S Report Series, (RS-97-1).

Danvy, O. (1996). Pragmatic Aspects of Type-Directed Partial Evaluation. B R I C S Report Series, (RS-96-15).

Danvy, O. & Vestergaard, R. (1996). Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation. B R I C S Report Series, (RS-96-13).

Danvy, O. & Lopez, P. E. M. (2003). Tagging, Encoding, and Jones Optimality. B R I C S Report Series, (RS-03-2).

Danvy, O. & Goldberg, M. (2002). There and Back Again. B R I C S Report Series, (RS-02-12).

Danvy, O. (1998). Type-Directed Partial Evaluation. BRICS Lecture Series, (LS-98-3).

Danvy, O. & Midtgaard, J. (2011). Abstracting abstract machines: technical perspective. Association for Computing Machinery. Communications, 54(9), 100-100. https://doi.org/10.1145/1995376.1995399

Danvy, O. (2011). Pragmatics for formal semantics. In Proceedings of the 10th ACM International Conference on Generative Programming and Component Engineering (pp. 93-94). Association for Computing Machinery. https://doi.org/10.1145/2047862.2047878

Danvy, O. & Shan, C. (Eds.) (2011). Proceedings IFIP Working Conference on Domain-Specific Languages. https://doi.org/10.4204/EPTCS.66

Danvy, O. & Zerny, I. (2013). Three Syntactic Theories for Combinatory Graph Reduction. A C M Transactions on Computational Logic, 14(4), Article 29. https://doi.org/10.1145/2528932

Danvy, O., Millikin, K., Munk, J. & Zerny, I. (2012). On Inter-deriving Small-step and Big-step Semantics: A Case Study for Storeless Call-by-need Evaluation. Theoretical Computer Science, 435, 21–42. https://doi.org/10.1016/j.tcs.2012.02.023

Danvy, O. & Johannsen, J. (2014). From Outermost Reduction Semantics to Abstract Machine. In G. Gupta & R. Ricardo Peña (Eds.), 23rd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2013: Revised Selected Papers (pp. 91-98). Springer VS. https://doi.org/10.1007/978-3-319-14125-1

Danvy, O., Thiemann, P. & Zerny, I. (2013). Circularity and Lambda Abstraction. In Proceedings, The 25th symposium on Implementation and Application of Functional Languages. ScienceGate. http://www.sciencegate.ch/home?p_p_id=new_search_portlet_WAR_PSW_3_SciencegatePortlets&p_p_lifecycle=1&p_p_state=normal&p_p_mode=view&p_p_col_id=column-3&p_p_col_pos=1&p_p_col_count=4&_new_search_portlet_WAR_PSW_3_SciencegatePortlets_action=search&_new_search_portlet_WAR_PSW_3_SciencegatePortlets_field=dc.source&_new_search_portlet_WAR_PSW_3_SciencegatePortlets_mode=mode.exact&_new_search_portlet_WAR_PSW_3_SciencegatePortlets_sort=&_new_search_portlet_WAR_PSW_3_SciencegatePortlets_query=The+25th+symposium+on+Implementation+and+Application+of+Functional+Languages.

Danvy, O. (Ed.) (2015). 2015 Workshop on Continuations: pre-proceedings. Department of Computer Science, University of Aarhus. https://doi.org/10.7146/aul.4.4

Danvy, O. & Johannsen, J. (2015). From Outermost Reduction Semantics to Abstract Machine. Department of Computer Science, University of Aarhus. https://doi.org/10.7146/aul.3.2

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).

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. (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). 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. (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). 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

Damian, D. & Danvy, O. (2001). Static Transition Compression. In W. Taha (Ed.), Semantics, Applications, and Implementation of Program Generation: Second International Workshop, SAIG 2001 Florence, Italy, September 6, 2001 Proceedings (pp. 92-107). Springer. https://doi.org/10.1007/3-540-44806-3_6

Damian, D. & Danvy, O. (2000). Syntactic accidents in program analysis: on the impact of the CPS transformation. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (pp. 209-220). Association for Computing Machinery.

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

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

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

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. & Schwartzbach, M. I. (2002). Static Analysis for Dynamic XML. In E-Proceeding of PLAN-X 2002 http://homepages.inf.ed.ac.uk/wadler/planx/planx-eproceed/papers/E00-1868950904.pdf

Christensen, A. S., Møller, A. & Schwartzbach, M. I. (2003). Precise Analysis of String Expressions. In Static Analysis: 10th International Symposium, SAS 2003 San Diego, CA, USA, June 11-13, 2003 Proceedings (pp. 1-18). Springer. https://doi.org/10.1007/3-540-44898-5_1

Christensen, A. S., Kirkegaard, C. & Møller, A. (2004). A Runtime System for XML Transformations in Java. In Z. Bellahsene, T. Milo, M. Rys, D. Suciu & R. Unland (Eds.), Database and XML Technologies: Second International XML Database Symposium, XSym 2004, Toronto, Canada, August 29-30, 2004. Proceedings (pp. 143-157). Springer. https://doi.org/10.1007/978-3-540-30081-6_11

Chin, W., Danvy, O. & Thiemann, P. (2004). Editorial: Theme Issue on Partial Evaluation and Semantics-Based Program Manipulation. Higher-Order and Symbolic Computation, 17(1-2), 5-6. https://doi.org/10.1023/B:LISP.0000029481.73168.ef

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

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

Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K. & Pavlogiannis, A. (2018). Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Transactions on Programming Languages and Systems, 40(3), Article 9. https://doi.org/10.1145/3210257

Chatterjee, K., Pavlogiannis, A., Koessler, A. & Schmid, U. (2018). Automated competitive analysis of real-time scheduling with graph games. Real-Time systems, 54(1), 166-207. https://doi.org/10.1007/s11241-017-9293-4

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., 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

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

Displaying results 301 to 350 out of 439

Revised 17.04.2023

Sofia Hedegaard Rasmussen

Department of Computer Science

Publications

Magnus Madsen

Andreas Pavlogiannis

Publications

Faculty

Magnus Madsen

Andreas Pavlogiannis