output
20092026
most citedGuessing Smart: Biased Sampling for Efficient Black-Box Adversarial Attacks

112 citations

Showing 2017Show all

6 papers · 1 filter

math.LO2017★ 27 cited

Subexponentials in non-commutative linear logic

Max Kanovich, Stepan Kuznetsov, Vivek Nigam +1

Linear logical frameworks with subexponentials have been used for the specification of among other systems, proof systems, concurrent programming languages and linear authorization…

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.SE2017

Automated Analysis of Multi-View Software Architectures

Chih-Hong Cheng, Yassine Hamza, Harald Ruess

Software architectures usually are comprised of different views for capturing static, runtime, and deployment aspects. What is currently missing, however, are formal validation and…

cs.SE2017★ 12 cited

Arguing from Hazard Analysis in Safety Cases: A Modular Argument Pattern

Mario Gleirscher, Carmen Carlan

We observed that safety arguments are prone to stay too abstract, e.g. solutions refer to large packages, argument strategies to complex reasoning steps, contexts and assumptions l…

cs.PL2017★ 3 cited

Portability Analysis for Axiomatic Memory Models. PORTHOS: One Tool for all Models

Hernán Ponce-de-León, Florian Furbach, Keijo Heljanko +1

We present Porthos, the first tool that discovers porting bugs in performance-critical code. Porthos takes as input a program and the memory models of the source architecture for w…

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…