Skip to content

Commit 3f1cf77

Browse files
committed
Release 10(2)
1 parent 9c903f7 commit 3f1cf77

4 files changed

Lines changed: 24 additions & 3 deletions

File tree

2025/10/16/index.markdown

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -21,6 +21,8 @@ authors:
2121
affiliation: "Johannes Kepler University Linz, Austria"
2222
id: "0000-0002-0139-8044"
2323

24+
arxiv: "2508.03832"
25+
file: "https://arxiv.org/pdf/2508.03832v1.pdf"
2426
excerpt: |
2527
A vast number of software systems include components that parse and process structured input. In addition to programming languages, which are analyzed by compilers or interpreters, there are numerous components that process standardized or proprietary data formats of varying complexity. Even if such components were initially developed and tested based on a specification, such as a grammar, numerous modifications and adaptations over the course of software evolution can make it impossible to precisely determine which inputs they actually accept.
2628
In this situation, grammar mining can be used to reconstruct the specification in the form of a grammar. Established approaches already produce useful results, provided that sufficient input data is available to fully cover the input language. However, achieving this completeness is a major challenge. In practice, only input data recorded during the operation of the software systems is available. If this data is used for grammar mining, the resulting grammar reflects only the actual processed inputs but not the complete grammar of the input language accepted by the software component. As a result, edge cases or previously supported features that no longer appear in the available input data are missing from the generated grammar.
@@ -36,7 +38,7 @@ The Art, Science, and Engineering of Programming, 2025, Vol. 10, Issue 2, Articl
3638
Submission date: 2025-01-30
3739
Publication date: 2025-06-15
3840
DOI: <https://doi.org/10.22152/programming-journal.org/2025/10/16>
39-
Full text: *t.b.a*
41+
Full text: [PDF](https://arxiv.org/pdf/2508.03832v1.pdf)
4042

4143

4244
### Abstract

2025/10/17/index.markdown

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,6 +17,8 @@ authors:
1717
affiliation: "University of Utah, USA"
1818
id: "0000-0001-7078-9287"
1919

20+
arxiv: "2508.03830"
21+
file: "https://arxiv.org/pdf/2508.03830v1.pdf"
2022
excerpt: |
2123
**Context:**
2224
The design of static type systems that can validate dynamically-typed programs (**gradually**) is an ongoing challenge. A key difficulty is that dynamic code rarely follows datatype-driven design. Programs instead use runtime tests to narrow down the proper usage of incoming data. Type systems for dynamic languages thus need a **type narrowing** mechanism that refines the type environment along individual control paths based on dominating tests, a form of flow-sensitive typing. In order to express refinements, the type system must have some notion of sets and subsets. Since set-theoretic types are computationally and ergonomically complex, the need for type narrowing raises design questions about how to balance precision and performance.
@@ -39,7 +41,7 @@ The Art, Science, and Engineering of Programming, 2025, Vol. 10, Issue 2, Articl
3941
Submission date: 2025-02-01
4042
Publication date: 2025-06-15
4143
DOI: <https://doi.org/10.22152/programming-journal.org/2025/10/17>
42-
Full text: *t.b.a*
44+
Full text: [PDF](https://arxiv.org/pdf/2508.03830v1.pdf)
4345

4446

4547
### Abstract

2025/10/18/index.markdown

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -25,6 +25,8 @@ authors:
2525
affiliation: "University of Oslo, Norway"
2626
id: "0000-0003-0976-5678"
2727

28+
arxiv: "2508.03831"
29+
file: "https://arxiv.org/pdf/2508.03831v1.pdf"
2830
excerpt: "Data protection laws such as GDPR aim to give users unprecedented control over their personal data. Compliance with these regulations requires systematically considering information flow and interactions among entities handling sensitive data. Privacy-by-design principles advocate embedding data protection into system architectures as a default. However, translating these abstract principles into concrete, explicit methods remains a significant challenge. This paper addresses this gap by proposing a language-based approach to privacy integration, combining static and runtime techniques. By employing type checking and type inference in an active object language, the framework enables the tracking of authorised data flows and the automatic generation of constraints checked at runtime based on user consent. This ensures that personal data is processed in compliance with GDPR constraints. The key contribution of this work is a type system that gather the compliance checks and the changes to users consent and integrates data privacy compliance verification into system execution. The paper demonstrates the feasibility of this approach through a soundness proof and several examples, illustrating how the proposed language addresses common GDPR requirements, such as user consent, purpose limitation, and data subject rights. This work advances the state of the art in privacy-aware system design by offering a systematic and automated method for integrating GDPR compliance into programming languages. This capability has implications for building trustworthy systems in domains such as healthcare or finance, where data privacy is crucial."
2931
---
3032
Chinmayi Prabhu Baramashetru[^1] [![OrcidLogo]](https://orcid.org/0000-0001-5344-0032), Paola Giannini[^2] [![OrcidLogo]](https://orcid.org/0000-0003-2239-9529), Silvia Lizeth Tapia Tarifa[^3] [![OrcidLogo]](https://orcid.org/0000-0001-9948-2748), and Olaf Owe[^4] [![OrcidLogo]](https://orcid.org/0000-0003-0976-5678)
@@ -34,7 +36,7 @@ The Art, Science, and Engineering of Programming, 2025, Vol. 10, Issue 2, Articl
3436
Submission date: 2025-02-02
3537
Publication date: 2025-06-15
3638
DOI: <https://doi.org/10.22152/programming-journal.org/2025/10/18>
37-
Full text: *t.b.a*
39+
Full text: [PDF](https://arxiv.org/pdf/2508.03831v1.pdf)
3840

3941

4042
### Abstract

2025/10/index.markdown

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -45,6 +45,21 @@ Dimi Racordon, Eugene Flesselle, and Cao Nguyen Pham
4545

4646

4747

48+
* [Volume 10, Issue 2](issue2)
49+
50+
51+
52+
53+
{: start="16"}
54+
1. [Generating Inputs for Grammar Mining using Dynamic Symbolic Execution](/2025/10/16)
55+
Andreas Pointner, Josef Pichler, and Herbert Prähofer
56+
1. [If-T: A Benchmark for Type Narrowing](/2025/10/17)
57+
Hanwen Guo and Ben Greenman
58+
1. [A Type System for Data Privacy Compliance in Active Object Languages](/2025/10/18)
59+
Chinmayi Prabhu Baramashetru, Paola Giannini, Silvia Lizeth Tapia Tarifa, and Olaf Owe
60+
61+
62+
4863

4964

5065

0 commit comments

Comments
 (0)