# Alan HartmanUniversity of Haifa | haifa · Department of Information Systems

Alan Hartman

Ph. D.

## About

90

Publications

9,884

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

1,972

Citations

Introduction

Additional affiliations

October 2016 - October 2019

September 2013 - present

September 2008 - January 2011

**IBM India Research Laboratory**

Position

- Senior Researcher

## Publications

Publications (90)

IT departments in Multi-Business Organizations (MBOs) face challenges when providing services to satisfy business needs. In many cases, the services provided by an IT department do not address all the requirements of the relevant business units and hence are only partially adopted by a subset of units. While existing research on enterprise architec...

This paper discusses educating stakeholders of algorithmic systems (systems that apply Artificial Intelligence/Machine learning algorithms) in the areas of algorithmic fairness, accountability, transparency and ethics (FATE). We begin by establishing the need for such education and identifying the intended consumers of educational materials on the...

It is our great pleasure to welcome you to the Second FairUMAP workshop at UMAP 2019. This full-day workshop brings together researchers working at the intersection of user modeling, adaptation, and personalization on one hand, and bias, fairness and transparency in algorithmic systems on the other hand. The workshop was motivated by the observatio...

In an increasingly network aware global context where technology supports and enhances the systemic characteristics of the human service-based societies, design (lato sensu) is acquiring a prominent place. In that context, collaboration efforts were initiated in 2018 between the Interaction Design Association (IxDA), Service Design Network (SDN), a...

The workshop focus is on Algorithmic Transparency (AT) in Emerging Technologies. Naturally, the user interface is where and how the Algorithmic Transparency should occur and the challenge we aim at is how intelligent user interfaces can make a system transparent to its users.

A method of telephone call management in process of service development that allows a user to model and create telephone call management schemes independent of telecommunications protocols and network layer details. The method of the invention operates by creating an abstract model of a telephone call life-cycle that is converted, using a set of co...

Techniques for generating one or more artifacts for service delivery are provided. The techniques include receiving one or more service design inputs, using the one or more service design inputs to generate an internal representation of the service design, using the internal representation of the service to generate one or more artifacts of the ser...

The unprecedented scale of Information Technology (IT) service delivery requires careful analysis and optimization of service systems. The simulation is an efficient way to handle the complexity of modeling and optimization of real-world service delivery systems. However, typically developed custom simulation models lack standard architectures and...

Methods and systems are provided for adding variability support for a modeling language. Developers may utilize the added support to transform a model written in a preexisting domain-specific modeling language for product line development in which there is structural and configurational diversity. A variability layer is incorporated into the model,...

Cloud- and service-oriented computing paradigms are intrinopaque to their users, as they cannot inspect providers’ implementations, and important concerns about aspects like security, compliance, dependability can arise. Therefore, users have to make trust decisions with respect to software providers, with the hope that there will not be any detrim...

Many ICT applications involve the collection of personal information or in-formation on the behaviour of customers, users, employees, citizens, or pa-tients. The organisations that collect this data need to manage the privacy of these individuals. In many organisations there are insufficient data protection measures and a low level of trust among t...

Over the last several years, services science has emerged as an effective means to understand services and the socio-technical systems in which they are deployed. This systemic view requires a genuinely interdisciplinary approach to the study of services. In this chapter, we review a number of significant approaches to analyze, understand and model...

The COCKPIT methodology for participatory service design was developed for use in Europe under the assumption of existence of pervasive broadband technology and widespread use of the internet and social networking. This paper extends the COCKPIT methodology by adapting it to the realities of emerging markets, where poverty, illiteracy, lack of infr...

.com Abstract- In the recent past, the public sector has been under considerable pressure to reform itself. Rising consumer expectations aided by enhancements in social media, information and communication technologies and demand for transparency have added pressure on public service agencies to make the process more inclusive and participatory. Go...

This paper describes a methodology for the participatory design of services in the public sector. The stakeholders participating
in the design include three major players, the public which uses the service, the government body which sponsors and finances
the service, and the organization (government or third party) that delivers the service. We pro...

We define a
service delivery
system as a set of interacting entities that are involved in the delivery of one or more business services. A service operating
system manages the processes and resources within a service delivery system
. This paper develops a formal model for these concepts, with the goal of clearly and precisely describing the deli...

This paper describes a model for capturing service designs and the design of service product lines. The model promotes reuse of service artifacts, enables a balanced view of the service from different stakeholder viewpoints, and provides a foundation for design for service quality. The model leverages a phased approach to design, engineering and ma...

This book constitutes the refereed proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications, ECMDA-FA 2009, held in Enschede, The Netherlands, in June 2009.
The 23 revised full papers presented - 16 research papers and 7 industry papers - were carefully reviewed and selected from 72 submissions. Promoti...

This book constitutes the refereed proceedings of the 4th European Conference on Model Driven Architecture - Foundations and Applications, ECMDA-FA 2008, held in Berlin, Germany, in June 2008.
The 31 revised full papers presented - 21 research papers and 10 industry papers - were carefully reviewed and selected from 87 submissions. The papers addr...

The purpose of this symposium, held in conjunction with MoDELS 2006, was to present the current state of research of the UML2
Semantics Project. Equally important to receiving feedback from an audience of experts was the opportunity to invite researchers
in the field to discuss their own work related to a formal semantics for the Unified Modeling L...

In this paper, we describe the contributions to the workshop on domain specific approaches to software test automation. The workshop consists of six accepted papers and a keynote speech. The papers tackle a wide range of topics related to the testing of applications within specific domains including event driven software, synchronous safety critica...

A Steiner system (X,β), denoted Sλ(t,k,v), is a set X of points, of cardinality v, and a collection β of k-subsets of X called blocks, with the property that every t-subset of X is contained in precisely λ blocks. A quadruple system of order v is a Steiner system S1(3,4,v). A triple (X,β,γ) is called an (s,μ)-resolvable system if for some s<t, it i...

Today almost every IT specialist uses models of some form or another. Models help raise the abstraction level of a system description. Although models usually describe IT systems statically, they can also be used to describe the dynamic behaviour of the system. The OMG's MDA® approach suggests describing business and application logic separately fr...

In the 21st century our society is becoming more and more dependent on software systems. The safety of these systems and the quality
of our lives is increasingly dependent on the quality of such systems. A key element in the manufacture and quality assurance
process in software engineering is the testing of software and hardware systems. The constr...

Deployment of model-based testing involves many difficulties that have slowed down its industrial adoption. The leap from traditional scripted testing to model-based testing seems as hard as moving from manual to automatic test execution. Two key factors in the deployment are the language used to define the test models, and the language used for de...

Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution.

We describe the tools and interfaces created by the AGEDIS project, a European Commission sponsored project for the creation of a methodology and tools for automated model driven test generation and execution for distributed systems. The project includes an integrated environment for modeling, test generation, test execution, and other test related...

This article describes the AGEDIS project, a European Commission sponsored project for the creation of a methodology and tools for automated model driven test generation and execution for distributed systems. We describe the AGEDIS architecture, interfaces, and tools, and discuss some lessons learned over the three year life of the project.

The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference objet field. Improving the precision of practical points-to analysis is important because points-to information has a ...

Our research deals with test generation for software based on finite state machine (FSM) models of the program specification. We describe a set of coverage criteria and testing constraints for use in the automatic generation of test suites. We also describe the algorithms used to generate test suites based on these coverage criteria, and the implem...

In this paper we describe two experiments in the verification of software standard conformance. In our experiments, we use a model-based test generator to create a test suite for parts of the POSIX™ standard and another test suite for the specification of Java™ exception handling. We demonstrate that models derived from specifications produce bette...

This paper presents an architecture for model-based verifica-tion and testing using a profile of the Unified Modeling Language (UML). Class, object, and state diagrams are used to define essential models: de-scriptions that characterise the entire range of possible behaviours, in terms of the actions and events of the model. Object and state diagra...

This paper addresses the problem of executing abstract tests on distributed software. Although our focus is on specification based behavior testing that exploits model based test generation, we provide an environment that supports both automatic and manual test generation. Tests derived from a specification are by nature abstract. The tester must m...

One possible solution to the verification crisis is to bridge the
gap between formal verification and simulation by using hybrid
techniques. This paper presents a study of such a functional
verification methodology that uses coverage of formal models to specify
tests. This was applied to a modern superscalar microprocessor and the
resulting tests w...

A t-design with parameters t - (v, k, λ.) is a set X of cardinality v, together with a collection of subsets of X of size k called blocks. The number of blocks containing any particular t-subset of X is a constant λ. The simplest t-designs are regular multi-graphs (t=1, k=2, v= number of vertices, λ = degree of regularity). Necessary conditions on...

A Steiner quadruple system of order v, denoted SQS(v), is a pair (X; B) where X is a set of cardinality v, and B is a set of 4-subsets of X (called blocks), with the property that any 3-subset of X is contained in a unique block. If (X; B) is an SQS(v) and (Y; C) is an SQS(w) with Y ` X and C ` B, we say that (Y; C) is a subdesign of (X; B). Hanani...

We discuss a generalization of Wilson's fundamental construction for group divisible designs which is intended to produce 3-wise balanced designs, rather than pairwise balanced designs. The construction generalizes many known recursive constructions for Steiner quadruple systems and other related designs. The generalization of Wilson's construction...

Let n vertices be distributed on the circumference of a circle in the plane. We find, for every n, the minimum number of cycles with no crossing edges such that every pair of vertices is adjacent on at least one cycle. The problem arises from the design of a train shuttle service between n cities with continuous guaranteed service at all times, and...

We complete the determination of the sets of possible intersection sizes for Steiner quadruple systems of all orders v 2 or 4(mod 6), v ≠ 14, 26. For v = 26 we leave only one possible intersection size undecided. For v = 14 there are 20 undecided values.

A (v, к, λ) packing design of order v, block size к and index λ is a collection of к-element subsets, called blocks, of a v-set V such that every 2-subset of V occurs in at most λ blocks. The packing problem is to determine the maximum number of blocks in a packing design. The only previous work on the packing problem with к=6 concerns itself with...

The possible intersection sizes for Steiner quadruple systems are examined. The determination of possible intersection sizes for v ≡ 4, 8 (mod 12), v ⩾ 40, was recently completed by Lo Faro. For v ≡ 0 (mod 6), v ⩾ 42, we solve completely the analogous intersection problem for threewise balanced designs with a spanning set of blocks of size 6, and b...

Let $D( v )$ be the number of pairwise disjoint Steiner quadruple systems. A simple counting argument shows that $D( v )\leqq v - 3$. In this paper it is proved that $D( 2^k n )\geqq ( 2^k - 1 ) n,k\geqq 2$, if there exists a set of $3n$ pairwise disjoint Steiner quadruple systems of order $4n$ with a certain structure. This implies that $D( v )\ge...

A (v,k,λ) packing design of order v, block size k, and index λ is a collection of k-element subsets, called blocks, of a v-set, V, such that every 2-subset of V occurs in at most λ blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we solve the packing problem with k=5, λ=4, and all positive...

Let v be a non negative integer, let λ be a positive integer, and let K and M be sets of positive integers. A group divisible design, denoted by GD[K, λ, M, v], is a triple (X, Г, β) where X is a set of points, is a partition of X, and β is a class of subsets of X with the following properties. (Members of Г are called groups and members of β are c...

Let X be a finite set of cardinality v. We denote the set of all k-subsets of X by In this paper we consider the problem of partitioning into two parts of equal size, each of which is the block set of a 2-(v k, λ) design. We determine necessary and sufficient conditions on v for the existence of such a partition when k=3 or 4. We also construct par...

Let π be a permutation of the set { 1,2,...,v} having f<v fixed points and (v-f)/2 disjoint transpositions. We investigate the existence of Steiner triple systems admitting π as an automorphism. When f=1 such a system is known as a reverse Steiner triple system, and it is known that reverse Steiner triple systems exist if and only if v≡1,3,9 or 19...

A Steiner quadruple system of order v is a set X of cardinality v, and a set Q, of 4-subsets of X, called blocks, with the property that every 3-subset of X is contained in a unique block. A Steiner quadruple system is resolvable if Q can be partitioned into parallel classes (partitions of X). A necessary condition for the existence of a resolvable...

A partial triple system of order v, PT(v), is pair (V, B) where V is a v-set, and B is a collection of 3-subsets of V (called triples) such that each 2-subset of V is contained in at most one triple. A maximum partial triple system of order v, MPT(v), is a PT(v), (V, B), such that for any other PT(v), (V, C), we have |C| ⪕|B|. Several authors have...

A packing (respectively covering) design of order v, block size k, and index λ is a collection of k-element subsets, called blocks, of a v-set, V, such that every 2-subset of V occurs in at most (at least) λ blocks. The packing (covering) problem is to determine the maximum (minimum) number of blocks in a packing (covering) design. Motivated by the...

Let C(3, 4, n) be the minimum number of four-element subsets (called blocks) of an n-element set, X, such that each three-element subset of X is contained in at least one block. Let . Schoenheim has shown that C(3, 4, n) ⩾ L(3, 4, n). The construction of Steiner quadruple systems of all orders n≡2 or 4 (mod 6) by Hanani (Canad. J. Math.12 (1960), 1...

Parsing of strings has been suggested by Lempel and Ziv, as a tool to define the complexity of strings [LZ1] and to compress them [ZL1, ZL2]. Recently, they have shown that the scheme may be modified to handle two dimensional data [LZ2].

For positive integers t⩽k⩽v and λ we define a t-design, denoted Bi[k,λ;v], to be a pair (X,B) where X is a set of points and B is a family, (Bi:iϵI), of subsets of X, called blocks, which satisfy the following conditions: (i) |X|=v, the order of the design, (ii) |Bi|=k for each iϵI, and (iii) every t-subset of X is contained in precisely λ blocks....

A Steiner-quadruple system of order υ is an ordered pair (X, Q), where X is a set of cardinality υ, and Q is a set of 4-subsets of X, called blocks, with the property that every 3-subset of X is contained in a unique block. In this paper we show that if there exists a quadruple system of order V with a subsystem of order υ, then there exists a quad...

A quadruple system of order v, denoted QS(v) is an ordered pair (X, Q) where X is a set of cardinality v and Q is a set of 4-subsets of X called blocks, with the property that every 3-subset of X is contained in a unique block. The points and planes of the affine geometry AG(3, 2) form a QS(8). We prove that a QS(v) containing a proper subsystem is...

Construction and resolution of quadruple systems - Volume 23 Issue 2 - Alan Hartman

A Steiner quadruple system is an ordered pair (X,Q) where X is a finite set and Q is a set of 4-subsets of X such that every
3-subset of X is contained in a unique member of Q.
This paper gives a structure for studying all the known recursive constructions for quadruple systems. The structure is then
applied to existence problems for quadruple sys...

A Steiner system (X, ß), denoted S λ(t, k, v), is a set X of points, of cardinality v, and a collection β of k-subsets of X called blocks, with the property that every t-subset of X is contained in precisely λ blocks. A quadruple system is a Steiner system S 1(3,4, v). A triple (X, β, γ) is called an (s, μ)-resolvable system if, for some s<t, it is...

## Projects

Project (1)

Understanding how mobile phone and tablet technologies can be beneficial in the developing world.