Patents
Literature
2 results about "Context-free grammar" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
In formal language theory, a context-free grammar (CFG) is a certain type of formal grammar: a set of production rules that describe all possible strings in a given formal language. Production rules are simple replacements. For example, the rule A → α replaces A with α. There can be multiple replacement rules for any given value. For example, A → α A → β means that A can be replaced with either α or β.
A method for optimizing instruction scheduling of a just-in-time compiler, a storage medium and an apparatus
The application discloses a kind of based on the instruction scheduling optimization method of Bisheng compiler of Peng platform, storage medium, equipment and computer program product, comprising: obtaining the source program to be scheduled by Bisheng compiler on Peng platform, whether source program is legal using context-independent grammar judgment;The power consumption required for scheduling illegal source program is calculated and sorted, and the sub-functions in the illegal source program are rearranged by dependency graph construction algorithm in turn to the illegal source program sorted from small to large;Illegal source program in sub-function is modified by log analysis method in turn to the illegal source program sorted from large to small;Illegal source program is handled using the above two methods from two ends to middle, and then whether the source program is legal after processing is judged;If still illegal, exchange two kinds of methods to handle illegal source program, judge whether the source program is legal again, if legal, carry out instruction scheduling by Bisheng compiler;Otherwise, mark the illegal source program, and alarm.
Owner:CHINA TELECOM DIGITAL INTELLIGENCE TECH CO LTD
A method for synthesizing and guiding SMT solver fuzz testing based on large language model generator
This invention discloses a fuzzy testing method for Satisfiability Modulo Theories (SMT) solvers based on large language model generator synthesis and skeleton guidance, belonging to the field of software testing technology. The method includes: extracting context-free grammars from documents using a large language model and synthesizing corresponding Boolean term generators; generating a small number of samples and parsing them using SMT solvers, collecting error information and feeding it back to the large language model for iterative self-correction until the generator outputs valid terms; randomly removing sub-formulas from seed formulas to extract the structural skeleton; calling the generator to generate new Boolean terms and filling them into the structural skeleton to synthesize new test formulas; inputting the test formulas into multiple SMT solvers for differential testing to detect solver defects. This invention requires only a one-time model interaction, significantly reducing runtime overhead while ensuring the grammatical validity of the test formulas, and can efficiently trigger deep defects in the SMT solvers.
Owner:NANJING UNIV