Arjun Viswanathan
YOU?
Author Swipe
View article: An Interactive SMT Tactic in Coq using Abductive Reasoning
An Interactive SMT Tactic in Coq using Abductive Reasoning Open
A well-known challenge in leveraging automatic theorem provers, such as satisfiability modulo theories (SMT) solvers, to discharge proof obligations from interactive theorem provers (ITPs) is determining which axioms to send to the solver …
View article: Attack-Defense Tree-based Security Analysis and Optimal Defense Synthesis for System Design
Attack-Defense Tree-based Security Analysis and Optimal Defense Synthesis for System Design Open
Attack-Defense Trees (ADTrees) are widely used in the security analysis of software systems. In this work, we introduce a novel approach to analyze system architecture models via ADTrees and to synthesize an optimal cost defense solution u…
View article: Formal Verification of Bit-Vector Invertibility Conditions in Coq
Formal Verification of Bit-Vector Invertibility Conditions in Coq Open
We prove the correctness of invertibility conditions for the theory of fixed-width bit-vectors—used to solve quantified bit-vector formulas in the Satisfiability Modulo Theories (SMT) solver cvc5— in the Coq proof assistant. Previous work …
View article: Model for Wall Shear Stress from Obliquely Impinging Planar Underexpanded Jets
Model for Wall Shear Stress from Obliquely Impinging Planar Underexpanded Jets Open
Though inclined under-expanded planar jets are used in many practical applications, the wall stress resulting from their impingement has not been adequately characterized. Reduced-order models for wall shear as a function of jet parameters…
View article: Flexible Proof Production in an Industrial-Strength SMT Solver
Flexible Proof Production in an Industrial-Strength SMT Solver Open
Proof production for SMT solvers is paramount to ensure their correctness independently from implementations, which are often prohibitively difficult to verify. Historically, however, SMT proof production has struggled with performance and…
View article: Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)
Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract) Open
This work is a part of an ongoing effort to prove the correctness of\ninvertibility conditions for the theory of fixed-width bit-vectors, which are\nused to solve quantified bit-vector formulas in the Satisfiability Modulo\nTheories (SMT) …
View article: Generalizing the Kelly strategy
Generalizing the Kelly strategy Open
Prompted by a recent experiment by Victor Haghani and Richard Dewey, this note generalises the Kelly strategy (optimal for simple investment games with log utility) to a large class of practical utility functions and including the effect o…