<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Model-Based Framework for Legal Policy Simulation and Legal Compliance Checking</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>A. Problem Statement</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ghanem Soltana SnT Centre for Security, Reliability and Trust, University of Luxembourg</institution>
          ,
          <country country="LU">Luxembourg</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>-Analyzing legal policies for many laws, such as taxes and social benefits, is a common way for governments to identify risks, e.g., risk of legal policies not achieving expected revenue. A typical analysis includes validation of policies and the verification of the systems implementing them. One efficient way to validate policies is simulation, e.g., by simulating whether a proposed law reform would realize target objectives. Once validated, policies are implemented into public administration procedures and eGovernment applications. Systems implementing legal policies also need to be analyzed and verified, e.g., through testing, to ensure that they are compliant with the underlying policies. Currently, legal policy analysis is conducted using a combination of spreadsheets and software code. Such strategy suffers mainly from being hard to use by legal experts due to the lack of adequate background. This is partly rooted in the fact that available techniques to formalize legal policies are based on complex logical expressions and code. The main goal of this research project, that this paper describes, is to narrow the aforementioned expertise gap by proposing convenient, systematic and automated techniques to support analysis of legal polices from their design to their implementation. Index Terms-Legal Policies, Model-Based Simulation, Compliance Verification, Model-Driven Code and Data Generation</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        I. PROBLEM STATEMENT AND RESEARCH METHODOLOGY
[Context] Laws are extended, reviewed and revised on a
regular basis to ensure that they meet fiscal, monetary, and social
expectations. Thoroughly assessing risks related to designing
and implementing legal policies for many laws, e.g., taxation
and social benefits, is a major concern for governments.
Computer-assisted analyzers have been increasingly used in
recent years as tools for: (1) validating legal policies [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]–[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ],
e.g., by checking that policies are aligned with the provisional
budget of the government, and (2) verifying systems
compliance to the underlying laws [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], e.g., through testing.
[Scope] In a nuanced field such as law, providing adequate
support for automated analysis depends mainly on having
a focused scope. This project targets prescriptive laws, i.e.,
highly regulated laws, such as taxation, that are defined by a
set of legal policies– a legal policy being the textual definition
of step-by-step guidance in the form of procedures to apply for
compliance [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Nevertheless, we believe that this works can
be tailored to other laws, e.g., declarative laws that are founded
on permissions, obligations, and prohibitions. In this paper, we
take legal policies to mean “procedural” legal policies.
[Motivation] Legal policies need to be validated to check that
they actually lead to their expected results and nothing else. In
practice, validation is done by conducting several simulation
scenarios over the policies. An example of a simulation
scenario is to quantify the effect of modifying the policies on
variables of interest such as the revenue, while assessing that
no undesirable side effects can occur, e.g., provoking a high
increase in tax dues for low-earning families. Quantifying the
outcome of a set of policies in a precise manner is not a trivial
task due to: (1) the high number of policies to consider, (2)
the complexity of the procedures specified by the policies, and
(3) the inter-relationships between policies, e.g., some policies
being mutually exclusive or complementary. Once validated,
policies are implemented into administrative procedures and
software systems. At this stage, system verification is needed
to ensure that systems being built are indeed compliant to the
law. To be effective, compliance verification has to consider
the subtleties of the targeted legal jurisdiction, e.g., the
procedural aspect of prescriptive laws.
[Policy formalization challenge] A key prerequisite for any
kind of automated analysis is to formalize legal policies in
a syntactically and semantically well-defined form. To date,
policy formalization are mainly based on complex logical
expressions and code [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. An important factor to consider
here is that these formalizations are simultaneously used
by several stakeholders with different and non-overlapping
backgrounds, e.g., legal experts and system analysts. An open
question here then is how to interpret the underlying law so
that the resulting formalizations are, on the one hand, intuitive
enough to all types of users, and on the other hand detailed
enough to be analyzable through automated means.
      </p>
      <p>
        In addition, when legal text undergoes modification, it is
difficult to trace the impact of changes on the developed
artifacts if no support is provided within the policy formalizations.
The inability to automatically identify the impact of changes
would not only complicate the testing of the system once the
changes made, but can also introduce further inconsistencies
between the legal texts, legal requirements, and the system
implementation.
[Data generation for V&amp;V of legal policies challenge]
Outputs of both targeted analysis in this project, i.e., simulation
and testing, are obtained by processing some data as input,
e.g., simulation data. However, one might face the situation
where no complete and usable input data is available. This is
particularly true when new policies are being added to the
current legislation (no real historical data). Test case generation
has long been studied to generate fault-revealing inputs for
testing [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. On the other hand, few works address simulation
data generation. A challenge is to devise a data generator that:
(1) is scalable, as many simulation cases are needed, and (2)
produce representative samples of the underlying population,
to ensure the reliability and precision of the simulation results.
B. Research methodology
      </p>
      <p>
        The research methodology of this project follows an
industry based collaboration paradigm for research innovation [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ],
[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. One particularity of such paradigm is that most research
activities are realized in close collaboration with industrial
partners. Adopting such research methodology promotes
tackling tangible problems in their real settings. Furthermore,
proposed solutions can be empirically validated thorough
industrial case studies. In our context, this project was motivated by
an initiative of the government of Luxembourg to enhance its
current practices in analyzing legal policies. Our collaborating
institutes are: (1) Centre des technologies de l’information de
l’Etat, Luxembourg’s government computing center, and (2)
the Inland Revenue Office of Luxembourg.
      </p>
    </sec>
    <sec id="sec-2">
      <title>II. RELATED WORK</title>
      <p>In this section, we present related work on the topics of
legal policies modeling, legal policy simulation, and legal
compliance verification.</p>
      <p>
        Legal policies modeling. Legal policy formalizations have
long been studied in the artificial intelligence community [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ],
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]–[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Notable among these is the work by Rissland and
Skal [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] that combines different knowledge representation
techniques to capture then reproduce the reasoning of legal
experts in tax court cases. Melz and Valente [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] build a
domain-specific ontology for the US internal revenue code
and discuss applications for tax assistance systems using their
ontology. These formalizations were primarily developed for
performing expert search and question-answer reasoning
without considering the software engineering aspects of systems
implementing them. In particular, missing from the
abovecited work is an operational view of the legal policies, the
verification of software compliance to the law, and enabling
automated analysis such as simulation. In contrast, our
proposed research has a strong software engineering orientation.
The formalization that we propose captures workflows of legal
policies while providing executable semantics that will later
enable simulation and testing.
      </p>
      <p>
        Little work exists that addresses the development of
largescale legal applications from a software engineering
perspective. For example, Breaux et al. [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] proposed a rule-based
framework that enables executives, business managers, and
developers to distribute legal obligations. van Engers et al.
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] applied a methodology based on UML for modeling the
Dutch tax legislation to facilitate the communication between
developers and legal experts. Nevertheless, the aforementioned
work also share the same limitations observed for work from
the artificial intelligence community. Unlike the modeling
approach that we proposed in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], these strands of work lack
operationalization means to support the automated analysis
targeted in our context, i.e., simulation and testing.
Furthermore, our modeling methodology provides guidance on how
to efficiently build policy formalization from scratch. Our
modeling notation also manages traceability between the legal
text, the detailed legislature that elaborate and interpret the
law, and the underlying software system. This enables us, for
instance, to locate the system components that are impacted
by a change in the law.
      </p>
      <p>
        Legal policy simulation. Several legal policy simulation tools
were proposed in the area of applied economics [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]–[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
Nevertheless, these tools do not adequately address the expertise
gap between legal experts and system analysts. Policies are
usually implemented using software code, logical expressions
or equations. For example, EUROMOD [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] uses a combination
of spreadsheets and C++ to operationalize legal policies.
Thus, the implemented interpretation of the law cannot be
understood by legal experts. Our framework addresses this
gap by providing a more abstracted way to specify legal
policies, so that the resulting specifications would be palatable
to legal experts with a reasonable amount of training. The
second limitation of the above-mentioned tools concerns the
simulation data. These tools assume that complete and precise
simulation data is given as input. This is a strong requirement
that is not always feasible in practice. For instance, when
new policies are being introduced, no real historical data may
be available. In contrast, our simulation framework comes
equipped with a built-in data generator that produces, if
needed, hypothetical but realistic simulation data, based on
historical aggregate distributions and/or expert estimates.
Legal compliance verification. Several methods were
proposed to ensure business processes compliance with legal
policies in domains such as healthcare [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and finance [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
For instance, Ghanavati et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] tracks legal compliance by a
framework based on combining goal, use case and privacy goal
models. Hassan and Logrippo [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] provide a semi-automatic
method for checking compliance of enterprise requirements
with respect to legal requirements using formal logic.
      </p>
      <p>
        Few strands address compliance for software systems.
Existing work on regulatory compliance for software is geared
towards corporate governance, privacy, and security [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]–[
        <xref ref-type="bibr" rid="ref21">21</xref>
        ].
In contrast, our research targets specific aspects of compliance
that are proper to procedural legal policies that are the scope
of this project (see Section I). A major concern in prescriptive
laws is ensuring that the software systems are performing all
calculations, e.g., tax deductions, only for eligible individuals
and as specified by the underlying provisions.
      </p>
    </sec>
    <sec id="sec-3">
      <title>III. PROPOSED SOLUTION</title>
      <p>
        This section provides an overview of the approach we
propose to enable automated analysis of legal policies while
addressing the aforementioned gaps (see Sections I and II).
The proposed solution, shown in Fig. 1, consists on a
framework based on model driven engineering techniques [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ],
where models are the main development artifacts. We opted
for such solution because we believe that models are a more
structured, precise, and yet intuitive way to formalize policies
in comparison with plain text, logical expressions and code.
Below, we briefly describe the steps of the framework.
      </p>
      <p>In Step one, Model legal policies, models of policies to
analyze are built by analysts with help from legal experts.
This step has two outputs: (1) a domain model, and (2) policy
models that capture the procedures envisaged by the law. These
models will be further detailed in Section IV.</p>
      <p>Step two, Generate code, is a transformation that derives
executable code from policy models. This code constitutes
the core of the analyzer engine of Step five. The appropriate
language to use and the analyzer’s components that need to be
completed are determined according to the type of the analysis.
For example, Matlab code is derived for simulation and
OCLbased oracle functions are derived for testing.</p>
      <p>Both steps, three and four, create an instance model from
the domain model. This instance model encapsulates data
that will be processed by Step five. Step three, Use existing
data, creates an instance model based on exiting data, e.g.,
historical data. If such data is not available, then Step four,
Generate data, creates an instance model based on one of the
predefined generation strategies. The appropriate strategy is
selected according to the type of the analysis to perform. For
simulation, a probabilistic generator is used to create data
that is statistically aligned to the real population. Whereas
for testing, search based techniques are used to meet other
objectives, such as maximizing code coverage.</p>
      <p>Step five, Run analysis, uses an engine to perform automated
analysis over legal policies. First, the engine executes the code
generated by Step two over the instance model created in
the previous step (step three or four). Then, outputs/traces
of policy models execution are gathered and analyzed for
performing a particular simulation scenario or for compliance
verification. For example, one simulation scenario is to
quantify the impact of introducing new policies on variables of
interest, e.g., taxpayers’ net incomes. As shown in Fig. 1,
an extra input is used by this step when performing software
verification. This input is the outputs/traces of executing the
system under test over the same data used for simulation. The
system is deemed compliant if and only if outputs/traces from
both executions (system under test and policy models) are
identical, once mapped to the same level of granularity and
precision. Finally, results are plotted and displayed to the user.</p>
    </sec>
    <sec id="sec-4">
      <title>IV. PRELIMINARY WORK</title>
      <p>So far, three main milestones have been reached: (1) a
modeling approach for formalizing legal policies, (2) a
transformation that enables semantic execution of policy models created
using our modeling methodology, and (3) a probabilistic data
generator that creates representative simulation samples with
respect to a given population.</p>
      <p>
        Modeling approach We developed a modeling methodology
to formalize legal policies [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. As introduced in Section III,
the application of our modeling methodology yields two types
Relevant legal texts
      </p>
      <p>Model legal</p>
      <p>policies ¨
k
c
a
b
d
e
eF Policy</p>
      <p>models
Results report</p>
      <p>Domain model
Generate
code ≠
Executable</p>
      <p>code</p>
      <p>Run
analysis ∞</p>
      <p>
        Fig. 1. Model-based Framework for Analyzing Legal Policies
of models: (1) a UML class diagram representing the domain
model, and (2) policy models that capture the procedures
defined within the law. We use standard practices for domain
modeling to build the class diagram. The class diagram in
our methodology is an instrument for defining the inputs
that policy models use. As for policy models, they are UML
activity diagrams extended with additional semantics captured
by a UML profile [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. We opted to use activity diagrams
partly because they are well-documented and widely used, but
mainly because government agents, including legal experts, are
familiar with simple conceptual models and business process
models from earlier exposure and training.
      </p>
      <p>
        An example of a policy model that calculates the tax
deduction granted to a taxpayer for disability is depicted in
Fig. 2. Gray boxes, at the left side of the model, represent
input parameters involved in the calculation of this particular
deduction, e.g., is_disabled. The core of this policy model
encompasses three alternative deduction calculations, denoted by
the actions with the «calculate» stereotype. Each calculation
is defined by a corresponding formula («formula»). Based on
the taxpayer’s eligibility, assessed through decisions (having
«decision» stereotype), the appropriate calculation is applied.
For instance, if a given taxpayer is not disabled, this policy
yields a value of zero; otherwise, another alternative is selected
based on disability type, e.g., Standard deduction. In addition
to the above described elements, the policy model contains
an operation, marked by the «assert» stereotype, that specifies
properties to test during a compliance checking analysis. For
instance, the assert operation in Fig. 2 verifies that the outcome
produced by system implementing the deduction for disability
policy matches the outcome envisaged by the policy model.
Policy models operationalization We developed a rule-based
transformation algorithm [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. This transformation gives
policy model execution semantic to enable their automated
analysis. This model-to-text transformation was built on top of
Papyrus (eclipse.org/papyrus/) and was encoded using Acceleo
(eclipse.org/acceleo/). Further tool support details and
examples of generated code can be found in [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. At this stage,
the transformer supports three target languages, i.e., Java,
OCL, and Matlab. As discussed in Section III, the appropriate
language is used based on the type of desired analysis, e.g.,
OCL invariants for testing.
      </p>
      <p>
        Probabilistic simulation data generation To be able to
faithfully capture the properties of the population that is subject
to simulation, we proposed in [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] a UML profile (not
to be confused with the profile for policy models). This
profile extends class diagrams with a variety of probabilistic
notions, including probabilistic attributes, multiplicities and
specializations, as well as conditional probabilities. Using this
profile one could indicate, for instance, that values of a given
attribute should be drawn from a normal distribution. Such
statistical information is available from census data or can
be elicited from domain experts. We have also developed
an automated data generator that uses the above described
profile to generate realistic simulation data samples. Further
information, such as the generation strategy we developed to
satisfy the multiplicity constraints, can be found in [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
      </p>
    </sec>
    <sec id="sec-5">
      <title>V. EXPECTED CONTRIBUTIONS</title>
      <p>A modeling methodology for expressing legal policies: We
propose a modeling methodology that: (1) raises the level
of abstraction for specifying legal policies, (2) provides a
clear interpretation of the law, and (3) maintains traceability
between models, legal texts and software systems. We believe
that a higher level of abstraction mitigates the expertise gap
that legal experts are facing (discussed in Sections I and II).
A model-based probabilistic data generator: We introduce a
UML-class diagram instantiator that is based on a new UML
profile for capturing the probabilistic characteristics of a given
population. As described in Section III, it is important to
provide several generation strategies that maximize the fitness
of the generated data with regards to the analysis to perform.
For instance, one objective to meet when simulating policies
is to generate data that is likely to be sampled from the real
population. However, when performing testing, an objective
should be to maximize the number of detected faults.
A framework for analyzing legal policies: Our ultimate
expected contribution is to propose a framework that
supports various forms of policy analysis. Our framework should
overcome the limitations discussed in Sections I and II while
enabling: (1) the estimation of variables of interest, e.g.,
expected revenue from a given set of policies (2) change impact
analysis activities, to determine the impact that a modification
in the law would have on development artifacts or on variables
of interest, (3) consistency checking, to identify undesirable
situations that would violate operating principles, and (4) legal
compliance checking, to detect defects in software systems
implementing the policies. We believe that the executable
semantics of our policy models combined with search-based
techniques would provide the adequate infrastructure to
support the aforementioned analysis.</p>
    </sec>
    <sec id="sec-6">
      <title>VI. PLAN FOR EVALUATION AND VALIDATION</title>
      <p>To assess the soundness, effectiveness and efficiency of the
proposed solutions in addressing the problem of Section I, we
rely mainly on industrial case studies.</p>
      <p>
        As mentioned in Section I-B, this project places a lot of
emphasis on case studies conducted in collaboration with
industry. The validation has started at an early stage of
the project as some milestones were already reached. For
instance, we conducted a case study over the Luxembourgish
personal income tax law to a verify that: (1) the level of
effort required to build policy models is reasonable, and (2)
policy models built using our methodology are less complex
than policies specified using OCL– evaluated through several
structural complexity factors from [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. Results of this case
study were promising and suggest that our solution tackles
to a large extent the policy formalization challenge described
in Section I. We further plan to conduct a usability study to
assess how convenient to use our developed tools are, e.g., the
probabilistic data generator and the policy models simulator.
      </p>
    </sec>
    <sec id="sec-7">
      <title>VII. CURRENT STATUS</title>
      <p>An overview of the planned activities alongside expected
completion dates is given in Fig. 3. Outcomes from activities
one and two were presented in Section I and Section II,
respectively. Status of activities three to five is presented in
Section IV. Below, we outline our current and future activities.</p>
      <p>
        We have taken a number of concrete steps towards
generating hypothetical but yet realistic simulation data (Activity
5). We developed a probabilistic data generator aimed at
producing a large instance model from a given UML class
diagram while respecting the probabilistic characteristics of
the underlying population [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. The key enablers of this
generator are: (1) a UML profile that captures the probabilities
to respect (described in Section IV), and (2) an efficient
generation strategy. For example, our generation strategy includes
1 pFireolbdlesmtu dfoyrmanudlation
2 Literature review
      </p>
      <sec id="sec-7-1">
        <title>3 Mmoedtheolidnoglongoytadtieofninaitniodn</title>
      </sec>
      <sec id="sec-7-2">
        <title>4 lOepgearlaptoiolincaylimzaotdioenlsof</title>
      </sec>
      <sec id="sec-7-3">
        <title>5 dTeastat agnednesriamtiuolnation</title>
      </sec>
      <sec id="sec-7-4">
        <title>6 sLiemguallaptoiolincy models</title>
      </sec>
      <sec id="sec-7-5">
        <title>7 Teovaollusabtiuoinlding and</title>
      </sec>
      <sec id="sec-7-6">
        <title>8 aDnisdsdeertfaetniosne writing</title>
        <p>11/2013
07/2014</p>
        <p>
          11/2013 - 07/2015
a slicing mechanism that improves scalability by narrowing
the generation to only what is relevant for the policy models
to analyze. However, our current generation strategy does not
consider additional constraints, e.g., OCL constraints attached
to the UML class diagram elements, that need to be satisfied
for consistency. To overcome this limitation, we plan to
investigate how our generator can be enhanced with constraint
solving capabilities, e.g., by integrating an OCL solver [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ].
        </p>
        <p>Currently, our policy simulator only supports basic
simulation scenarios such as result differencing, i.e., when an original
and a modified set of policies are executed over the same
simulation data; then the simulation results are compared to
quantify the impact of the proposed changes. In the future, we
would like to investigate search-based techniques in order to
incorporate more advanced simulation scenarios such as the
identification of undesirable situations, e.g., the identification
of exploitable loop-holes or operating principles that may be
violated by legal means.</p>
        <p>Acknowledgment. I thank my PhD supervisors, Dr. Mehrdad
Sabetzadeh and Prof. Dr. Lionel Briand for their guidance
and support. I am grateful to members of Luxembourg Inland
Revenue Office, in particular Thierry Prommenschenkel, for
sharing their legal knowledge with me. I acknowledge financial
support from Centre des technologies de l’information de
l’Etat and Fonds National de la Recherche under grants
FNR/P10/03 and FNR9242479.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>L.</given-names>
            <surname>Canova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Piccoli</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Spadaro</surname>
          </string-name>
          , “
          <source>SYSIFF</source>
          <year>2006</year>
          :
          <article-title>A microsimulation model for the french tax system</article-title>
          ,” MicroSimula - Paris School of Economics,
          <source>Technical report</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>F.</given-names>
            <surname>Figari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Paulus</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Sutherland</surname>
          </string-name>
          , “
          <article-title>Microsimulation and policy analysis,” in Handbook of Income Distribution</article-title>
          . Elsevier,
          <year>2015</year>
          , vol.
          <volume>2</volume>
          , pp.
          <fpage>2141</fpage>
          -
          <lpage>2221</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Hohls</surname>
          </string-name>
          , “
          <article-title>How to support (political) decisions?</article-title>
          ” in Electronic Government. Springer,
          <year>2013</year>
          , pp.
          <fpage>111</fpage>
          -
          <lpage>122</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>W.</given-names>
            <surname>Hassan</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Logrippo</surname>
          </string-name>
          , “
          <article-title>Requirements and compliance in legal systems: a logic approach</article-title>
          ,”
          <source>in Proceedings of 1st International Workshop on RE and Law (RELAW'08)</source>
          ,
          <year>2008</year>
          , pp.
          <fpage>40</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K.</given-names>
            <surname>Petersen</surname>
          </string-name>
          , “
          <article-title>The regulation of assisted reproductive technology: a comparative study of permissive and prescriptive laws and policies</article-title>
          ,
          <source>” Journal of law and medicine</source>
          , vol.
          <volume>9</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>483</fpage>
          -
          <lpage>497</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Bench-Capon</surname>
          </string-name>
          et al.,
          <source>“A history of AI and Law in 50 papers: 25 years of the International Conference on AI and Law,” Artificial Intelligence and Law</source>
          , vol.
          <volume>20</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>215</fpage>
          -
          <lpage>319</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>T. van Engers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Gerrits</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Boekenoogen</surname>
          </string-name>
          , E. Glassée, and
          <string-name>
            <given-names>P.</given-names>
            <surname>Kordelaar</surname>
          </string-name>
          , “
          <article-title>POWER: using UML/OCL for modeling legislation - an application report</article-title>
          ,”
          <source>in Proceedings of 8th International Conference on Artificial Intelligence and Law (ICAIL'08)</source>
          ,
          <year>2001</year>
          , pp.
          <fpage>157</fpage>
          -
          <lpage>167</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Briand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hemmati</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R. K.</given-names>
            <surname>Panesar-Walawege</surname>
          </string-name>
          ,
          <article-title>“A systematic review of the application and empirical investigation of search-based test case generation</article-title>
          ,
          <source>” IEEE Transactions on Software Engineering</source>
          , vol.
          <volume>36</volume>
          , no.
          <issue>6</issue>
          , pp.
          <fpage>742</fpage>
          -
          <lpage>762</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>T.</given-names>
            <surname>Gorschek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wohlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Carre</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Larsson</surname>
          </string-name>
          , “
          <article-title>A model for technology transfer in practice</article-title>
          ,
          <source>” IEEE Software</source>
          , vol.
          <volume>23</volume>
          , no.
          <issue>6</issue>
          , pp.
          <fpage>88</fpage>
          -
          <lpage>95</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Briand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Falessi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Nejati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sabetzadeh</surname>
          </string-name>
          , and T. Yue, “
          <article-title>Research-based innovation: A tale of three projects in model-driven engineering</article-title>
          ,”
          <source>in Proceedings of the 15th International Conference on Model-Driven Engineering Languages and Systems (MODELS'12)</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>793</fpage>
          -
          <lpage>809</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Stelmach</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Broz</surname>
          </string-name>
          ˙ek,
          <source>Methods of legal reasoning</source>
          . Springer,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>E.</given-names>
            <surname>Melz</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Valente</surname>
          </string-name>
          , “Modeling the tax code,”
          <source>in Proceedings of 2nd International Workshop on Regulatory Ontologies (WORM'04)</source>
          ,
          <year>2004</year>
          , pp.
          <fpage>652</fpage>
          -
          <lpage>661</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>E.</given-names>
            <surname>Rissland</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Skalak</surname>
          </string-name>
          , “CABARET:
          <article-title>Rule interpretation in a hybrid architecture,”</article-title>
          <source>International Journal of Man-Machine Studies</source>
          , vol.
          <volume>34</volume>
          , no.
          <issue>6</issue>
          , pp.
          <fpage>839</fpage>
          -
          <lpage>887</lpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>L.</given-names>
            <surname>Bibel</surname>
          </string-name>
          , “
          <article-title>AI and the conquest of complexity in law</article-title>
          ,
          <source>” Artificial Intelligence and Law</source>
          , vol.
          <volume>12</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>159</fpage>
          -
          <lpage>180</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>T.</given-names>
            <surname>Breaux</surname>
          </string-name>
          , “
          <article-title>Exercising due diligence in legal requirements acquisition: A tool-supported, frame-based approach</article-title>
          ,”
          <source>in Proceedings of 17th IEEE International Requirements Engineering Conference (RE'09)</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>225</fpage>
          -
          <lpage>230</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>G.</given-names>
            <surname>Soltana</surname>
          </string-name>
          , E. Fourneret,
          <string-name>
            <given-names>M.</given-names>
            <surname>Adedjouma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sabetzadeh</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Briand</surname>
          </string-name>
          , “
          <article-title>Using UML for modeling procedural legal rules: Approach and a study of luxembourg's tax law</article-title>
          ,”
          <source>in Proceedings of the 17th International Conference on Model-Driven Engineering Languages and Systems (MODELS'14)</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>450</fpage>
          -
          <lpage>466</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ghanavati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amyot</surname>
          </string-name>
          , and L. Peyton, “
          <article-title>Towards a framework for tracking legal compliance in healthcare</article-title>
          ,”
          <source>in Proceedings of 19th International Conference on Advanced Information Systems Engineering (CAiSE</source>
          <year>2007</year>
          ),
          <year>2007</year>
          , pp.
          <fpage>218</fpage>
          -
          <lpage>232</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>S.</given-names>
            <surname>Goedertier</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanthienen</surname>
          </string-name>
          , “
          <article-title>Designing compliant business processes with obligations and permissions</article-title>
          ,”
          <source>in Proceedings of 7th Workshop on Business Process Management (BPM'06)</source>
          ,
          <year>2006</year>
          , pp.
          <fpage>5</fpage>
          -
          <lpage>14</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>T.</given-names>
            <surname>Breaux</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Anton</surname>
          </string-name>
          , “
          <article-title>Analyzing regulatory rules for privacy and security requirements</article-title>
          ,
          <source>” IEEE Transactions on Software Engineering</source>
          , vol.
          <volume>34</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>5</fpage>
          -
          <lpage>20</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>S.</given-names>
            <surname>Islam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Mouratidis</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Jürjens</surname>
          </string-name>
          , “
          <article-title>A framework to support alignment of secure software engineering with legal regulations,” Software and System Modeling</article-title>
          , vol.
          <volume>10</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>369</fpage>
          -
          <lpage>394</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ingolfo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Siena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mylopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Susi</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Perini</surname>
          </string-name>
          , “
          <article-title>Arguing regulatory compliance of software requirements,” Data &amp; Knowledge Engineering</article-title>
          , vol.
          <volume>87</volume>
          , pp.
          <fpage>279</fpage>
          -
          <lpage>296</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>R.</given-names>
            <surname>France</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Rumpe</surname>
          </string-name>
          , “
          <article-title>Model-driven development of complex software: A research roadmap</article-title>
          ,” in
          <source>Future of Software Engineering (FOSE'07)</source>
          ,
          <year>2007</year>
          , pp.
          <fpage>37</fpage>
          -
          <lpage>54</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23] Object Management Group,
          <source>“UML 2</source>
          .
          <article-title>2 superstructure specification</article-title>
          ,”
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>G.</given-names>
            <surname>Soltana</surname>
          </string-name>
          , E. Fourneret,
          <string-name>
            <given-names>M.</given-names>
            <surname>Adedjouma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sabetzadeh</surname>
          </string-name>
          , and L. Briand, “
          <article-title>Using UML for modeling legal rules: Approach and a study of luxembourg's tax law,” Interdisciplinary Centre for Security, Reliability and Trust (SnT)</article-title>
          ,
          <source>Technical report no. TR-SnT-2014-3</source>
          ,
          <year>2014</year>
          , http://people.svv.lu/soltana/Models14.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>G.</given-names>
            <surname>Soltana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sannier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sabetzadeh</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Briand</surname>
          </string-name>
          , “
          <article-title>A modelbased framework for probabilistic simulation of legal policies</article-title>
          ,”
          <source>in Proceedings of the 18th International Conference on Model-Driven Engineering Languages and Systems (MODELS'15)</source>
          ,
          <year>2015</year>
          , (to appear).
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>L.</given-names>
            <surname>Reynoso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Genero</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Piattini</surname>
          </string-name>
          , “
          <article-title>Towards a metric suite for OCL expressions expressed within UML/OCL models</article-title>
          ,
          <source>” Journal of Computer Science and Technology</source>
          , vol.
          <volume>4</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>38</fpage>
          -
          <lpage>44</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Zohaib</given-names>
            <surname>Iqbal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Arcuri</surname>
          </string-name>
          , and L. Briand, “
          <article-title>Generating test data from OCL constraints with search techniques,”</article-title>
          <source>IEEE Transactions on Software Engineering</source>
          , vol.
          <volume>39</volume>
          , no.
          <issue>10</issue>
          , pp.
          <fpage>1376</fpage>
          -
          <lpage>1402</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>