Program Synthesis as Dependency Quantified Formula Modulo Theory

Golia, Priyanka; Roy, Subhajit; Meel, Kuldeep S.

doi:10.24963/ijcai.2021/261

Cited by 7 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Program Synthesis. Program synthesis has been successful in many domains: synthesis of heap manipulations [40,21,59], bit-manipulating programs [28], bug synthesis [42], parser synthesis [31,48], regression-free repairs [7,6], synchronization in concurrent programs [58], boolean functions [23,25,24] and even differentially private mechanisms [39]. There has also been an interest in using program synthesis in hardware designs [17].…”

Section: Related Workmentioning

confidence: 99%

HOLL: Program Synthesis for Higher OrderLogic Locking

Takhar¹,

Karri²,

Pilato³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

Logic locking "hides" the functionality of a digital circuit to protect it from counterfeiting, piracy, and malicious design modifications. The original design is transformed into a "locked" design such that the circuit reveals its correct functionality only when it is "unlocked" with a secret sequence of bits-the key bit-string. However, strong attacks, especially the SAT attack that uses a SAT solver to recover the key bitstring, have been profoundly effective at breaking the locked circuit and recovering the circuit functionality. We lift logic locking to Higher Order Logic Locking (HOLL) by hiding a higher-order relation, instead of a key of independent values, challenging the attacker to discover this key relation to recreate the circuit functionality. Our technique uses program synthesis to construct the locked design and synthesize a corresponding key relation. HOLL has low overhead and existing attacks for logic locking do not apply as the entity to be recovered is no more a value. To evaluate our proposal, we propose a new attack (SynthAttack ) that uses an inductive synthesis algorithm guided by an operational circuit as an input-output oracle to recover the hidden functionality. SynthAttack is inspired by the SAT attack, and similar to the SAT attack, it is verifiably correct, i.e., if the correct functionality is revealed, a verification check guarantees the same. Our empirical analysis shows that SynthAttack can break HOLL for small circuits and small key relations, but it is ineffective for real-life designs.

show abstract

Section: Related Workmentioning

confidence: 99%

HOLL: Program Synthesis for Higher OrderLogic Locking

Takhar¹,

Karri²,

Pilato³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…bug synthesis [40], parser synthesis [30,46], regression-free repairs [6,5], synchronization in concurrent programs [56], boolean functions [22,24,23] and even differentially private mechanisms [38]. There has also been an interest in using program synthesis in hardware designs [16].…”

Section: Related Workmentioning

confidence: 99%

HOLL: Program Synthesis for Higher Order Logic Locking

Takhar

Karri

Pilato

et al. 2022

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Logic locking “hides” the functionality of a digital circuit to protect it from counterfeiting, piracy, and malicious design modifications. The original design is transformed into a “locked” design such that the circuit reveals its correct functionality only when it is “unlocked” with a secret sequence of bits—the key bit-string. However, strong attacks, especially the SAT attack that uses a SAT solver to recover the key bit-string, have been profoundly effective at breaking the locked circuit and recovering the circuit functionality.We lift logic locking to Higher Order Logic Locking (HOLL) by hiding a higher-order relation, instead of a key of independent values, challenging the attacker to discover this key relation to recreate the circuit functionality. Our technique uses program synthesis to construct the locked design and synthesize a corresponding key relation. HOLL has low overhead and existing attacks for logic locking do not apply as the entity to be recovered is no more a value. To evaluate our proposal, we propose a new attack (SynthAttack) that uses an inductive synthesis algorithm guided by an operational circuit as an input-output oracle to recover the hidden functionality. SynthAttack is inspired by the SAT attack, and similar to the SAT attack, it is verifiably correct, i.e., if the correct functionality is revealed, a verification check guarantees the same. Our empirical analysis shows that SynthAttack can break HOLL for small circuits and small key relations, but it is ineffective for real-life designs.

show abstract

“…Other approaches include reducing program synthesis to the problem finding a witness of a dependency quantified formula modulo theory [32].…”

Section: Introductionmentioning

confidence: 99%

Automated Synthesis of Decision Lists for Polynomial Specifications over Integers

Akshay,

Chakraborty,

Kafshdar Goharshady

et al.

EPiC Series in Computing

View full text Add to dashboard Cite

In this work, we consider two sets I and O of bounded integer variables, modeling the inputs and outputs of a program. Given a specification Post, which is a Boolean combination of linear or polynomial inequalities with real coefficients over I ∪ O, our goal is to synthesize the weakest possible pre-condition Pre and a program P satisfying the Hoare triple {Pre}P{Post}. We provide a novel, practical, sound and complete algorithm, inspired by Farkas’ Lemma and Handelman’s Theorem, that synthesizes both the program P and the pre-condition Pre over a bounded integral region. Our approach is exact and guaranteed to find the weakest pre-condition. Moreover, it always synthesizes both P and Pre as linear decision lists. Thus, our output consists of simple programs and pre- conditions that facilitate further static analysis. We also provide experimental results over benchmarks showcasing the real-world applicability of our approach and considerable performance gains over the state-of-the-art.1

show abstract

Program Synthesis as Dependency Quantified Formula Modulo Theory

Cited by 7 publications

References 9 publications

HOLL: Program Synthesis for Higher OrderLogic Locking

HOLL: Program Synthesis for Higher OrderLogic Locking

HOLL: Program Synthesis for Higher Order Logic Locking

Automated Synthesis of Decision Lists for Polynomial Specifications over Integers

Contact Info

Product

Resources

About