Parse Condition: Symbolic Encoding of LL(1) Parsing

Singal, Dhruv; Agarwal, Palak; Jhunjhunwala, Saket; Roy, Subhajit

doi:10.29007/2ndp

Cited by 6 publications

(3 citation statements)

References 27 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

“…al. [24] developed a tool CYCLOPS to address parse conditions related to LL (1) grammar as it is still an intensive work, they mentioned. Their tool CYCLOPS is a combination of two utilities syntax error handling and parser synthesis.…”

Section: Literature Reviewmentioning

confidence: 99%

LL (1) Parser versus GNF inducted LL (1) Parser on Arithmetic Expressions Grammar: A Comparative Study

Ali

Naveed

Naseem

et al. 2020

QUESTRJ

View full text Add to dashboard Cite

The prime objective of the proposed study is to determine the induction of Greibach Normal Form (GNF) in Arithmetic Expression Grammars to improve the processing speed of conventional LL(1) parser. Conventional arithmetic expression grammar and its equivalent LL(1) is used in the study which is converted. A transformation method is defined which converts the selected grammar into a Greibach normal form that is further converted into a GNF based parser through a method proposed in the study. These two parsers are analyzed by considering 399 cases of arithmetic expressions. During statistical analysis, the results are initially examined with the Kolmogorov-Smirnov and Shapiro-Wilk test. The statistical significance of the proposed method is evaluated with the Mann-Whitney U test. The study described that GNF based LL(1) parser for arithmetic take fewer steps than conventional LL(1) grammar. The ranks and asymptotic significance depict that the GNF based LL(1) method is significant than the conventional LL(1) approach. The study adds to the knowledge of parsers itself, parser expression grammars (PEG’s), LL(1) grammars, Greibach Normal Form (GNF) induced grammar structure, and the induction of Arithmetic PEG’s LL(1) to GNF based grammar.

show abstract

Parse Condition: Symbolic Encoding of LL(1) Parsing

Cited by 6 publications

References 27 publications

HOLL: Program Synthesis for Higher OrderLogic Locking

HOLL: Program Synthesis for Higher OrderLogic Locking

HOLL: Program Synthesis for Higher Order Logic Locking

LL (1) Parser versus GNF inducted LL (1) Parser on Arithmetic Expressions Grammar: A Comparative Study

Contact Info

Product

Resources

About