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

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, is introduced.

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

Static Analysis Possibilities for Regular Expressions in C++

This research measured 26 different popular open-source projects and found that in more than two-thirds of the time, constructors used hardcoded parameters, which opens the possibility for the creation of an effective static analysis tool.

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

It is shown how the protocol pseudocode can be expressed easily, essentially line-by-line, in a precise high-level language, DistAlgo, for direct execution in distributed systems.

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.

Zi-Nan 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

CPyGraph, a C++ framework for package-level analysis of native CPython bytecode, is presented, a C++ framework for package-level analysis of native CPython bytecode that matches PyCG on its 112-program call-graph benchmark.

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.