Publications

Sort by: Date | Author | Title

Schwinghammer, J., Birkedal, L., Reus, B. & Yang, H. (2009). Nested hoare triples and frame rules for higher-order store. In E. Grädel & R. Kahle (Eds.), Computer Science Logic: 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings (pp. 440-454). Springer. Lecture Notes in Computer Science Vol. 5771 https://doi.org/10.1007/978-3-642-04027-6_32

Sieczkowski, F., Svendsen, K., Birkedal, L. & Pichon-Pharabod, J. (2015). A separation logic for fictional sequential consistency. In J. Vitek (Ed.), Programming Languages and Systems : 24th European Symposiumon Programming, ESOP 2015 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015 (pp. 736-761). Springer. Lecture Notes in Computer Science Vol. 9032 https://doi.org/10.1007/978-3-662-46669-8_30

Sieczkowski, F., Bizjak, A. & Birkedal, L. (2015). ModuRes: A Coq Library for Modular Reasoning About Concurrent Higher-Order Imperative Programming Languages. In C. Urban & X. Zhang (Eds.), Interactive Theorem Proving: 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings (pp. 375-390). Springer. Lecture Notes in Computer Science Vol. 9236 https://doi.org/10.1007/978-3-319-22102-1_25

Skorstengaard, L., Devriese, D. & Birkedal, L. (2018). Reasoning About a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management. In A. Ahmed (Ed.), Programming Languages and Systems (Vol. 10801, pp. 475-501). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10801 https://doi.org/10.1007/978-3-319-89884-1_17

Skorstengaard, L., Devriese, D. & Birkedal, L. (2019). Reasoning About a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management. A C M Transactions on Programming Languages and Systems, 41(4), [5]. https://doi.org/10.1145/3363519

Skorstengaard, L., Devriese, D. & Birkedal, L. (2019). StkTokens: Enforcing Well-Bracketed Control Flow and Stack Encapsulation Using Linear Capabilities. Proceedings of the ACM on Programming Languages, 3(POPL), [19]. https://doi.org/10.1145/3290332

Skorstengaard, L., Devriese, D. & Birkedal, L. (2020). Reasoning about a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management. ACM Transactions on Programming Languages and Systems, 42(1), [5]. https://doi.org/10.1145/3363519

Spies, S., Gäher, L., Gratzer, D., Tassarotti, J., Krebbers, R., Dreyer, D. & Birkedal, L. (2021). Transfinite Iris: Resolving an existential dilemma of step-indexed separation logic. In S. N. Freund & E. Yahav (Eds.), PLDI 2021 - Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 80-95). Association for Computing Machinery. https://doi.org/10.1145/3453483.3454031

Svendsen, K. & Birkedal, L. (2014). Impredicative concurrent abstract predicates. In Z. Shao (Ed.), Programming Languages and Systems: 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings (pp. 149-168 ). Springer. Lecture Notes in Computer Science Vol. 8410 https://doi.org/10.1007/978-3-642-54833-8_9

Svendsen, K., Birkedal, L. & Nanevski, A. (2011). Partiality, State, and Dependent Types. In Proceedings of Typed LAmbda Calculi and Applications - 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011 (Vol. LNCS 6690, pp. 198-212). Springer.

Svendsen, K., Birkedal, L. & Parkinson, M. (2013). Higher-order Concurrent Abstract Predicates.

Svendsen, K., Birkedal, L. & Parkinson, M. (2013). Verification of the Joins Library in Higher-Order Separation Logic. http://www.itu.dk/people/kasv/joins-tr.pdf

Svendsen, K., Birkedal, L. & Parkinson, M. (2013). Modular Reasoning about Separation of Concurrent Data Structures. In M. Felleisen & P. Gardner (Eds.), Programming Languages and Systems: 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings (pp. 169-188 ). Springer. Lecture Notes in Computer Science Vol. 7792 https://doi.org/10.1007/978-3-642-37036-6_11

Svendsen, K., Birkedal, L. & Parkinson, M. (2013). Joins: A case study in modular specification of a concurrent reentrant higher-order library. In G. Castagna (Ed.), 27th European Conference on Object-Oriented Programming, ECOOP 2013; Montpellier; France (pp. 327-351). Springer. Lecture Notes in Engineering and Computer Science Vol. 7920 https://doi.org/10.1007/978-3-642-39038-8_14

Svendsen, K., Birkedal, L. & Parkinson, M. (2010). Verifying generics and delegates. In ECOOP 2010 – Object-Oriented Programming: 24th European Conference, Maribor, Slovenia, June 21-25, 2010. Proceedings (pp. 175-199). Springer. Lecture Notes in Computer Science Vol. 6183 https://doi.org/10.1007/978-3-642-14107-2_9

Svendsen, K., Buisse, A. & Birkedal, L. (2008). Verifying design patterns in Hoare type theory. IT University of Copenhagen. I T University. Technical Report Series No. TR-2008-112

Svendsen, K., Sieczkowski, F. & Birkedal, L. (2016). Transfinite step-indexing: Decoupling concrete and logical steps. In P. Thiemann (Ed.), Programming Languages and Systems (Vol. 9632, pp. 727-751). Springer VS. Lecture Notes in Computer Science Vol. 9632 https://doi.org/10.1007/978-3-662-49498-1_28

Sørensen, J. A., Kristoffersen, K. J., Cervera, A., Schiøtz, M., Lynge, T., Safar, Z. & Birkedal, L. (2004). An infrastructure for context dependent mobile multimedia communication. In 2004 IEEE 6th Workshop on Multimedia Signal Processing (pp. 462-464). IEEE Press. https://doi.org/10.1109/MMSP.2004.1436595

Thamsborg, J. J. & Birkedal, L. (2011). A Kripke Logical Relation for Effect-Based Program Transformations. In ICFP 11. Proceedings of the 16th ACM SIGPLAN international conference on Functional programming (pp. 445-456). Association for Computing Machinery. https://doi.org/10.1145/2034574.2034831

Thamsborg, J. J., Birkedal, L. & Yang, H. (2012). Two for the Price of One: Lifting Separation Logic Assertions. Logical Methods in Computer Science, 8(3).

Timany, A., Stefanesco, L., Krogh-Jespersen, M. & Birkedal, L. (2018). A Logical Relation for Monadic Encapsulation of State: Proving contextual equivalences in the presence of runST. In Proceedings of the ACM on Programming Languages (pp. 64:00-64:28). Association for Computing Machinery. Proceedings of the ACM on Programming Languages Vol. 2 https://doi.org/10.1145/3158152

Timany, A. & Birkedal, L. (2019). Mechanized relational verification of concurrent programs with continuations. Proceedings of the ACM on Programming Languages, 3(ICFP), 1-28. [105]. https://doi.org/10.1145/3341709

Timany, A. & Birkedal, L. (2021). Reasoning about monotonicity in separation logic. In Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’21) (pp. 91-104). Association for Computing Machinery. https://doi.org/10.1145/3437992.3439931

Tofte, M. & Birkedal, L. (1998). A Region Inference Algorithm. A C M Transactions on Programming Languages and Systems, 20(4), 724-767. http://www.scopus.com/inward/record.url?scp=0032108162&partnerID=8YFLogxK

Tofte, M., Birkedal, L., Elsman, M. & Hallenberg, N. (2004). A retrospective on Region-based Memory Management. Higher-Order and Symbolic Computation, 17(3), 245-265. https://doi.org/10.1023/B:LISP.0000029446.78563.a4

Tofte, M. & Birkedal, L. (2000). Unification and polymorphism in region inference: essays in honour of Robin Milner. In G. Plotkin , C. Stirling & M. Tofte (Eds.), Proof, language, and interaction (pp. 389-423 ). MIT Press. Foundations of Computing http://dl.acm.org/citation.cfm?id=345868.345907&coll=DL&dl=GUIDE&CFID=560593603&CFTOKEN=90733199

Torp-Smith, N., Birkedal, L. & Reynolds, J. C. (2008). Local Reasoning about a Copying Garbage Collector. A C M Transactions on Programming Languages and Systems, 30(4), 24-81.

Turon, A. J., Thamsborg, J., Ahmed, A., Birkedal, L. & Dreyer, D. (2013). Logical relations for fine-grained concurrency. In POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (pp. 343-356). Association for Computing Machinery. https://doi.org/10.1145/2429069.2429111

Varming, C. & Birkedal, L. (2008). Higher-Order Separation Logic in Isabelle/HOLCF. Electronic Notes in Theoretical Computer Science, 218, 371-389. https://doi.org/10.1016/j.entcs.2008.10.022

Vindum, S. F. & Birkedal, L. (2021). Contextual refinement of the Michael-Scott queue (proof pearl). In C. Hriţcu & A. Popescu (Eds.), CPP 2021: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 76-90). Association for Computing Machinery. https://doi.org/10.1145/3437992.3439930

Displaying results 151 to 180 out of 180

Page 1

Page 2

Page 3

Page 4

Revised 16.11.2021 -

Sofia Rasmussen