Skip to content

Engineering a Regular-Type System for Unix and Linux Shell

· 0 citations · 59 references

TL;DR

RT’s regular types offer expressiveness appropriate for capturing a command’s standard input and output streams, support computationally tractable and efficient type checking, and provide an interface encoded as regular expressions familiar to developers versed in the Unix environment.

View source

Similar papers

Preprint Sep 2026

Large Language Models and Language Server Protocol: a match made in context

This article introduces Eiffel-tools, a language server protocol (LSP) implementation for the Eiffel programming language that uses Large Language Models (LLMs) to aid the development of statically verified software. The tool provides various interactive and non-interactive commands to produce code and specifications....

Alessandro Schena, I. Mustafin, Julia Kotovich · 0 citations
Conference Open access 2026

Static Analysis Possibilities for Regular Expressions in C++

Most of the regular expression libraries in current programming languages utilize a dynamic constructor parameter to construct a state machine, which will be used later in the matching. When this constructor parameter does not fulfill the requirements of the correct regular expression syntax, a runtime error – usually...

Tibor Teodor Fürész, Kristóf Umann, Zoltán Porkoláb · 0 citations
Preprint Sep 2026

Specifying Paxos for System Builders: Pseudocode Made Executable

This paper presents a precise executable specification---as a faithful mapping from the pseudocode---of Paxos for System Builders, a practical protocol for replication and consensus in distributed systems. Paxos for System Builders has both a robust implementation in C and a clean pseudocode for critical protocol detai...

Yan-Hong A. Liu, Rahul Sihag · 0 citations
Preprint Aug 2026

PyFlow: An Inter-procedural Static Analysis Framework for Python

PyFlow is presented, a generic IFDS-based static-analysis framework for Python that provides a multi-stage intermediate-representation pipeline and a generic IFDS solver parameterized by abstract domains and concludes with lessons learned from building IFDS analyses for Python.

Zinan Gu, Haoxiang Yan, Pei-Sen Yao · 0 citations
Book Open access Aug 2026

What Have We Learned about Dependently Typed Programming from Haskell? (Keynote)

The "rebound" library is used to demonstrate and reflect on the current capabilities of dependently-typed programming in Haskell, and supports working with well-scoped de Bruijn indices in abstract syntax trees.

Stephanie Weirich · 0 citations
Preprint Sep 2026

CPyGraph: A Version-Aware Static Analysis Framework for Native CPython Bytecode

Static analysis of Python packages must recover both program structure and object flow across first-class functions, dynamic dispatch, implicit protocol calls, exceptions, closures, and module execution. Native CPython bytecode provides the executable lowering of these behaviors, but its instruction, call, stack, and e...

Bai-Hong Chen, Wen Li · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.