Find

For students
For PhDs
For employees

Department of Computer Science

Publications

Adams, M. D., Keep, A. W., Midtgaard, J., Might, M., Chauhan, A. & Dybvig, R. K. (2011). Flow-sensitive type recovery in linear-log time. In Proceedings of the 2011 ACM international Conference on Object Oriented Programming Systems Languages and Applications: OOPSLA '11 (pp. 483-498). Association for Computing Machinery. https://doi.org/10.1145/2048066.2048105

Adamsen, C. Q., Møller, A. & Mezzetti, G. (2015). Systematic Execution of Android Test Suites in Adverse Conditions. In Proceedings of the 2015 International Symposium on Software Testing and Analysis, ISSTA '15 (pp. 83-93 ). Association for Computing Machinery. https://doi.org/10.1145/2771783.2771786

Adamsen, C. Q., Mezzetti, G. & Møller, A. (2016). Analyzing Test Completeness for Dynamic Languages. In ISSTA 2016 - Proceedings of the 25th International Symposium on Software Testing and Analysis: ISSTA 2016 (pp. 142-153). Association for Computing Machinery. https://doi.org/10.1145/2931037.2931059

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

Adamsen, C. Q., Møller, A., Karim, R., Sridharan, M., Tip, F. & Sen, K. (2017). Repairing Event Race Errors by Controlling Nondeterminism. In Proceedings - 2017 IEEE/ACM 39th International Conference on Software Engineering, ICSE 2017 (pp. 289-299). Article 7985670 IEEE Press. https://doi.org/10.1109/ICSE.2017.34

Adamsen, C. Q., Møller, A., Alimadadi, S. & Tip, F. (2018). Practical AJAX Race Detection for JavaScript Web Applications. In G. T. Leavens, A. Garcia & C. S. Păsăreanu (Eds.), ESEC/FSE 2018 - Proceedings of the 2018 26th ACM Joint Meeting on European So ftware Engineering Conference and Symposium on the Foundations of So ftware Engineering (pp. 38-48). Association for Computing Machinery. https://doi.org/10.1145/3236024.3236038

Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A. & Toman, V. (2021). Stateless Model Checking Under a Reads-Value-From Equivalence. In A. Silva, K. Rustan & M. Leino (Eds.), Computer Aided Verification - 33rd International Conference, CAV 2021, Proceedings: Proceedings (Vol. 1, pp. 341-366). Springer. https://doi.org/10.1007/978-3-030-81685-8_16

Ager, M. S., Biernacki, D., Danvy, O. & Midtgaard, J. (2003). A Functional Correspondence Between Evaluators and Abstract Machines. In K. Sagonas & D. Miller (Eds.), Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming (pp. 8-19). Association for Computing Machinery. https://doi.org/10.1145/888251.888254

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., Danvy, O. & Goldberg, M. (2002). A Symmetric Approach to Compilation and Decompilation. In T. Æ. Mogensen, D. Schmidt & H. Sudborough (Eds.), The Essence of Computation: Complexity, Analysis, Transformation (pp. 296-331). Springer. https://doi.org/10.1007/3-540-36377-7_14

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. (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 Monadic Evaluators and Abstract Machines for Languages with Computational Effects. BRICS Report Series, (RS-04-28).

Ager, M. S., Danvy, O. & Rohde, H. K. (2003). Fast Partial Evaluation of Pattern Matching in Strings. In Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation (pp. 3-9). Association for Computing Machinery. https://doi.org/10.1145/777388.777390

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. (2002). On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation. In K. Asai (Ed.), ASIA-PEPM '02 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation (pp. 32-46). Association for Computing Machinery. https://doi.org/10.1145/568173.568177

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. & 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. & Midtgaard, J. (2004). A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines. BRICS Report Series, (RS-04-3).

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. & Goldberg, M. (2002). A Symmetric Approach to Compilation and Decompilation. BRICS Report Series, (RS-02-37).

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., Danvy, O. & Rohde, H. K. (2002). On Obtaining Knuth, Morris, and Pratt's String Matcher by Partial Evaluation. BRICS Report Series, (RS-02-32).

Agha, G., Danvy, O. & Meseguer, J. (Eds.) (2011). Formal Modeling: Actors, Open Systems, Biological Systems Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday. Springer. Lecture Notes in Computer Science No. 7000 https://doi.org/10.1007/978-3-642-24933-4

Ahmadi, A., Daliri, M., Goharshady, A. K. & Pavlogiannis, A. (2022). Efficient approximations for cache-conscious data placement. In R. Jhala & I. Dillig (Eds.), Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 857-871). Association for Computing Machinery. https://doi.org/10.1145/3519939.3523436

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

Alves, J. N., Westner, B. U., Højlund, A., Weil, R. S. & Dalal, S. S. (2023). Structural and functional changes in the retina in Parkinson's disease. Journal of neurology, neurosurgery, and psychiatry, 94(6), 448-456. https://doi.org/10.1136/jnnp-2022-329342

Amtoft, T., Consel, C., Danvy, O. & Malmkjær, K. (2001). The Abstraction and Instantiation of String-Matching Programs. BRICS Report Series, (RS-01-12).

Amtoft, T., Consel, C., Danvy, O. & Malmkjær, K. (2002). The Abstraction and Instantiation of String-Matching Programs. In T. Mogensen, D. Schmidt & H. Sudborough (Eds.), The Essence of Computation: Complexity, Analysis, Transformation (pp. 332-357). Springer. https://doi.org/10.1007/3-540-36377-7_15

Andreasen, E., Feldthaus, A., Jensen, S. H., Jensen, C. S., Jonsson, P. A., Madsen, M. & Møller, A. (2012). Improving Tools for JavaScript Programmers (Position Paper). Paper presented at International Workshop on Scripts to Programs, Beijing, China. http://cs.au.dk/~amoeller/papers/stop/

Andreasen, E. & Møller, A. (2014). Determinacy in Static Analysis of jQuery. In A. Black & T. Millstein (Eds.), Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA '14 (pp. 17-31 ). Association for Computing Machinery. https://doi.org/10.1145/2660193.2660214

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

Andreasen, E. S., Møller, A. & Nielsen, B. B. (2017). Systematic Approaches for Increasing Soundness and Precision of Static Analyzers. In K. Ali & C. Cifuentes (Eds.), SOAP 2017 - Proceedings of the 6th ACM SIGPLAN International Workshop on State of the Art in Program Analysis, co-located with PLDI 2017 (pp. 31-36). Association for Computing Machinery. https://doi.org/10.1145/3088515.3088521

Antoy, S., Johannsen, J. & Libby, S. (2015). Needed computations shortcutting needed steps. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 183, pp. 18-32). Open Publishing Association. https://doi.org/10.4204/EPTCS.183.2

Antoy, S., Johannsen, J. & Libby, S. (2014). Needed Computations Shortcutting Needed Steps. Paper presented at International Workshop on Computing with Terms and Graphs, Vienna, Austria.

Artzi, S., Dolby, J., Jensen, S. H., Møller, A. & Tip, F. (2011). A Framework for Automated Testing of JavaScript Web Applications. In Proceeding of the 33rd International Conference on Software Engineering (pp. 571-580). Association for Computing Machinery. https://doi.org/10.1145/1985793.1985871

Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K. & Pavlogiannis, A. (2020). Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. In D. Van Hung & O. Sokolsky (Eds.), Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Proceedings (pp. 253-270). Springer. https://doi.org/10.1007/978-3-030-59152-6_14

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

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

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

Berger, C. P., Lutze, M. C. D., Elmqvist, N., Madsen, M. & Klokmose, C. N. (2024). Scientists and Code: Programming as a Tool. Paper presented at PLATEAU, Berkeley, California, United States. https://kilthub.cmu.edu/articles/conference_contribution/Scientists_and_Code_Programming_as_a_Tool/25587726?backTo=/collections/PLATEAU_2024/7093870

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. BRICS 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. BRICS Report Series, (RS-05-38).

Displaying results 1 to 50 out of 491

1

Revised 01.09.2025

-

Sofia Hedegaard Rasmussen