Department of Computer Science

Aarhus University Seal
 Department of Computer Science Research Programming Languages Publications

Publications

Sort by: Type and 1st author

Contribution to journal

Adamsen, C. Q., Møller, A. & Tip, F. (2017). Practical Initialization Race Detection for JavaScript Web Applications. Proceedings of the ACM on Programming Languages , 1(OOPSLA), 66:1-66:22. Article 66. https://doi.org/10.1145/3133890
Ager, M. S., Danvy, O. & Midtgaard, J. (2003). A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines. BRICS Report Series, (RS-03-24).
Ager, M. S., Danvy, O. & Midtgaard, J. (2004). A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines. Information Processing Letters, 90(5), 223-232. https://doi.org/10.1016/j.ipl.2004.02.012
Ager, M. S., Danvy, O. & Midtgaard, J. (2004). A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines. BRICS Report Series, (RS-04-3).
Ager, M. S., Danvy, O. & Midtgaard, J. (2003). A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects. BRICS Report Series, (RS-03-35).
Ager, M. S., Danvy, O. & Midtgaard, J. (2004). A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects. BRICS Report Series, (RS-04-28).
Ager, M. S., Danvy, O. & Midtgaard, J. (2005). A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects. Theoretical Computer Science, 342(1), 149-172.
Ager, M. S., Danvy, O. & Goldberg, M. (2002). A Symmetric Approach to Compilation and Decompilation. BRICS Report Series, (RS-02-37).
Ager, M. S., Danvy, O. & Rohde, H. K. (2004). Fast Partial Evaluation of Pattern Matching in Strings. BRICS Report Series, (RS-04-40).
Ager, M. S., Danvy, O. & Rohde, H. K. (2006). Fast Partial Evaluation of Pattern Matching in Strings. A C M Transactions on Programming Languages and Systems, 28(4), 696-714. https://doi.org/10.1145/1146809.1146812
Ager, M. S., Danvy, O. & Rohde, H. K. (2003). Fast Partial Evaluation of Pattern Matching in Strings. BRICS Report Series, (RS-03-11).
Ager, M. S., Danvy, O. & Rohde, H. K. (2003). Fast Partial Evaluation of Pattern Matching in Strings. BRICS Report Series, (RS-03-20).
Ager, M. S., Biernacki, D., Danvy, O. & Midtgaard, J. (2003). From Interpreter to Compiler and Virtual Machine: A Functional Derivation. BRICS Report Series, (RS-03-14).
Ager, M. S., Biernacki, D., Danvy, O. & Midtgaard, J. (2003). Functional Correspondence between Evaluators and Abstract Machines. BRICS Report Series, (RS-03-13).
Ager, M. S., Danvy, O. & Rohde, H. K. (2002). On Obtaining Knuth, Morris, and Pratt's String Matcher by Partial Evaluation. BRICS Report Series, (RS-02-32).
Alimadadi, S., Zhong, D., Madsen, M. & Tip, F. (2018). Finding Broken Promises in Asynchronous JavaScript Programs. Proceedings of the ACM on Programming Languages , 2(OOPSLA), 162:1-162:26. Article 162. https://doi.org/10.1145/3276532
Amtoft, T., Consel, C., Danvy, O. & Malmkjær, K. (2001). The Abstraction and Instantiation of String-Matching Programs. BRICS Report Series, (RS-01-12).
Andreasen, E., Gong, L., Møller, A., Pradel, M., Selakovic, M., Sen, K. & Staicu, C.-A. (2017). A Survey of Dynamic Analysis and Test Generation for JavaScript. A C M Computing Surveys, 50(5), 66:1-66:36. Article 66. https://doi.org/10.1145/3106739
Balat, V. & Danvy, O. (2002). Memoization in Type-Directed Partial Evaluation. BRICS Report Series, (RS-02-33).
Balat, V. & Danvy, O. (1997). Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation. BRICS Report Series, (RS-97-43).
Biernacka, M. & Danvy, O. (2007). A Concrete Framework for Environment Machines. A C M Transactions on Computational Logic, 9(1), 1-30.
Biernacka, M., Biernacki, D. & Danvy, O. (2003). An Operational Foundation for Delimited Continuations. BRICS Report Series, (RS-03-41).
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., Biernacki, D. & Danvy, O. (2004). An Operational Foundation for Delimited Continuations in the CPS Hierarchy. BRICS Report Series, (RS-04-29).
Biernacka, M. & Danvy, O. (2005). A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines. BRICS Report Series, (RS-05-38).
Biernacka, M. & Danvy, O. (2007). A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines. Theoretical Computer Science, 76-108.
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. & Støvring, K. (2005). Program Extraction from Proofs of Weak Head Normalization. BRICS Report Series, (RS-05-12).
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
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
Biernacki, D., Danvy, O. & Millikin, K. S. (2005). A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations. BRICS Report Series, (RS-05-16), 1-26.
Biernacki, D. & Danvy, O. (2005). A Simple Proof of a Folklore Theorem about Delimited Control. BRICS Report Series, (RS-05-25).
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. (2003). From Interpreter to Logic Engine by Defunctionalization. BRICS Report Series, (RS-03-25).
Biernacki, D. & Danvy, O. (2004). From Interpreter to Logic Engine by Defunctionalization. BRICS Report Series, (RS-04-5).
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. (2005). On the Static and Dynamic Extent of Delimited Continuations. BRICS Report Series, (RS-05-36).
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.
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.
Brabrand, C., Giegerich, R. & Møller, A. (2006). Analyzing Ambiguity of Context-Free Grammars. BRICS 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
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
Chakraborty, S., Krishna, S. N., Mathur, U. & Pavlogiannis, A. (2024). How Hard Is Weak-Memory Testing? Proceedings of the ACM on Programming Languages , 8, Article 66. https://doi.org/10.1145/3632908
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

Displaying results 1 to 50 out of 491

1

2

3

4

5

6

7

8

9

10

Next

Faculty

Revised 01.09.2025
-
Sofia Hedegaard Rasmussen