activity
20122024
most citedSubexponentials in non-commutative linear logic

27 citations · 77 across the 18 of their papers we have counts for

collaborators
Showing cs.LOShow all

9 papers · 1 filter

cs.LO2023

Technical-Report: Automating Recoverability Proofs for Cyber-Physical Systems with Runtime Assurance Architectures

Vivek Nigam, Carolyn Talcott

Cyber-physical systems (CPSes), such as autonomous vehicles, use sophisticated components like ML-based controllers. It is difficult to provide evidence about the safe functioning…

cs.LO2022

Automating Safety and Security Co-Design through Semantically-Rich Architecture Patterns

Yuri Gil Dantas, Vivek Nigam

During the design of safety-critical systems, safety and security engineers make use of architecture patterns, such as Watchdog and Firewall, to address identified failures and thr…

cs.LO2018★ 11 cited

Model-Based Safety and Security Engineering

Vivek Nigam, Alexander Pretschner, Harald Ruess

By exploiting the increasing surface attack of systems, cyber-attacks can cause catastrophic events, such as, remotely disable safety mechanisms. This means that in order to avoid…

cs.LO2018★ 2 cited

Symbolic Timed Observational Equivalence

Vivek Nigam, Carolyn Talcott, Abrãao Aires Urquiza

Intruders can infer properties of a system by measuring the time it takes for the system to respond to some request of a given protocol, that is, by exploiting time side channels.…

cs.LO2017

Proof-Relevant Logical Relations for Name Generation

Nick Benton, Martin Hofmann, Vivek Nigam

Pitts and Stark's -calculus is a paradigmatic total language for studying the problem of contextual equivalence in higher-order languages with name generation. Models for the $ν…

cs.LO2017★ 14 cited

Time, Computational Complexity, and Probability in the Analysis of Distance-Bounding Protocols

Max Kanovich, Tajana Ban Kirigin, Vivek Nigam +2

Many security protocols rely on the assumptions on the physical properties in which its protocol sessions will be carried out. For instance, Distance Bounding Protocols take into a…

cs.LO2016

Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems

Max Kanovich, Tajana Ban Kirigin, Vivek Nigam +2

Time-Sensitive Distributed Systems (TSDS), such as applications using autonomous drones, achieve goals under possible environment interference (\eg, winds). Moreover, goals are oft…

cs.LO2015

Towards the Automated Generation of Focused Proof Systems

Vivek Nigam, Giselle Reis, Leonardo Lima

This paper tackles the problem of formulating and proving the completeness of focused-like proof systems in an automated fashion. Focusing is a discipline on proofs which structure…

cs.LO2014★ 8 cited

A Proof Theoretic Study of Soft Concurrent Constraint Programming

Elaine Pimentel, Carlos Olarte, Vivek Nigam

Concurrent Constraint Programming (CCP) is a simple and powerful model for concurrency where agents interact by telling and asking constraints. Since their inception, CCP-languages…