Sökning: "context-free grammar constraint"

Hittade 2 avhandlingar innehållade orden context-free grammar constraint.

1. 1. Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search

   Författare :Jun He; Pierre Flener; Justin Pearson; Yves Deville; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; regular constraint; automaton constraint; context-free grammar constraint; solution neighbourhood; counter automaton; Datavetenskap; Computer Science;

   Sammanfattning : This thesis focuses on constraints for membership in formal languages under both the systematic search and stochastic local search approaches to constraint programming (CP). Such constraints are very useful in CP for the following three reasons: They provide a powerful tool for user-level extensibility of CP languages. LÄS MER

3. 2. On Solving String Constraints

   Författare :Phi Diep Bui; Mohamed Faouzi Atig; Parosh Abdulla; Matthew Hague; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; String constraint solving; SMT; Verification;

   Sammanfattning : Software systems are deeply involved in diverse human activities as everyone uses a variety of software systems on a daily basis. It is essential to guarantee that software systems all work correctly. Two popular methods for finding failures of software systems are testing and model checking. LÄS MER