default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan C. Dageförde
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Jan C. Dageförde
, Herbert Kuchen:
Applications of Muli: Solving Practical Problems with Constraint-Logic Object-Oriented Programming. Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems 2023: 97-112- 2021
- [c10]Jan C. Dageförde, Hendrik Winkelmann, Herbert Kuchen:
Free Objects in Constraint-logic Object-oriented Programming. PPDP 2021: 14:1-14:13 - 2020
- [b1]Jan C. Dageförde:
An Integrated Constraint-Logic and Object-Oriented Programming Language: The Münster Logic-Imperative Language. University of Münster, Germany, 2020, pp. 1-313 - [c9]Hendrik Winkelmann, Jan C. Dageförde, Herbert Kuchen:
Constraint-Logic Object-Oriented Programming with Free Arrays. WFLP 2020: 129-144 - [i3]Jan C. Dageförde, Herbert Kuchen:
Constraint-Logic Object-Oriented Programming with Free Arrays. CoRR abs/2008.13460 (2020)
2010 – 2019
- 2019
- [j1]Jan C. Dageförde, Herbert Kuchen:
A compiler and virtual machine for constraint-logic object-oriented programming with Muli. J. Comput. Lang. 53: 63-78 (2019) - [c8]Jan C. Dageförde, Finn Teegen:
Structured Traversal of Search Trees in Constraint-Logic Object-Oriented Programming. DECLARE 2019: 199-214 - [c7]Jan C. Dageförde, Herbert Kuchen:
Retrieval of individual solutions from encapsulated search with a potentially infinite search space. SAC 2019: 1552-1561 - [c6]Lars Beyer, Jan C. Dageförde, Herbert Kuchen, Claus A. Usener:
Automated Data-Flow Analysis and Validation in Process Automation Projects. SoMeT 2019: 333-346 - [i2]Jan C. Dageförde, Finn Teegen:
Structured Traversal of Search Trees in Constraint-logic Object-oriented Programming. CoRR abs/1908.10264 (2019) - 2018
- [c5]Jan C. Dageförde, Herbert Kuchen:
A constraint-logic object-oriented language. SAC 2018: 1185-1194 - [c4]Jan C. Dageförde:
Reference Type Logic Variables in Constraint-Logic Object-Oriented Programming. WFLP 2018: 131-144 - [i1]Jan C. Dageförde:
Reference Type Logic Variables in Constraint-logic Object-oriented Programming. CoRR abs/1808.08185 (2018) - 2017
- [c3]Jan C. Dageförde, Herbert Kuchen:
An Operational Semantics for Constraint-Logic Imperative Programming. DECLARE 2017: 64-80 - 2016
- [c2]Jan C. Dageförde, Tobias Reischmann, Tim A. Majchrzak, Jan Ernsting:
Generating App Product Lines in a Model-Driven Cross-Platform Development Approach. HICSS 2016: 5803-5812 - 2014
- [c1]Jörg Becker, Kevin Ortbach, Sebastian Köffer, Jan C. Dageförde, Björn Niehaves:
Old Dogs and New Tricks - Exploring the Benefits and Drawbacks of IT Consumerizationin the Context of Aging Workforces. MKWI 2014: 1860-1872
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-28 20:43 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:
