Publications

Sort by: Date | Author | Title

Birkedal, L., Rosolini, G., Scott, D. S. & van Oosten, J. (Eds.) (2002). Proceedings of the Tutorial Workshop on Realizability Semantics and Applications: held June 30 and July 1, 1999 in Trento, Italy, as one of the satellite workshops associated to the Federated Logic Conference. Elsevier. Mathematical Structures in Computer Science Vol. 12 No. 3, special issue http://journals.cambridge.org/action/displayIssue?decade=2000&jid=MSC&volumeId=12&issueId=03&iid=114628

Møller, A. (2002). Program Verification with Monadic Second-Order Logic & Languages for Web Service Development. Datalogisk Institut, Aarhus Universitet.

Birkedal, L. & van Oosten, J. (2002). Relative and modified relative realizability. Annals of Pure and Applied Logic, 118(1-2), 115-132. https://doi.org/10.1016/S0168-0072(01)00122-1

Christensen, A. S., Møller, A. & Schwartzbach, M. I. (2002). Static Analysis for Dynamic XML. In E-Proceeding of PLAN-X 2002 http://homepages.inf.ed.ac.uk/wadler/planx/planx-eproceed/papers/E00-1868950904.pdf

Klarlund, N., Møller, A. & Schwartzbach, M. I. (2002). The DSD Schema Language. Automated Software Engineering, 9(3), 285-319. https://doi.org/10.1023/A:1016376608070

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

Birkedal, L. & Tofte, M. (2001). A constraint-based region inference algorithm. Theoretical Computer Science, 258(1-2), 299-392. https://doi.org/10.1016/S0304-3975(00)00025-6

Klarlund, N., Møller, A. & Schwartzbach, M. I. (2001). MONA Implementation Secrets. In S. Yu & A. Paun (Eds.), Implementation and Application of Automata: 5th International Conference, CIAA 2000 London, Ontario, Canada, July 24-25, 2000 Revised Papers (pp. 182-194). Springer. https://doi.org/10.1007/3-540-44674-5_4

Klarlund, N. & Møller, A. (2001). MONA Version 1.4 User Manual. BRICS Notes Series, (NS-01-1).

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

Møller, A. & Schwartzbach, M. I. (2001). The Pointer Assertion Logic Engine. In M. L. Sofia (Ed.), Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Vol. 36(5), pp. 221-231). Association for Computing Machinery. https://doi.org/10.1145/381694.378851

Møller, A. & Schwartzbach, M. I. (2001). The XML Revolution. BRICS Notes Series, (NS-01-8).

Birkedal, L. (2000). A general notion of realizability. In 15th Annual IEEE Symposium on Logic in Computer Science, 2000. Proceedings. (pp. 7 - 17). IEEE Signal Processing Society. https://doi.org/10.1109/LICS.2000.855751

Elgaard, J., Møller, A. & Schwartzbach, M. I. (2000). Compile-Time Debugging of C Programs Working on Trees. In G. Smolka (Ed.), Programming Languages and Systems: 9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings (pp. 119-134). Springer. https://doi.org/10.1007/3-540-46425-5_8

Bauer, A. & Birkedal, L. (2000). Continuous Functionals of Dependent Types and Equilogical Spaces. In P. G. Clote & H. Schwichtenberg (Eds.), Computer Science Logic: 14th InternationalWorkshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21 – 26, 2000 Proceedings (pp. 202-216). Springer. https://doi.org/10.1007/3-540-44622-2_13

Birkedal, L. (2000). Developing theories of types and computability via realizability. Elsevier. Electronic Notes in Theoretical Computer Science Vol. 34 https://doi.org/10.1016/S1571-0661(05)80642-5

Klarlund, N., Møller, A. & Schwartzbach, M. I. (2000). Document Structure Description 1.0. BRICS Notes Series, (NS-00-7).

Klarlund, N., Møller, A. & Schwartzbach, M. I. (2000). DSD: A Schema Language for XML. In Proceedings of the third workshop on Formal methods in software practice (pp. 101-111). Association for Computing Machinery. https://doi.org/10.1145/349360.351158

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

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. http://dl.acm.org/citation.cfm?id=345868.345907&coll=DL&dl=GUIDE&CFID=560593603&CFTOKEN=90733199

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., Sandholm, A. & Schwartzbach, M. I. (1999). A Runtime System for Interactive Web Services. In Proceedings of the 8th International World Wide Web Conference Elsevier.

Awodey, S., Birkedal, L. & Scott, D. S. (1999). Local realizability toposes and a modal logic for computability - (Extended Abstract). Electronic Notes in Theoretical Computer Science, 23(1), 13-26. https://doi.org/10.1016/S1571-0661(04)00101-X

Birkedal, L., van Oosten, J., Rosolini, G. & Scott, D. S. (Eds.) (1999). Proceedings of the Tutorial Workshop on Realizability Semantics and Applications: held June 30 and July 1, 1999 in Trento, Italy, as one of the satellite workshops associated to the Federated Logic Conference. Elsevier. Electronic Notes in Theoretical Computer Science Vol. 23 No. 1 http://www.journals.elsevier.com/electronic-notes-in-theoretical-computer-science/

Birkedal, L. & Harper, R. (1999). Relational Interpretations of Recursive Types in an Operational Setting. Information and Computation, 155(1-2), 3-63. http://www.scopus.com/inward/record.url?scp=0000650306&partnerID=8YFLogxK

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

Elgaard, J., Klarlund, N. & Møller, A. (1998). MONA 1.x: New Techniques for WS1S and WS2S. In A. J. Hu & M. Y. Vardi (Eds.), Computer Aided Verification: 10th International Conference, CAV'98 Vancouver, BC, Canada, June 28 – July 2, 1998 Proceedings (pp. 516-520). Springer. https://doi.org/10.1007/BFb0028773

Birkedal, L., Carboni, A., Rosolini, G. & Scott, D. S. (1998). Type theory via exact categories. In K. Kelly (Ed.), Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science: 21-24 Jun 1998, Indianapolis, IN (pp. 188 - 198 ). IEEE. https://doi.org/10.1109/LICS.1998.705655

Birkedal, L. & Harper, R. (1997). Relational interpretations of recursive types in an operational setting: (Summary). In M. Abadi & T. Ito (Eds.), Theoretical Aspects of Computer Software: Third International Symposium, TACS'97 Sendai, Japan, September 23–26, 1997 Proceedings (pp. 458-490). Springer. https://doi.org/10.1007/BFb0014563

Birkedal, L., Tofte, M. & Vejlstrup, M. (1996). From region inference to von Neumann machines via region representation inference. In Proceedings of the 1996 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: St.Petersburg, FL, USA; ; 21 January 1996 through 24 January 1996 (pp. 171-183). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=0029725194&partnerID=8YFLogxK

Birkedal, L. & Welinder, M. (1995). Binding-time analysis for Standard ML. Higher-Order and Symbolic Computation, 8(3), 191-208. https://doi.org/10.1007/BF01019003

Birkedal, L. & Welinder, M. (1995). Binding-time analysis for Standard ML. In PEPM'94 - ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, Walt Disney World Vilage, Orlando, Florida, USA, 25 June 1994, Proceedings: Technical Report 94/9. (pp. 61-71). University of Melbourne. Department of Computer Science.

Birkedal, L. & Welinder, M. (1994). Hand-writing program generator generators. In M. Hermenegildo & J. Penjam (Eds.), Programming Language Implementation and Logic Programming: 6th International Symposium, PLILP '94 Madrid, Spain, September 14–16, 1994 Proceedings (pp. 198-214). Springer VS. https://doi.org/10.1007/3-540-58402-1_15

Displaying results 501 to 533 out of 533

Revised 05.12.2025

Marianne Dammand Iversen