Find

For students
For PhDs
For employees

Department of Computer Science

Publications

Contribution to journal

Danvy, O. & Millikin, K. (2007). On the Equivalence between Small-Step and Big-Step Abstract Machines: A Simple Application of Lightweight Fusion. B R I C S Report Series, (RS-07-16), i-11.

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. & Goldberg, M. (1997). Partial Evaluation of the Euclidian Algorithm. Higher-Order and Symbolic Computation, 10(2), 101-111. https://doi.org/10.1023/A:1007736916360

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. & Nielsen, L. R. (2004). Refocusing in Reduction Semantics. B R I C S Report Series, (RS-04-26).

Danvy, O. & Millikin, K. (2009). Refunctionalization at Work. Science of Computer Programming, 74(8), 534-549. https://doi.org/10.1016/j.scico.2009.02.001

Danvy, O. & Millikin, K. (2007). Refunctionalization at Work. B R I C S Report Series, (RS-07-7).

Danvy, O., Hentze, N. & Malmkjær, K. (1996). Resource-bounded partial evaluation. A C M Computing Surveys, 28(2), 329-332. https://doi.org/10.1145/234528.234741

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. (2004). Sur un Exemple de Patrick Greussay. B R I C S Report Series, (RS-04-41).

Danvy, O. & Nielsen, L. R. (2001). Syntactic Theories in Practice. B R I C S Report Series, (RS-01-31).

Danvy, O. & Nielsen, L. R. (2002). Syntactic Theories in Practice. B R I C S Report Series, (RS-02-4).

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

Danvy, O., Malmkjær, K. & Palsberg, J. (1995). The essence of eta-expansion in partial evaluation. Higher-Order and Symbolic Computation, 8(3), 209-227. https://doi.org/10.1007/BF01019004

Danvy, O. & Goldberg, M. (2001). There and Back Again. B R I C S Report Series, (RS-01-39).

Danvy, O. & Goldberg, M. (2005). There and Back Again. Fundamenta Informaticae, 66(4), 397-413.

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

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. (2009). Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines. Lecture Notes in Computer Science, 5700, 162-185. https://doi.org/10.1007/978-3-642-04164-8_9

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

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

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

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., Goharshady, A. K., Okati, N. & Pavlogiannis, A. (2019). Efficient Parameterized Algorithms for Data Packing. Proceedings of the ACM on Programming Languages, 3(POPL), Article 53. https://doi.org/10.1145/3290366

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

Brendborg, J., Karras, P., Pavlogiannis, A., Rasmussen, A. U. & Tkadlec, J. (2022). Fixation Maximization in the Positional Moran Process. Proceedings of the AAAI Conference on Artificial Intelligence, 36(9, AAAI Technical Track on Multiagent Systems), 9304-9312. https://doi.org/10.1609/aaai.v36i9.21160

Brabrand, C., Giegerich, R. & Møller, A. (2006). Analyzing Ambiguity of Context-Free Grammars. B R I C S Report Series, (RS-06-09).

Brabrand, C., Giegerich, R. & Møller, A. (2010). Analyzing Ambiguity of Context-Free Grammars. Science of Computer Programming, 75(3), 176-191. https://doi.org/10.1016/j.scico.2009.11.002

Brabrand, C., Møller, A., Sandholm, A. & Schwartzbach, M. I. (1999). A Runtime System for Interactive Web Services. Computer Networks, 31(11-16), 1391-1401. https://doi.org/10.1016/S1389-1286(99)00025-0

Brabrand, C., Møller, A. & Schwartzbach, M. I. (2008). Dual Syntax for XML Languages. Information Systems, 33(4), 385-406. https://doi.org/10.1016/j.is.2008.01.006

Brabrand, C., Møller, A., Olesen, S. & Schwartzbach, M. I. (2002). Language-Based Caching of Dynamically Generated HTML. World Wide Web (New York), 5(4), 305-323. https://doi.org/10.1023/A:1021020226173

Brabrand, C., Møller, A., Ricky, M. & Schwartzbach, M. I. (2000). PowerForms: Declarative Client-side Form Field Validation. World Wide Web (New York), 3(4), 205-214. https://doi.org/10.1023/A:1018772405468

Brabrand, C., Møller, A. & Schwartzbach, M. I. (2002). The <bigwig> Project. A C M Transactions on Internet Technology, 2(2), 79-114. https://doi.org/10.1145/514183.514184

Displaying results 351 to 400 out of 439

8

Revised 17.04.2023

-

Sofia Hedegaard Rasmussen