Publications

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., Ibsen-Jensen, R. & Pavlogiannis, A. (2020). Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. In P. Müller (Ed.), Programming Languages and Systems- 29th European Symposium on Programming, ESOP 2020 held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Proceedings (pp. 112-140). Springer. https://doi.org/10.1007/978-3-030-44914-8_5

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., Ibsen-Jensen, R. & Pavlogiannis, A. (2021). Quantitative Verification on Product Graphs of Small Treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021) (Vol. ´, pp. 42:1-42:23). Article 42 https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42

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

Chakravarty, M. (Ed.), Hu, Z. (Ed.) & Danvy, O. (2011). Proceedings of the 16th ACM SIGPLAN international conference on Functional programming. Association for Computing Machinery. http://dl.acm.org/citation.cfm?id=2034773&coll=DL&dl=ACM&CFID=108524911&CFTOKEN=41587659

Caltais, G., Hojjat, H., Mousavi, M. R. & Tunç, H. C. (2022). DyNetKAT: An Algebra of Dynamic Networks. In P. Bouyer & L. Schröder (Eds.), Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings (pp. 184-204). Springer. https://doi.org/10.1007/978-3-030-99253-8_10

Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A. & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages , 5(OOPSLA), Article 164. https://doi.org/10.1145/3485541

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., Møller, A. & Schwartzbach, M. I. (2005). Dual Syntax for XML Languages. In Database Programming Languages: 10th International Workshop, DBPL 2005, Trondheim, Norway, August 28-29, 2005, Revised Selected Papers (pp. 27-41). Springer. https://doi.org/10.1007/11601524_2

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. & Schwartzbach, M. I. (2001). Static Validation of Dynamically Generated HTML. In Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (pp. 38-45). Association for Computing Machinery. https://doi.org/10.1145/379605.379657

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

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., 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., Giegerich, R. & Møller, A. (2006). Analyzing Ambiguity of Context-Free Grammars. B R I C S Report Series, (RS-06-09).

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., Giegerich, R. & Møller, A. (2007). Analyzing Ambiguity of Context-Free Grammars. In Proc. 12th International Conference on Implementation and Application of Automata

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. In Proceedings of the 8th International World Wide Web Conference Elsevier.

Böttger, H., Møller, A. & Schwartzbach, M. I. (2006). Contracts for Cooperation between Web Service Programmers and HTML Designers. Journal of Web Engineering, 5(1), 65-90.

Bonsangue, M., Caltais, G., Feng, H. & Tunç, H. C. (2022). A Language-Based Causal Model for Safety. In Y. Aït-Ameur & F. Craciun (Eds.), Theoretical Aspects of Software Engineering - 16th International Symposium, TASE 2022, Proceedings (pp. 290-307). Springer. https://doi.org/10.1007/978-3-031-10363-6_20

Billes, M., Møller, A. & Pradel, M. (2017). Systematic black-box analysis of collaborative web applications. In PLDI 2017 - Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (Vol. Part F128414, pp. 171-184). Association for Computing Machinery. https://doi.org/10.1145/3062341.3062364

Biernacki, D. & Danvy, O. (2004). From Interpreter to logic Engine by Defunctionalization. In M. Bruynooghe (Ed.), Logic Based Program Synthesis and Transformation: 13th International Symposium, LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers (pp. 143-159). Springer. https://doi.org/10.1007/978-3-540-25938-1_13

Biernacki, D. & Danvy, O. (2005). On the Static and Dynamic Extent of Delimited Continuations. B R I C S Report Series, (RS-05-36).

Biernacki, D., Danvy, O. & Millikin, K. S. (2005). A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations. B R I C S Report Series, (RS-05-16), 1-26.

Biernacki, D. & Danvy, O. (2005). A Simple Proof of a Folklore Theorem about Delimited Control. B R I C S Report Series, (RS-05-25).

Biernacki, D. P., Danvy, O. & Shan, C. (2006). On the Static and Dynamic Extents of Delimited Continuations. Science of Computer Programming, 60(3), 274-297.

Biernacki, D. & Danvy, O. (2006). A Simple Proof of a Folklore Theorem about Delimited Control. Journal of Functional Programming, 16(3), 269-280.

Biernacki, D., Danvy, O. & Shan, K. (2005). On the Dynamic Extent of Delimited Continuations. Information Processing Letters, 96(1), 7-17. https://doi.org/10.1016/j.ipl.2005.04.003

Biernacki, D. & Danvy, O. (2003). From Interpreter to Logic Engine by Defunctionalization. B R I C S Report Series, (RS-03-25).

Biernacki, D. & Danvy, O. (2004). From Interpreter to Logic Engine by Defunctionalization. B R I C S Report Series, (RS-04-5).

Biernacki, D., Danvy, O. & Millikin, K. (2015). A dynamic continuation-passing style for dynamic delimited continuations. A C M Transactions on Programming Languages and Systems, 38(1), Article 2. https://doi.org/10.1145/2794078

Biernacka, M., Danvy, O. & Sørensen, K. S. (2005). Extracting Evaluators from Proofs of Weak Head Normalization. In Electronic Notes in Theoretical Computer Science Elsevier Science Publishers.

Biernacka, M., Biernacki, D. & Danvy, O. (2003). An Operational Foundation for Delimited Continuations. B R I C S Report Series, (RS-03-41).

Biernacka, M., Biernacki, D. & Danvy, O. (2004). An Operational Foundation for Delimited Continuations. In Proceedings of the Fourth ACM SIGPLAN Workshop on Continuations (pp. 25-33). Association for Computing Machinery.

Biernacka, M. & Danvy, O. (2005). A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines. B R I C S Report Series, (RS-05-38).

Biernacka, M., Danvy, O. & Støvring, K. (2005). Program Extraction from Proofs of Weak Head Normalization. B R I C S Report Series, (RS-05-12).

Biernacka, M. & Danvy, O. (2007). A Concrete Framework for Environment Machines. A C M Transactions on Computational Logic, 9(1), 1-30.

Biernacka, M. & Danvy, O. (2007). A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines. Theoretical Computer Science, 76-108.

Biernacka, M., Biernacki, D. & Danvy, O. (2005). An Operational Foundation for Delimited Continuations in the CPS Hierarchy. Logical Methods in Computer Science, 1(2). https://doi.org/10.2168/LMCS-1(2:5)2005

Biernacka, M. & Danvy, O. (2007). A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines. Theoretical Computer Science, 375(1-3), 76-108.

Biernacka, M. & Danvy, O. (2008). Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines. In W. Clinger (Ed.), Proceedings of the 2008 ACM SIGPLAN Workshop on Scheme and Functional Programming (pp. 37-48). Association for Computing Machinery.

Biernacka, M. & Danvy, O. (2009). Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines. Lecture Notes in Computer Science, 5700, 186-206. https://doi.org/10.1007/978-3-642-04164-8_10

Biernacka, M., Biernacki, D. & Danvy, O. (2004). An Operational Foundation for Delimited Continuations in the CPS Hierarchy. B R I C S Report Series, (RS-04-29).

Basin, D. A., Danvy, O. & Harper, R. (2004). Editorial. Higher-Order and Symbolic Computation, 17(3), 171-171. https://doi.org/10.1023/B:LISP.0000029480.20108.7d

Banerjee, A., Danvy, O., Doh, K-G. & Hatcliff , J. (Eds.) (2013). Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday : Festschrift for Dave Schmidt, Manhattan, Kansas, USA, 19-20th September 2013. http://published.eptcs.org/. Electronic Proceedings in Theoretical Computer Science Vol. 129 https://doi.org/10.4204/EPTCS.129

Balat, V. & Danvy, O. (2002). Memorization in Type-Directed Partial Evaluation. In D. Batory, C. Consel & W. Taha (Eds.), Generative Programming and Component Engineering: ACM SIGPLAN/SIGSOFT Conference, GPCE 2002 Pittsburgh, PA, USA, October 6–8, 2002 Proceedings (pp. 78-92). Springer. https://doi.org/10.1007/3-540-45821-2_5

Balat, V. & Danvy, O. (1998). Strong normalization by type-directed partial evaluation and run-time code generation. In X. Leroy & A. Ohori (Eds.), Types in Compilation: Second International Workshop, TIC ’98 Kyoto, Japan, March 25–27, 1998 Proceedings (pp. 240-252). Springer. https://doi.org/10.1007/BFb0055521

Balat, V. & Danvy, O. (2002). Memoization in Type-Directed Partial Evaluation. B R I C S Report Series, (RS-02-33).

Displaying results 351 to 400 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