default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Sulzmann
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Martin Sulzmann, Stefan Wehr
:
A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go. J. Funct. Program. 33 (2023)- [i22]Martin Sulzmann, Peter Thiemann:
Cross-thread critical sections and efficient dynamic race prediction methods. CoRR abs/2307.09855 (2023) - 2022
- [j11]Carlos Camarão, Martin Sulzmann:
Special issue on revised and extended versions of papers presented at the 22nd Brazilian Symposium on Programming Languages (SBLP 2018). Sci. Comput. Program. 218: 102793 (2022) - [c55]Martin Sulzmann, Stefan Wehr:
Semantic Preservation for a Type Directed Translation Scheme of Featherweight Go. MPC 2022: 178-197 - [i21]Martin Sulzmann, Stefan Wehr:
Semantic preservation for a type directed translation scheme of Featherweight Go. CoRR abs/2206.09980 (2022) - [i20]Martin Sulzmann, Stefan Wehr:
A Type-Directed, Dictionary-Passing Translation of Featherweight Generic Go. CoRR abs/2209.08511 (2022) - 2021
- [j10]John P. Gallagher, Martin Sulzmann:
Preface. Sci. Comput. Program. 202: 102577 (2021) - [c54]Martin Sulzmann, Stefan Wehr:
A Dictionary-Passing Translation of Featherweight Go. APLAS 2021: 102-120 - [i19]Martin Sulzmann, Stefan Wehr:
A Dictionary-Passing Translation of Featherweight Go. CoRR abs/2106.14586 (2021) - 2020
- [c53]Martin Sulzmann, Kai Stadtmüller:
Efficient, near complete, and often sound hybrid dynamic data race prediction. MPLR 2020: 30-51 - [i18]Martin Sulzmann, Kai Stadtmüller:
Efficient, Near Complete and Often Sound Hybrid Dynamic Data Race Prediction (extended version). CoRR abs/2004.06969 (2020) - [i17]Daniel Kraus, Jeremias Rößler, Martin Sulzmann:
Visual Testing of GUIs by Abstraction. CoRR abs/2007.10419 (2020)
2010 – 2019
- 2019
- [j9]Martin Sulzmann, Peter Thiemann:
Derivatives and partial derivatives for regular shuffle expressions. J. Comput. Syst. Sci. 104: 323-341 (2019) - [c52]Martin Sulzmann, Kenny Zhuo Ming Lu:
Solving of Regular Equations Revisited. ICTAC 2019: 392-409 - [c51]Tamino Dauth, Martin Sulzmann:
Futures and promises in Haskell and Scala. PEPM@POPL 2019: 68-74 - [c50]Martin Sulzmann, Kai Stadtmüller:
Predicting all data race pairs for a specific schedule. MPLR 2019: 72-84 - [i16]Martin Sulzmann, Kai Stadtmüller:
Data Race Prediction for Inaccurate Traces. CoRR abs/1905.10855 (2019) - [i15]Martin Sulzmann, Kenny Zhuo Ming Lu:
Solving of Regular Equations Revisited (extended version). CoRR abs/1908.03710 (2019) - [i14]Martin Sulzmann, Kai Stadtmüller:
Predicting All Data Race Pairs for a Specific Schedule (extended version). CoRR abs/1909.03289 (2019) - 2018
- [c49]Martin Sulzmann, Peter Thiemann:
LTL Semantic Tableaux and Alternating \omega ω -automata via Linear Factors. ICTAC 2018: 11-34 - [c48]Martin Sulzmann, Kai Stadtmüller:
Two-Phase Dynamic Analysis of Message-Passing Go Programs Based on Vector Clocks. PPDP 2018: 22:1-22:13 - [e2]John P. Gallagher, Martin Sulzmann:
Functional and Logic Programming - 14th International Symposium, FLOPS 2018, Nagoya, Japan, May 9-11, 2018, Proceedings. Lecture Notes in Computer Science 10818, Springer 2018, ISBN 978-3-319-90685-0 [contents] - [e1]Carlos Camarão, Martin Sulzmann:
Proceedings of the XXII Brazilian Symposium on Programming Languages, SBLP 2018, Sao Carlos, Brazil, September 20-21, 2018. ACM 2018, ISBN 978-1-4503-6480-5 [contents] - [i13]Martin Sulzmann, Kai Stadtmüller:
Two-Phase Dynamic Analysis of Message-Passing Go Programs based on Vector Clocks. CoRR abs/1807.03585 (2018) - 2017
- [j8]Martin Sulzmann, Kenny Zhuo Ming Lu:
Derivative-Based Diagnosis of Regular Expression Ambiguity. Int. J. Found. Comput. Sci. 28(5): 543-562 (2017) - [c47]Martin Sulzmann, Peter Thiemann:
A Computational Interpretation of Context-Free Expressions. APLAS 2017: 387-405 - [c46]Martin Sulzmann, Kai Stadtmüller:
Trace-Based Run-Time Analysis of Message-Passing Go Programs. Haifa Verification Conference 2017: 83-98 - [i12]Martin Sulzmann, Peter Thiemann:
A Computational Interpretation of Context-Free Expressions. CoRR abs/1708.07366 (2017) - [i11]Martin Sulzmann, Kai Stadtmüller:
Trace-Based Run-time Analysis of Message-Passing Go Programs. CoRR abs/1709.01588 (2017) - [i10]Martin Sulzmann, Peter Thiemann:
LTL Semantic Tableaux and Alternating ω-automata via Linear Factors. CoRR abs/1710.06678 (2017) - 2016
- [c45]Kai Stadtmüller, Martin Sulzmann, Peter Thiemann:
Static Trace-Based Deadlock Analysis for Synchronous Mini-Go. APLAS 2016: 116-136 - [c44]Martin Sulzmann, Peter Thiemann:
Forkable Regular Expressions. LATA 2016: 194-206 - [c43]Martin Sulzmann, Kenny Zhuo Ming Lu:
Derivative-Based Diagnosis of Regular Expression Ambiguity. CIAA 2016: 260-272 - [i9]Martin Sulzmann, Kenny Zhuo Ming Lu:
Derivative-Based Diagnosis of Regular Expression Ambiguity. CoRR abs/1604.06644 (2016) - [i8]Kai Stadtmüller, Martin Sulzmann, Peter Thiemann:
Static Trace-Based Deadlock Analysis for Synchronous Mini-Go. CoRR abs/1608.08330 (2016) - 2015
- [c42]Martin Sulzmann, Peter Thiemann:
Derivatives for Regular Shuffle Expressions. LATA 2015: 275-286 - [c41]Peter Thiemann, Martin Sulzmann:
From \omega -Regular Expressions to Büchi Automata via Partial Derivatives. LATA 2015: 287-298 - [i7]Martin Sulzmann, Peter Thiemann:
Forkable Regular Expressions. CoRR abs/1510.07293 (2015) - 2014
- [j7]Gregory J. Duck, Rémy Haemmerlé, Martin Sulzmann:
On Termination, Confluence and Consistent CHR-based Type Inference. Theory Pract. Log. Program. 14(4-5): 619-632 (2014) - [c40]Martin Sulzmann, Pippijn van Steenhoven:
A Flexible and Efficient ML Lexer Tool Based on Extended Regular Expression Submatching. CC 2014: 174-191 - [c39]Martin Sulzmann, Kenny Zhuo Ming Lu:
POSIX Regular Expression Parsing with Derivatives. FLOPS 2014: 203-220 - [i6]Gregory J. Duck, Rémy Haemmerlé, Martin Sulzmann:
On Termination, Confluence and Consistent CHR-based Type Inference. CoRR abs/1405.3393 (2014) - 2013
- [c38]Martin Sulzmann, Jürgen Nicklisch-Franken, Axel Zechner:
Traceability and evidence of correctness of EDSL abstractions. PEPM 2013: 71-74 - 2012
- [c37]Stefan Milius, Henning Günther, Jan Peleska, Oliver Möller, Helge Löding, Martin Sulzmann, Ramin Hedayati, Axel Zechner:
A framework for formal verification of systems of synchronous components. MBEES 2012: 145-154 - [c36]Martin Sulzmann, Kenny Zhuo Ming Lu:
Regular expression sub-matching using partial derivatives. PPDP 2012: 79-90 - [c35]Martin Sulzmann, Axel Zechner:
Model Checking DSL-Generated C Source Code. SPIN 2012: 241-247 - [c34]Martin Sulzmann, Axel Zechner:
Constructive Finite Trace Analysis with Linear Temporal Logic. TAP@TOOLS 2012: 132-148 - 2011
- [j6]Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers, Martin Sulzmann:
OutsideIn(X) Modular type inference with local assumptions. J. Funct. Program. 21(4-5): 333-412 (2011) - [j5]Edmund S. L. Lam, Martin Sulzmann:
Concurrent goal-based execution of Constraint Handling Rules. Theory Pract. Log. Program. 11(6): 841-879 (2011) - 2010
- [c33]Peter Thiemann, Martin Sulzmann:
Tag-Free Combinators for Binding-Time Polymorphic Program Generation. FLOPS 2010: 87-102 - [i5]Edmund S. L. Lam, Martin Sulzmann:
Concurrent Goal-Based Execution of Constraint Handling Rules. CoRR abs/1006.3039 (2010)
2000 – 2009
- 2009
- [c32]Tom Schrijvers, Simon L. Peyton Jones, Martin Sulzmann, Dimitrios Vytiniotis:
Complete and decidable type inference for GADTs. ICFP 2009: 341-352 - [c31]Martin Sulzmann, Edmund S. L. Lam, Simon Marlow:
Comparing the performance of concurrent linked-list implementations in Haskell. DAMP 2009: 37-46 - 2008
- [j4]Martin Sulzmann, Peter J. Stuckey:
HM(X) type inference is CLP(X) solving. J. Funct. Program. 18(2): 251-283 (2008) - [c30]Martin Sulzmann, Edmund S. L. Lam, Peter Van Weert:
Actors with Multi-headed Message Receive Patterns. COORDINATION 2008: 315-330 - [c29]Tom Schrijvers, Simon L. Peyton Jones, Manuel M. T. Chakravarty, Martin Sulzmann:
Type checking with open type functions. ICFP 2008: 51-62 - [c28]Tom Schrijvers, Martin Sulzmann:
Transactions in Constraint Handling Rules. ICLP 2008: 516-530 - [c27]Martin Sulzmann, Edmund S. L. Lam:
Parallel execution of multi-set constraint rewrite rules. PPDP 2008: 20-31 - [c26]Tom Schrijvers, Martin Sulzmann:
Confluence for Functional Dependencies. Trends in Functional Programming 2008: 49-64 - 2007
- [j3]Martin Sulzmann, Gregory J. Duck, Simon L. Peyton Jones, Peter J. Stuckey:
Understanding functional dependencies via constraint handling rules. J. Funct. Program. 17(1): 83-129 (2007) - [c25]Martin Sulzmann, Meng Wang:
Aspect-oriented programming with type classes. FOAL 2007: 65-74 - [c24]Gregory J. Duck, Peter J. Stuckey, Martin Sulzmann:
Observable Confluence for Constraint Handling Rules. ICLP 2007: 224-239 - [c23]Martin Sulzmann, Kenny Zhuo Ming Lu:
XHaskell - Adding Regular Expression Types to Haskell. IFL 2007: 75-92 - [c22]Edmund S. L. Lam, Martin Sulzmann:
A concurrent constraint handling rules implementation in Haskell with software transactional memory. DAMP 2007: 19-24 - [c21]Martin Sulzmann, Manuel M. T. Chakravarty, Simon L. Peyton Jones, Kevin Donnelly:
System F with type equality coercions. TLDI 2007: 53-66 - 2006
- [c20]Peter J. Stuckey, Martin Sulzmann, Jeremy Wazny:
Type Processing by Constraint Reasoning. APLAS 2006: 1-25 - [c19]Martin Sulzmann, Tom Schrijvers, Peter J. Stuckey:
Principal Type Inference for GHC-Style Multi-parameter Type Classes. APLAS 2006: 26-43 - [c18]Martin Sulzmann, Jeremy Wazny, Peter J. Stuckey:
A Framework for Extended Algebraic Data Types. FLOPS 2006: 47-64 - [c17]Martin Sulzmann, Meng Wang:
Modular generic programming with extensible superclasses. ICFP-WGP 2006: 55-65 - [c16]Martin Sulzmann, Kenny Zhuo Ming Lu:
XHaskell. PLAN-X 2006: 92 - [c15]Martin Sulzmann:
Extracting programs from type class proofs. PPDP 2006: 97-108 - [c14]Martin Sulzmann, Razvan Voicu:
Language-Based Program Verification via Expressive Types. PLPV@IJCAR 2006: 129-147 - 2005
- [j2]Peter J. Stuckey, Martin Sulzmann:
A theory of overloading. ACM Trans. Program. Lang. Syst. 27(6): 1216-1269 (2005) - [c13]Martin Sulzmann, Kenny Zhuo Ming Lu:
A Type-Safe Embedding of XDuce into ML. ML 2005: 239-264 - [i4]Peter J. Stuckey, Martin Sulzmann, Jeremy Wazny:
Improved Inference for Checking Annotations. CoRR abs/cs/0507036 (2005) - [i3]Peter J. Stuckey, Martin Sulzmann:
Type Inference for Guarded Recursive Data Types. CoRR abs/cs/0507037 (2005) - 2004
- [c12]Kenny Zhuo Ming Lu, Martin Sulzmann:
An Implementation of Subtyping Among Regular Expression Types. APLAS 2004: 57-73 - [c11]Gregory J. Duck, Simon L. Peyton Jones, Peter J. Stuckey, Martin Sulzmann:
Sound and Decidable Type Inference for Functional Dependencies. ESOP 2004: 49-63 - [c10]Peter J. Stuckey, Martin Sulzmann, Jeremy Wazny:
Improving type error diagnosis. Haskell 2004: 80-91 - 2003
- [c9]Kim Marriott, Peter J. Stuckey, Martin Sulzmann:
Resource Usage Verification. APLAS 2003: 212-229 - [c8]Peter J. Stuckey, Martin Sulzmann, Jeremy Wazny:
Interactive type debugging in Haskell. Haskell 2003: 72-83 - [i2]Peter J. Stuckey, Martin Sulzmann, Jeremy Wazny:
The Chameleon Type Debugger (Tool Demonstration). CoRR cs.PL/0311023 (2003) - 2002
- [c7]Martin Sulzmann:
An Overview of the Chameleon System. APLAS 2002: 16-30 - [c6]Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard:
Exception analysis for non-strict languages. ICFP 2002: 98-109 - [c5]Peter J. Stuckey, Martin Sulzmann:
A theory of overloading. ICFP 2002: 167-178 - 2001
- [c4]Martin Sulzmann:
A General Type Inference Framework for Hindley/Milner Style Systems. FLOPS 2001: 248-263 - [c3]Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard:
Boolean Constraints for Binding-Time Analysis. PADO 2001: 39-62 - [c2]Kevin Glynn, Peter J. Stuckey, Martin Sulzmann:
Effective Strictness Analysis with HORN Constraints. SAS 2001: 73-92 - 2000
- [i1]Kevin Glynn, Martin Sulzmann, Peter J. Stuckey:
Type Classes and Constraint Handling Rules. CoRR cs.PL/0006034 (2000)
1990 – 1999
- 1999
- [j1]Martin Odersky, Martin Sulzmann, Martin Wehr:
Type Inference with Constrained Types. Theory Pract. Object Syst. 5(1): 35-55 (1999) - 1996
- [c1]Bernhard Beckert, Reiner Hähnle, Peter Oel, Martin Sulzmann:
The Tableau-based Theorem Prover 3TAP Version 4.0. CADE 1996: 303-307
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-05-08 21:00 CEST 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:
