default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMagnus Madsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Robert Schenck
, Nikolaj Hey Hinnerskov, Troels Henriksen, Magnus Madsen, Martin Elsman:
AUTOMAP: Inferring Rank-Polymorphic Function Applications with Integer Linear Programming. Proc. ACM Program. Lang. 8(OOPSLA2): 1787-1813 (2024)- [j10]Matthew Lutze, Magnus Madsen:
Associated Effects: Flexible Abstractions for Effectful Programming. Proc. ACM Program. Lang. 8(PLDI): 394-416 (2024) - 2023
- [j9]Magnus Madsen, Jonathan Lindegaard Starup, Matthew Lutze:
Restrictable Variants: A Simple and Practical Alternative to Extensible Variants (Artifact). Dagstuhl Artifacts Ser. 9(2): 12:1-12:3 (2023) - [j8]Matthew Lutze, Magnus Madsen, Philipp Schuster, Jonathan Immanuel Brachthäuser:
With or Without You: Programming with Effect Exclusion. Proc. ACM Program. Lang. 7(ICFP): 448-475 (2023) - [j7]Magnus Madsen, Jaco van de Pol, Troels Henriksen:
Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems. Proc. ACM Program. Lang. 7(OOPSLA2): 516-543 (2023) - [c16]Magnus Madsen, Jonathan Lindegaard Starup, Matthew Lutze:
Restrictable Variants: A Simple and Practical Alternative to Extensible Variants. ECOOP 2023: 17:1-17:27 - [c15]Magnus Madsen, Jaco van de Pol:
Programming with Purity Reflection: Peaceful Coexistence of Effects, Laziness, and Parallelism. ECOOP 2023: 18:1-18:27 - [c14]Jonathan Lindegaard Starup, Magnus Madsen, Ondrej Lhoták:
Breaking the Negative Cycle: Exploring the Design Space of Stratification for First-Class Datalog Constraints. ECOOP 2023: 31:1-31:28 - [d2]Magnus Madsen, Jaco van de Pol, Troels Henriksen:
Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems (artifact). Version 2. Zenodo, 2023 [all versions]
- [d1]Magnus Madsen, Jaco van de Pol, Troels Henriksen:
Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems (artifact). Version 3. Zenodo, 2023 [all versions] - 2022
- [c13]Magnus Madsen, Jonathan Lindegaard Starup, Ondrej Lhoták:
Flix: A Meta Programming Language for Datalog. Datalog 2022: 202-206 - [c12]Magnus Madsen:
The Principles of the Flix Programming Language. Onward! 2022: 112-127 - 2021
- [j6]Magnus Madsen, Jaco van de Pol:
Relational nullable types with Boolean unification. Proc. ACM Program. Lang. 5(OOPSLA): 1-28 (2021) - 2020
- [j5]Magnus Madsen, Ondrej Lhoták:
Fixpoints for the masses: programming with first-class Datalog constraints. Proc. ACM Program. Lang. 4(OOPSLA): 125:1-125:28 (2020) - [j4]Magnus Madsen, Jaco van de Pol:
Polymorphic types and effects with Boolean unification. Proc. ACM Program. Lang. 4(OOPSLA): 154:1-154:29 (2020) - [j3]Quentin Stiévenart, Magnus Madsen:
Fuzzing channel-based concurrency runtimes using types and effects. Proc. ACM Program. Lang. 4(OOPSLA): 186:1-186:27 (2020) - [c11]Magnus Madsen, Ondrej Lhoták, Frank Tip:
A Semantics for the Essence of React. ECOOP 2020: 12:1-12:26
2010 – 2019
- 2018
- [j2]Saba Alimadadi, Di Zhong, Magnus Madsen, Frank Tip:
Finding broken promises in asynchronous JavaScript programs. Proc. ACM Program. Lang. 2(OOPSLA): 162:1-162:26 (2018) - [c10]Magnus Madsen, Ramin Zarifi, Ondrej Lhoták:
Tail call elimination and data representation for functional languages on the Java virtual machine. CC 2018: 139-150 - [c9]Magnus Madsen, Ondrej Lhoták:
Safe and sound program analysis with Flix. ISSTA 2018: 38-48 - [c8]Magnus Madsen, Ondrej Lhoták:
Implicit Parameters for Logic Programming. PPDP 2018: 14:1-14:14 - 2017
- [j1]Magnus Madsen, Ondrej Lhoták, Frank Tip:
A model for reasoning about JavaScript promises. Proc. ACM Program. Lang. 1(OOPSLA): 86:1-86:24 (2017) - 2016
- [c7]Magnus Madsen, Frank Tip, Esben Andreasen, Koushik Sen, Anders Møller:
Feedback-directed instrumentation for deployed JavaScript applications. ICSE 2016: 899-910 - [c6]Magnus Madsen, Ming-Ho Yee, Ondrej Lhoták:
From Datalog to flix: a declarative language for fixed points on lattices. PLDI 2016: 194-208 - 2015
- [c5]Magnus Madsen, Frank Tip, Ondrej Lhoták:
Static analysis of event-driven Node.js JavaScript applications. OOPSLA 2015: 505-519 - 2014
- [c4]Magnus Madsen, Esben Andreasen:
String Analysis for Dynamic Field Access. CC 2014: 197-217 - [c3]Magnus Madsen, Anders Møller:
Sparse Dataflow Analysis with Pointers and Reachability. SAS 2014: 201-218 - 2013
- [c2]Magnus Madsen, Benjamin Livshits, Michael Fanning:
Practical static analysis of JavaScript applications in the presence of frameworks and libraries. ESEC/SIGSOFT FSE 2013: 499-509 - 2011
- [c1]Simon Holm Jensen, Magnus Madsen, Anders Møller:
Modeling the HTML DOM and browser API in static analysis of JavaScript web applications. SIGSOFT FSE 2011: 59-69
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 20:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
