activity
20172023
most citedModel Interpretability through the Lens of Computational Complexity

38 citations · 67 across the 16 of their papers we have counts for

collaborators
Showing cs.PLShow all

5 papers · 1 filter

cs.PL2023★ 1 cited

A Minimal Formulation of Session Types: The Sessions of Trios in Concert

Alen Arslanagić, Jorge A. Pérez, Dan Frumin

Session types are a type-based approach to the verification of message-passing programs. They specify communication structures essential to enforcing program correctness; by relyin…

cs.PL2022

Scalable Typestate Analysis for Low-Latency Environments

Alen Arslanagić, Pavle Subotić, Jorge A. Pérez

Static analyses based on typestates are important in certifying correctness of code contracts. Such analyses rely on Deterministic Finite Automata (DFAs) to specify properties of a…

cs.PL2021

Types and Terms Translated: Unrestricted Resources in Encoding Functions as Processes (Extended Version)

Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez

Type-preserving translations are effective rigorous tools in the study of core programming calculi. In this paper, we develop a new typed translation that connects sequential and c…

cs.PL2021★ 1 cited

Minimal Session Types for the -calculus (Extended Version)

Alen Arslanagic, Jorge A. Pérez, Anda-Amelia Palamariuc

Session types are a discipline for the static verification of message-passing programs. A session type specifies a channel's protocol as sequences of exchanges. It is most relevant…

cs.PL2021

A Decentralized Analysis of Multiparty Protocols

Bas van den Heuvel, Jorge A. Pérez

Protocols provide the unifying glue in concurrent and distributed software today; verifying that message-passing programs conform to such governing protocols is important but diffi…