Pierre Kelsen

54 papers A* 3A 4B 9C 3Misc 3Journal 15Unranked 16
YearRankTypeTitle / Venue / Authors
2025 A conf
Towards Human-in-the-Loop LLM-Enabled Domain Modeling.
ER
Jonathan Silva Mercado, Qin Ma, Jordi Cabot, Pierre Kelsen, Henderik A. Proper
2024 A conf
Application of the Tree-of-Thoughts Framework to LLM-Enabled Domain Modeling.
ER
Jonathan Silva Mercado, Qin Ma, Jordi Cabot, Pierre Kelsen, Henderik A. Proper
2021 — conf
Towards AI Assisted Domain Modeling.
ER (Workshops)
Christophe Feltus, Qin Ma, Henderik A. Proper, Pierre Kelsen
2020 J jnl
A Lightweight Modeling Approach Based on Functional Decomposition.
J. Object Technol.
Pierre Kelsen, Qin Ma, Christian Glodt
2020 J jnl
An experimental scrutiny of visual design modelling: VCL up against UML+OCL.
Empir. Softw. Eng.
Nuno Amálio, Lionel C. Briand, Pierre Kelsen
2019 J jnl
F-Alloy: a relational model transformation language based on Alloy.
Softw. Syst. Model.
Loïc Gammaitoni, Pierre Kelsen
2018 J jnl
Agile validation of model transformations using compound F-Alloy specifications.
Sci. Comput. Program.
Loïc Gammaitoni, Pierre Kelsen, Qin Ma
2018 Misc conf
Decomposing Models Through Dependency Graphs.
TASE
Qin Ma, Pierre Kelsen
2016 Misc conf
Agile Validation of Higher Order Transformations Using F-Alloy.
TASE
Loïc Gammaitoni, Pierre Kelsen, Qin Ma
2015 J jnl
A generic model decomposition technique and its application to the Eclipse modeling framework.
Softw. Syst. Model.
Qin Ma, Pierre Kelsen, Christian Glodt
2015 J jnl
Algorithms for tractable compliance problems.
Frontiers Comput. Sci.
Silvano Colombo Tosatto, Pierre Kelsen, Qin Ma, Marwane El Kharbili, Guido Governatori, Leendert W. N. van der Torre
2015 J jnl
Business Process Regulatory Compliance is Hard.
IEEE Trans. Serv. Comput.
Silvano Colombo Tosatto, Guido Governatori, Pierre Kelsen
2015 B conf
Designing languages using lightning.
SLE
Loïc Gammaitoni, Pierre Kelsen, Christian Glodt
2015 — conf
F-Alloy: An Alloy Based Model Transformation Language.
ICMT
Loïc Gammaitoni, Pierre Kelsen
2014 — conf
Combining Models with Code: A Tale of Two Languages.
ICGSE Workshops
Qin Ma, Sam Schmit, Christian Glodt, Pierre Kelsen
2014 — conf
Detecting Deontic Conflicts in Dynamic Settings.
DEON
Silvano Colombo Tosatto, Guido Governatori, Pierre Kelsen
2014 C conf
Domain-Specific Visualization of Alloy Instances.
ABZ
Loïc Gammaitoni, Pierre Kelsen
2014 — conf
Verifying Modelling Languages using Lightning: a Case Study.
MoDeVVa@MoDELS
Loïc Gammaitoni, Pierre Kelsen, Fabien Mathey
2013 — conf
Algorithms for Basic Compliance Problems.
ICST Workshops
Silvano Colombo Tosatto, Marwane El Kharbili, Guido Governatori, Pierre Kelsen, Qin Ma, Leendert W. N. van der Torre
2013 — conf
Towards an Abstract Framework for Compliance.
EDOC Workshops
Silvano Colombo Tosatto, Guido Governatori, Pierre Kelsen
2011 B conf
Building VCL Models and Automatically Generating Z Specifications from Them.
FM
Nuno Amálio, Christian Glodt, Pierre Kelsen
2011 B conf
CoReL: Policy-Based and Model-Driven Regulatory Compliance Management.
EDOC
Marwane El Kharbili, Qin Ma, Pierre Kelsen, Elke Pulvermüller
2011 B conf
Enterprise Regulatory Compliance Modeling Using CoReL: An Illustrative Example.
CEC
Marwane El Kharbili, Qin Ma, Pierre Kelsen, Elke Pulvermüller
2011 B conf
Models within Models: Taming Model Complexity Using the Sub-model Lattice.
FASE
Pierre Kelsen, Qin Ma, Christian Glodt
2011 — conf
Platform-Variant Applications from Platform-Independent Models via Templates.
WGT
Nuno Amálio, Christian Glodt, Frederico Pinto, Pierre Kelsen
2010 B conf
A Modular Model Composition Technique.
FASE
Pierre Kelsen, Qin Ma
2010 B conf
Modular Design by Contract Visually and Formally Using VCL.
VL/HCC
Nuno Amálio, Pierre Kelsen
2010 — conf
Specifying Structural Properties and Their Constraints Formally, Visually and Modularly Using VCL.
BMMDS/EMMSAD
Nuno Amálio, Pierre Kelsen, Qin Ma
2010 J jnl
Using VCL as an Aspect-Oriented Approach to Requirements Modelling.
LNCS Trans. Aspect Oriented Softw. Dev.
Nuno Amálio, Pierre Kelsen, Qin Ma, Christian Glodt
2010 C conf
VCL, a Visual Language for Modelling Software Systems Formally.
Diagrams
Nuno Amálio, Pierre Kelsen
2009 Misc conf
Domain Hierarchies: A Basic Theoretical Framework for Integrating Software Domains.
TASE
Pierre Kelsen, Qin Ma
2009 — conf
From platform-independent to platform-specific models using democles.
OOPSLA Companion
Christian Glodt, Pierre Kelsen, Nuno Amálio, Qin Ma
2009 C conf
Towards an Alloy Formal Model for Flexible Advanced Transactional Model Development.
SEW
Barbara Gallina, Nicolas Guelfi, Pierre Kelsen
2008 A conf
A Lightweight Approach for Defining the Formal Semantics of a Modeling Language.
MoDELS
Pierre Kelsen, Qin Ma
2008 J jnl
Specifying Executable Platform-Independent Models using OCL.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol.
Pierre Kelsen, Elke Pulvermüller, Christian Glodt
2007 — conf
DEMOCLES: a tool for executable modeling of platform-independent systems.
OOPSLA Companion
Christian Glodt, Pierre Kelsen, Elke Pulvermüller
2006 — conf
A declarative executable model for object-based systems based on functional decomposition.
ICSOFT (1)
Pierre Kelsen
2006 — conf
DEMOS: a tool for declarative executable modeling of object-based systems.
OOPSLA Companion
Christian Glodt, Pierre Kelsen
2004 — conf
A Simple Static Model for Understanding the Dynamic Behavior of Programs.
IWPC
Pierre Kelsen
2003 B conf
An Information-Based View of Representational Coupling in Object-Oriented Systems.
FASE
Pierre Kelsen
1996 J jnl
A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity.
Inf. Process. Lett.
Oscar Garrido, Pierre Kelsen, Andrzej Lingas
1996 — conf
Approximate Hypergraph Coloring.
SWAT
Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
1996 J jnl
Approximate Hypergraph Coloring.
Nord. J. Comput.
Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
1996 — conf
Neighborhood Graphs and Distributed Delta+1-Coloring.
SWAT
Pierre Kelsen
1996 A conf
Ranking and Unranking Trees Using Regular Reductions.
STACS
Pierre Kelsen
1995 J jnl
Computing Minimal Spanning Subgraphs in Linear Time.
SIAM J. Comput.
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan
1995 J jnl
On Finding Minimal Two-Connected Subgraphs.
J. Algorithms
Pierre Kelsen, Vijaya Ramachandran
1994 J jnl
An Optimal Parallel Algorithm for Maximal Matching.
Inf. Process. Lett.
Pierre Kelsen
1993 B conf
Fast Parallel Matching in Expander Graphs.
SPAA
Pierre Kelsen
1992 J jnl
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3.
Inf. Process. Lett.
Elias Dahlhaus, Marek Karpinski, Pierre Kelsen
1992 A* conf
Computing Minimal Spanning Subgraphs in Linear Time.
SODA
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan
1992 — —
Efficient Computation of Extremal Structures in Graphs and Hypergraphs
Pierre Kelsen
1992 A* conf
On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph
STOC
Pierre Kelsen
1991 A* conf
On Finding Minimal 2-Connected Subgraphs.
SODA
Pierre Kelsen, Vijaya Ramachandran