default search action
Pierre Kelsen
Person information
- affiliation: University of Luxembourg
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c37]Jonathan Silva
, Qin Ma
Application of the Tree-of-Thoughts Framework to LLM-Enabled Domain Modeling. ER 2024: 94-111 - 2021
- [c36]Christophe Feltus, Qin Ma
Towards AI Assisted Domain Modeling. ER (Workshops) 2021: 75-89 - 2020
- [j15]Nuno Amálio
An experimental scrutiny of visual design modelling: VCL up against UML+OCL. Empir. Softw. Eng. 25(2): 1205-1258 (2020) - [j14]Pierre Kelsen, Qin Ma, Christian Glodt:
A Lightweight Modeling Approach Based on Functional Decomposition. J. Object Technol. 19(2): 15:1-22 (2020)
2010 – 2019
- 2019
- [j13]Loïc Gammaitoni, Pierre Kelsen:
F-Alloy: a relational model transformation language based on Alloy. Softw. Syst. Model. 18(1): 213-247 (2019) - 2018
- [j12]Loïc Gammaitoni, Pierre Kelsen, Qin Ma:
Agile validation of model transformations using compound F-Alloy specifications. Sci. Comput. Program. 162: 55-75 (2018) - [c35]Qin Ma, Pierre Kelsen:
Decomposing Models Through Dependency Graphs. TASE 2018: 138-143 - 2016
- [c34]Loïc Gammaitoni, Pierre Kelsen, Qin Ma:
Agile Validation of Higher Order Transformations Using F-Alloy. TASE 2016: 125-131 - 2015
- [j11]Silvano Colombo Tosatto, Pierre Kelsen, Qin Ma, Marwane El Kharbili, Guido Governatori
Algorithms for tractable compliance problems. Frontiers Comput. Sci. 9(1): 55-74 (2015) - [j10]Qin Ma, Pierre Kelsen, Christian Glodt:
A generic model decomposition technique and its application to the Eclipse modeling framework. Softw. Syst. Model. 14(2): 921-952 (2015) - [j9]Silvano Colombo Tosatto, Guido Governatori
Business Process Regulatory Compliance is Hard. IEEE Trans. Serv. Comput. 8(6): 958-970 (2015) - [c33]Loïc Gammaitoni, Pierre Kelsen:
F-Alloy: An Alloy Based Model Transformation Language. ICMT 2015: 166-180 - [c32]Loïc Gammaitoni, Pierre Kelsen, Christian Glodt:
Designing languages using lightning. SLE 2015: 77-82 - 2014
- [c31]Loïc Gammaitoni, Pierre Kelsen:
Domain-Specific Visualization of Alloy Instances. ABZ 2014: 324-327 - [c30]Silvano Colombo Tosatto, Guido Governatori
Detecting Deontic Conflicts in Dynamic Settings. DEON 2014: 65-80 - [c29]Qin Ma, Sam Schmit, Christian Glodt, Pierre Kelsen:
Combining Models with Code: A Tale of Two Languages. ICGSE Workshops 2014: 27-32 - [c28]Loïc Gammaitoni, Pierre Kelsen, Fabien Mathey:
Verifying Modelling Languages using Lightning: a Case Study. MoDeVVa@MoDELS 2014: 19-28 - 2013
- [c27]Silvano Colombo Tosatto, Guido Governatori
Towards an Abstract Framework for Compliance. EDOC Workshops 2013: 79-88 - [c26]Silvano Colombo Tosatto, Marwane El Kharbili, Guido Governatori
Algorithms for Basic Compliance Problems. ICST Workshops 2013: 2-7 - 2011
- [c25]Marwane El Kharbili, Qin Ma, Pierre Kelsen, Elke Pulvermüller:
CoReL: Policy-Based and Model-Driven Regulatory Compliance Management. EDOC 2011: 247-256 - [c24]Pierre Kelsen, Qin Ma, Christian Glodt:
Models within Models: Taming Model Complexity Using the Sub-model Lattice. FASE 2011: 171-185 - [c23]Nuno Amálio
Building VCL Models and Automatically Generating Z Specifications from Them. FM 2011: 149-153 - [c22]Marwane El Kharbili, Qin Ma, Pierre Kelsen, Elke Pulvermüller:
Enterprise Regulatory Compliance Modeling Using CoReL: An Illustrative Example. CEC 2011: 185-190 - [c21]Nuno Amálio
Platform-Variant Applications from Platform-Independent Models via Templates. WGT@ETAPS 2011: 3-25 - 2010
- [j8]Nuno Amálio
Using VCL as an Aspect-Oriented Approach to Requirements Modelling. LNCS Trans. Aspect Oriented Softw. Dev. 7: 151-199 (2010) - [c20]Nuno Amálio
Specifying Structural Properties and Their Constraints Formally, Visually and Modularly Using VCL. BMMDS/EMMSAD 2010: 261-273 - [c19]Nuno Amálio
VCL, a Visual Language for Modelling Software Systems Formally. Diagrams 2010: 282-284 - [c18]Pierre Kelsen, Qin Ma:
A Modular Model Composition Technique. FASE 2010: 173-187 - [c17]Nuno Amálio
Modular Design by Contract Visually and Formally Using VCL. VL/HCC 2010: 227-234
2000 – 2009
- 2009
- [c16]Christian Glodt, Pierre Kelsen, Nuno Amálio
From platform-independent to platform-specific models using democles. OOPSLA Companion 2009: 795-796 - [c15]Barbara Gallina, Nicolas Guelfi, Pierre Kelsen:
Towards an Alloy Formal Model for Flexible Advanced Transactional Model Development. SEW 2009: 94-103 - [c14]Pierre Kelsen, Qin Ma:
Domain Hierarchies: A Basic Theoretical Framework for Integrating Software Domains. TASE 2009: 295-296 - 2008
- [j7]Pierre Kelsen, Elke Pulvermüller, Christian Glodt:
Specifying Executable Platform-Independent Models using OCL. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 9 (2008) - [c13]Pierre Kelsen, Qin Ma:
A Lightweight Approach for Defining the Formal Semantics of a Modeling Language. MoDELS 2008: 690-704 - 2007
- [c12]Christian Glodt, Pierre Kelsen, Elke Pulvermüller:
DEMOCLES: a tool for executable modeling of platform-independent systems. OOPSLA Companion 2007: 870-871 - 2006
- [c11]Pierre Kelsen:
A declarative executable model for object-based systems based on functional decomposition. ICSOFT (1) 2006: 63-71 - [c10]Christian Glodt, Pierre Kelsen:
DEMOS: a tool for declarative executable modeling of object-based systems. OOPSLA Companion 2006: 716-717 - 2004
- [c9]Pierre Kelsen:
A Simple Static Model for Understanding the Dynamic Behavior of Programs. IWPC 2004: 46-51 - 2003
- [c8]Pierre Kelsen:
An Information-Based View of Representational Coupling in Object-Oriented Systems. FASE 2003: 216-230
1990 – 1999
- 1996
- [j6]Oscar Garrido, Pierre Kelsen, Andrzej Lingas:
A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity. Inf. Process. Lett. 58(2): 55-58 (1996) - [j5]Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan:
Approximate Hypergraph Coloring. Nord. J. Comput. 3(4): 425-439 (1996) - [c7]Pierre Kelsen:
Ranking and Unranking Trees Using Regular Reductions. STACS 1996: 581-592 - [c6]Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan:
Approximate Hypergraph Coloring. SWAT 1996: 41-52 - [c5]Pierre Kelsen:
Neighborhood Graphs and Distributed Delta+1-Coloring. SWAT 1996: 223-233 - 1995
- [j4]Pierre Kelsen, Vijaya Ramachandran:
On Finding Minimal Two-Connected Subgraphs. J. Algorithms 18(1): 1-49 (1995) - [j3]Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan:
Computing Minimal Spanning Subgraphs in Linear Time. SIAM J. Comput. 24(6): 1332-1358 (1995) - 1994
- [j2]Pierre Kelsen:
An Optimal Parallel Algorithm for Maximal Matching. Inf. Process. Lett. 52(4): 223-228 (1994) - 1993
- [c4]Pierre Kelsen:
Fast Parallel Matching in Expander Graphs. SPAA 1993: 293-299 - 1992
- [b1]Pierre Kelsen:
Efficient Computation of Extremal Structures in Graphs and Hypergraphs. University of Illinois Urbana-Champaign, USA, 1992 - [j1]Elias Dahlhaus, Marek Karpinski, Pierre Kelsen:
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. Inf. Process. Lett. 42(6): 309-313 (1992) - [c3]Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan:
Computing Minimal Spanning Subgraphs in Linear Time. SODA 1992: 146-156 - [c2]Pierre Kelsen:
On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph. STOC 1992: 339-350 - 1991
- [c1]Pierre Kelsen, Vijaya Ramachandran:
On Finding Minimal 2-Connected Subgraphs. SODA 1991: 178-187
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-02 21:26 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: