A Domain-Specific Language for Payroll Calculations: An Experience Report from DATEV

Voelter, Markus; Koščejev, Sergej; Riedel, Marcel; Deitsch, Anna; Hinkelmann, Andreas

doi:10.1007/978-3-030-73758-0_4

Cited by 3 publications

(2 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…14 KernelF features advanced error checking and verification based on constraint solving with the Z3 solver. In a case study on payroll calculations, 15 these techniques are applied to statically check completeness and overlap of domain-specific switch-like expressions. These forms of static analysis are similar to the interactive analysis of CSX.…”

Section: Related Workmentioning

confidence: 99%

Taming complexity of industrial printing systems using a constraint‐based DSL: An industrial experience report

et al. 2023

View full text Add to dashboard Cite

Flexible printing systems are highly complex systems that consist of printers, that print individual sheets of paper, and finishing equipment, that processes sheets after printing, for example, assembling a book. Integrating finishing equipment with printers involves the development of control software that configures the devices, taking hardware constraints into account. This control software is highly complex to realize due to (1) the intertwined nature of printing and finishing, (2) the large variety of print products and production options for a given product, and (3) the large range of finishers produced by different vendors. We have developed a domain‐specific language called CSX that offers an interface to constraint solving specific to the printing domain. We use it to model printing and finishing devices and to automatically derive constraint solver‐based environments for automatic configuration. We evaluate CSX on its coverage of the printing domain in an industrial context, and we report on lessons learned on using a constraint‐based DSL in an industrial context.

show abstract

Section: Related Workmentioning

confidence: 99%

Taming complexity of industrial printing systems using a constraint‐based DSL: An industrial experience report

et al. 2023

View full text Add to dashboard Cite

show abstract

“…Voelter et al use SMT solving with the Z3 solver for advanced error checking and verification in the KernelF language [16], a reusable functional language for the development of DSLs. Voelter et al apply SMT solving successfully in a DSL on a case study for the domain of payroll calculations [17], i.e. for statically checking completeness and overlap of domain-specific switch-like expressions.…”

Section: Related Workmentioning

confidence: 99%

Configuration Space Exploration for Digital Printing Systems

Denkers¹,

Brünner²,

Gool³

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Within the printing industry, much of the variety in printed applications comes from the variety in finishing. Finishing comprises the processing of sheets of paper after being printed, e.g. to form books. The configuration space of finishers, i.e. all possible configurations given the available features and hardware capabilities, are large. Current control software minimally assists operators in finding useful configurations. Using a classical modelling and integration approach to support a variety of configuration spaces is suboptimal with respect to operatability, development time, and maintenance burden.In this paper, we explore the use of a modeling language for finishers to realize optimizing decision making over configuration parameters in a systematic way and to reduce development time by generating control software from models.We present CSX, a domain-specific language for high-level declarative specification of finishers that supports specification of the configuration parameters and the automated exploration of the configuration space of finishers. The language serves as an interface to constraint solving, i.e., we use low-level SMT constraint solving to find configurations for high-level specifications. We present a denotational semantics that expresses a translation of CSX specifications to SMT constraints. We describe the implementation of the CSX compiler and the CSX programming environment (IDE), which supports well-formedness checking, inhabitance checking, and interactive configuration space exploration. We evaluate CSX by modelling two realistic finishers. Benchmarks show that CSX has practical performance (<1s) for several scenarios of configuration space exploration.

show abstract

Programming vs. That Thing Subject Matter Experts Do

Voelter¹

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A Domain-Specific Language for Payroll Calculations: An Experience Report from DATEV

Cited by 3 publications

References 32 publications

Taming complexity of industrial printing systems using a constraint‐based DSL: An industrial experience report

Taming complexity of industrial printing systems using a constraint‐based DSL: An industrial experience report

Configuration Space Exploration for Digital Printing Systems

Programming vs. That Thing Subject Matter Experts Do

Contact Info

Product

Resources

About