Search for dissertations about: "counter automaton"

Found 3 swedish dissertations containing the words counter automaton.

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

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

   Abstract : 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. READ MORE

4. 2. Infinite Structures in Timed Systems

   Author : Pavel Krcal; Wang Yi; Joel Ouaknine; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Theoretical computer science; Teoretisk datalogi; Datalogi; Computing Science;

   Abstract : Real time systems distinguish themselves by explicitly stating timing constraints in the system specification. This requires specific methods and tools in system design to ensure such constraints. We focus on one of the methods applied in the validation phase, namely formal verification. READ MORE

5. 3. On Solving String Constraints

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

   Abstract : 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. READ MORE