You searched for subject:( en PROGRAM SYNTHESIS).
Showing records 1 – 30 of
77091 total matches.
◁ [1] [2] [3] [4] [5] … [2570] ▶
University of Oxford
1.
Polgreen, Elizabeth.
Synthesis without syntactic templates.
Degree: PhD, 2020, University of Oxford
URL: http://ora.ox.ac.uk/objects/uuid:3cd96a82-4a62-4a7f-a68e-5b37f7396b0e 
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.800167
► Program synthesis is the mechanised construction of software. One of the main difficulties is the efficient exploration of the very large solution space, and tools…
(more)
▼ Program synthesis is the mechanised construction of software. One of the main difficulties is the efficient exploration of the very large solution space, and tools often require a user-provided syntactic restriction of the search space. Writing such templates is often challenging, particularly since any constants required in the solution must be given in the template. In this dissertation we explore the research hypothesis that synthesis of programs without provision of such syntactic templates is computationally feasible using methods based on CounterExample Guided Inductive Synthesis (CEGIS). The key contribution of this dissertation is a new approach to program synthesis that combines the strengths of a counterexample-guided inductive synthesizer with those of a theory solver, exploring the solution space more efficiently without relying on user guidance. We call this approach CEGIS(T ), where T is a first-order theory. Notably, since the publication of CEGIS(T ), a variant of the algorithm has been implemented inside leading synthesis solver CVC4. CEGIS(T) is as complete (or incomplete) as CEGIS, and it does not affect worst-case run-time complexity considerations. In combination with the development of CEGIS(T ), we introduced several algorith- mic improvements that enhance both the performance of CEGIS(T ) and the baseline CEGIS algorithm. The first of these improvements is a significant change to the way we encode the synthesis problem for the SAT-based synthesis component of CEGIS in order to produce smaller formulae that can be more efficiently solved by SAT and SMT solvers. The second of these improvements is the use of incremental satisfiability solving in the synthesis component of CEGIS. Incremental satisfiability solving allows the SAT solver to re-use clauses learnt in previous CEGIS iterations, thus reducing the time per synthesis iteration. We evaluate our contributions on a set of benchmarks taken from the Syntax Guided Synthesis Competition, and note that CEGIS(T ) is able to solve benchmarks which elude a standard implementation of CEGIS, specifically benchmarks that contain non-trivial constants. We find that the novel proposed encoding provides a substantial speed-up on all the benchmarks that require synthesising a program of length greater than one instruction. The use of incremental first-order solving in CEGIS decreases the solving time in some cases but not all, and we hypothesise that these are the benchmarks on which SAT-solver pre-processing is less important.
Subjects/Keywords: Program Synthesis
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Polgreen, E. (2020). Synthesis without syntactic templates. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:3cd96a82-4a62-4a7f-a68e-5b37f7396b0e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.800167
Chicago Manual of Style (16th Edition):
Polgreen, Elizabeth. “Synthesis without syntactic templates.” 2020. Doctoral Dissertation, University of Oxford. Accessed March 01, 2021.
http://ora.ox.ac.uk/objects/uuid:3cd96a82-4a62-4a7f-a68e-5b37f7396b0e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.800167.
MLA Handbook (7th Edition):
Polgreen, Elizabeth. “Synthesis without syntactic templates.” 2020. Web. 01 Mar 2021.
Vancouver:
Polgreen E. Synthesis without syntactic templates. [Internet] [Doctoral dissertation]. University of Oxford; 2020. [cited 2021 Mar 01].
Available from: http://ora.ox.ac.uk/objects/uuid:3cd96a82-4a62-4a7f-a68e-5b37f7396b0e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.800167.
Council of Science Editors:
Polgreen E. Synthesis without syntactic templates. [Doctoral Dissertation]. University of Oxford; 2020. Available from: http://ora.ox.ac.uk/objects/uuid:3cd96a82-4a62-4a7f-a68e-5b37f7396b0e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.800167
Princeton University
2.
Miltner, Anders.
Synthesizing Lenses
.
Degree: PhD, 2020, Princeton University
URL: http://arks.princeton.edu/ark:/88435/dsp013j333531v
► Lenses are bidirectional functions that satisfy a set of "round-tripping laws." Lenses arise in a number of domains, and can implement serializer/deserializer pairs, parser/pretty printer…
(more)
▼ Lenses are bidirectional functions that satisfy a set of "round-tripping laws." Lenses arise in a number of domains, and can implement serializer/deserializer pairs, parser/pretty printer pairs, and incremental data structure transformers.
Domain-specific languages like Boomerang, Augeas, GRoundTram, BiFluX, BiYacc, Brul, BiGUL, and HOBiT allow programmers to write both transformations with a single
program, and guarantee the transformations satisfy the round-tripping laws. However, writing in domain-specific lens languages can be hard, requiring the user to reason about fiddly details of the transformations, often within the context of a complex type system.
In this work we introduce Optician, which provides an alternative method of developing lenses –
synthesis. We develop a
synthesis engine for Boomerang, a lens language for string transformations. Pairs of regular expressions serve as types for Boomerang lenses, which transform strings between the languages of those regular expressions. Instead of manually writing Boomerang lenses, programmers merely need to provide the type of the desired lens and a set of input/output examples describing the lens's behavior. Optician will then synthesize a lens between the provided types that exhibits the demonstrated behavior. We demonstrate how to synthesize three classes of lenses: bijective lenses, quotient lenses, and symmetric lenses. Bijective lenses encode bijections, quotient lenses encode bijections modulo an equivalence relation, and symmetric lenses encode bidirectional transformations that may discard information when going from one format to another.
We define a synthesizer that involves two cooperating procedures. One procedure proposes a candidate space of lenses, the second procedure searches through that space.
To synthesize quotient lenses, regular expressions are augmented with equivalence information, and the synthesizer generates lenses that translate between the representative elements of the equivalence classes. To synthesize symmetric lenses, regular expressions are augmented with probability distributions, and the
synthesis algorithm aims to avoid information loss.
We evaluate Optician from a variety of benchmarks taken from the lens and
synthesis literature, and find that we are able to synthesize all the lenses in our benchmark suite. We have integrated Optician into the Boomerang codebase, enabling users to either synthesize their lenses or write them by hand.
Advisors/Committee Members: Walker, David (advisor).
Subjects/Keywords: Bidirectional Programming;
Program Synthesis
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Miltner, A. (2020). Synthesizing Lenses
. (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp013j333531v
Chicago Manual of Style (16th Edition):
Miltner, Anders. “Synthesizing Lenses
.” 2020. Doctoral Dissertation, Princeton University. Accessed March 01, 2021.
http://arks.princeton.edu/ark:/88435/dsp013j333531v.
MLA Handbook (7th Edition):
Miltner, Anders. “Synthesizing Lenses
.” 2020. Web. 01 Mar 2021.
Vancouver:
Miltner A. Synthesizing Lenses
. [Internet] [Doctoral dissertation]. Princeton University; 2020. [cited 2021 Mar 01].
Available from: http://arks.princeton.edu/ark:/88435/dsp013j333531v.
Council of Science Editors:
Miltner A. Synthesizing Lenses
. [Doctoral Dissertation]. Princeton University; 2020. Available from: http://arks.princeton.edu/ark:/88435/dsp013j333531v
Georgia Tech
3.
Vijayakumar, Ashwin Kalyan.
Improved search techniques for structured prediction.
Degree: PhD, Interactive Computing, 2020, Georgia Tech
URL: http://hdl.handle.net/1853/63701
► Many useful AI tasks like machine translation, captioning or program syn- thesis to name a few can be abstracted as structured prediction problems. For these…
(more)
▼ Many useful AI tasks like machine translation, captioning or
program syn- thesis to name a few can be abstracted as structured prediction problems. For these problems, the search space is well-defined but extremely large — all English language sentences for captioning or translation and similarly, all programs that can be generated from a context-free grammar in the case of
program syn- thesis. Therefore, inferring the correct output (a sentence or a
program) given the input (an image or user-defined specifications) is an intractable search problem. To overcome this, heuristics — hand designed or learnt from data — are often employed. In my work, I propose modified search procedures to output multiple diverse sequences and then, for the task of outputting programs, I propose a novel search procedure that accelerates existing techniques via heuristics learnt from deep networks. Going further, I propose to study the role of memory and search i.e. process each new query with the memory of previous queries — specifically in the context of solving mathematical problems.In the context of sequence prediction tasks like image captioning or translation, I introduce Diverse Beam Search (DBS), an approximate inference technique to decode multiple relevant and diverse outputs. With the objective of producing multiple sentences that are different from each other, DBS modifies the commonly used Beam Search procedure by greedily imposing diversity constraints. In follow-up work, we directly formulate the task of modeling a set of sequences and propose a trainable search procedure dubbed diff-BS. While both algorithms are task-agnostic, image-captioning is used as the test-bed to demonstrate their effectiveness. In the context of
program-
synthesis, I propose Neural Guided Deductive Search (NGDS), that accelerates deductive search via learnt heuristics. We find that our approach results in a significant speedup without compromising on the quality of the solutions found. Further, I will discuss the application of this technique in the context of programming by examples and
synthesis of hard problems for a given solver. Finally, I study the interplay between memory and search, specifically in the context of mathematical problem solving. Analogical reasoning is a strategy commonly adopted by humans while solving problems i.e. new and unseen problems are solved by drawing parallels to previously seen problems. Inspired by such an approach, I propose to learn suitable representations for “problems” that al- lows the reuse of solutions from previously seen problems as a building block to construct the solution for the problem at hand.
Advisors/Committee Members: Batra, Dhruv (advisor), Parikh, Devi (committee member), Boots, Byron (committee member), Jain, Prateek (committee member), Polozov, Oleksandr (committee member), Rajpurohit, Tanmay (committee member).
Subjects/Keywords: Sequence decoding; Program synthesis
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Vijayakumar, A. K. (2020). Improved search techniques for structured prediction. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/63701
Chicago Manual of Style (16th Edition):
Vijayakumar, Ashwin Kalyan. “Improved search techniques for structured prediction.” 2020. Doctoral Dissertation, Georgia Tech. Accessed March 01, 2021.
http://hdl.handle.net/1853/63701.
MLA Handbook (7th Edition):
Vijayakumar, Ashwin Kalyan. “Improved search techniques for structured prediction.” 2020. Web. 01 Mar 2021.
Vancouver:
Vijayakumar AK. Improved search techniques for structured prediction. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/1853/63701.
Council of Science Editors:
Vijayakumar AK. Improved search techniques for structured prediction. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/63701
4.
Wang, Xinyu.
An efficient programming-by-example framework.
Degree: PhD, Computer Science, 2019, University of Texas – Austin
URL: http://dx.doi.org/10.26153/tsw/5854
► Due to the ubiquity of computing, programming has started to become an essential skill for an increasing number of people, including data scientists, financial analysts,…
(more)
▼ Due to the ubiquity of computing, programming has started to become an essential skill for an increasing number of people, including data scientists, financial analysts, and spreadsheet users. While it is well known that building any complex and reliable software is difficult, writing even simple scripts is challenging for novices with no formal programming background. Therefore, there is an increasing need for technology that can provide basic programming support to non-expert computer end-users.
Program synthesis, as a technique for generating programs from high-level specifications such as input-output examples, has been used to automate many real-world programming tasks in a number of application domains such as spreadsheet programming and data science. However, developing specialized synthesizers for these application domains is notoriously hard.
This dissertation aims to make the development of
program synthesizers easier so that we can expand the applicability of
program synthesis to more application domains. In particular, this dissertation describes a programming-by-example framework that is both generic and efficient. This framework can be applied broadly to automating tasks across different application domains. It is also efficient and achieves orders of magnitude improvement in terms of the
synthesis speed compared to existing state-of-the-art techniques.
Advisors/Committee Members: Dillig, Isil (advisor), Durrett, Gregory (committee member), Pingali, Keshav (committee member), Jhala, Ranjit (committee member), Naik, Mayur (committee member).
Subjects/Keywords: Programming languages; Program synthesis
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wang, X. (2019). An efficient programming-by-example framework. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/5854
Chicago Manual of Style (16th Edition):
Wang, Xinyu. “An efficient programming-by-example framework.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed March 01, 2021.
http://dx.doi.org/10.26153/tsw/5854.
MLA Handbook (7th Edition):
Wang, Xinyu. “An efficient programming-by-example framework.” 2019. Web. 01 Mar 2021.
Vancouver:
Wang X. An efficient programming-by-example framework. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Mar 01].
Available from: http://dx.doi.org/10.26153/tsw/5854.
Council of Science Editors:
Wang X. An efficient programming-by-example framework. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/5854
University of Texas – Austin
5.
Feng, Yu, Ph. D.
Program synthesis using statistical models and logical reasoning.
Degree: PhD, Computer Science, 2018, University of Texas – Austin
URL: http://hdl.handle.net/2152/68452
► Complex APIs in new frameworks (Spark, R, TensorFlow, etc) have imposed steep learning curves on everyone, especially for people with limited programming backgrounds. For instance,…
(more)
▼ Complex APIs in new frameworks (Spark, R, TensorFlow, etc) have imposed steep learning curves on everyone, especially for people with limited programming backgrounds. For instance, due to the messy nature of data in different application domains, data scientists spend close to 80% of their time in data wrangling tasks, which are considered to be the "janitor work" of data science. Similarly, software engineers spend hours or even days learning how to use APIs through official documentation or examples from online forums.
Program synthesis has the potential to automate complex tasks that involve API usage by providing powerful search algorithms to look for executable programs that satisfy a given specification (input-output examples, partial programs, formal specs, etc). However, the biggest barrier to a practical synthesizer is the size of search space, which increases strikingly fast with the complexity of the programs and the size of the targeted APIs. To address the above issue, this dissertation focuses on developing algorithms that push the frontiers of
program synthesis. First, we propose a type-directed graph reachability algorithm in SyPet, a synthesizer for assembling programs from complex APIs. Second, we show how to combine enumerative search with lightweight constraint-based deduction in Morpheus, a synthesizer for automating real-world data wrangling tasks from input-output examples. Finally, we generalize the previous approaches to develop a novel conflict-driven
synthesis algorithm that can learn from past mistakes.
Advisors/Committee Members: Dillig, Isil (advisor), Mooney, Raymond (committee member), Kr ahenb uhl, Philipp (committee member), Aiken, Alex (committee member).
Subjects/Keywords: Program synthesis; Logical reasoning
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Feng, Yu, P. D. (2018). Program synthesis using statistical models and logical reasoning. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/68452
Chicago Manual of Style (16th Edition):
Feng, Yu, Ph D. “Program synthesis using statistical models and logical reasoning.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed March 01, 2021.
http://hdl.handle.net/2152/68452.
MLA Handbook (7th Edition):
Feng, Yu, Ph D. “Program synthesis using statistical models and logical reasoning.” 2018. Web. 01 Mar 2021.
Vancouver:
Feng, Yu PD. Program synthesis using statistical models and logical reasoning. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/2152/68452.
Council of Science Editors:
Feng, Yu PD. Program synthesis using statistical models and logical reasoning. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/68452
University of Minnesota
6.
Sharma, Vaibhav.
Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution.
Degree: PhD, Computer Science, 2020, University of Minnesota
URL: http://hdl.handle.net/11299/213126
► Independently developed codebases typically contain many segments of code that perform the same or closely related operations (semantic clones). Finding functionally equivalent segments enables applications…
(more)
▼ Independently developed codebases typically contain many segments of code that perform the same or closely related operations (semantic clones). Finding functionally equivalent segments enables applications like replacing a segment by a more efficient or more secure alternative. Such related segments often have different interfaces, so some glue code (an adapter) is needed to replace one with the other. We present an algorithm that searches for replaceable code segments by attempting to synthesize an adapter between them from some finite family of adapters; it terminates if it finds no possible adapter. The use of symbolic execution during adapter search implicitly relies on being able to summarize the entire adapter into a single formula. Merging related execution paths is a powerful technique for reducing path explosion in symbolic execution. One approach, introduced and dubbed “veritesting” by Avgerinos et al., works by statically translating a bounded control flow region into a single formula. Java’s typed memory structure is very different from a binary, but we present an extension of previous path-merging approaches for symbolic execution of Java. Bugs in commercial software and third-party components are an undesirable and expensive phenomenon. Such software is usually released to users only in binary form. The lack of source code renders users of such software dependent on their software vendors for repairs of bugs. Such dependence is even more harmful if the bugs introduce new vulnerabilities in the software. Being able to automatically repair security bugs breaks this dependence and increases software robustness. In the third part of this dissertation, we present an automated program repair approach for binary code.
Subjects/Keywords: adapter synthesis; binary analysis; cegis; program repair; program synthesis; symbolic execution
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sharma, V. (2020). Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/213126
Chicago Manual of Style (16th Edition):
Sharma, Vaibhav. “Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution.” 2020. Doctoral Dissertation, University of Minnesota. Accessed March 01, 2021.
http://hdl.handle.net/11299/213126.
MLA Handbook (7th Edition):
Sharma, Vaibhav. “Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution.” 2020. Web. 01 Mar 2021.
Vancouver:
Sharma V. Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution. [Internet] [Doctoral dissertation]. University of Minnesota; 2020. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/11299/213126.
Council of Science Editors:
Sharma V. Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution. [Doctoral Dissertation]. University of Minnesota; 2020. Available from: http://hdl.handle.net/11299/213126
Pontifical Catholic University of Rio de Janeiro
7.
GEIZA MARIA HAMAZAKI DA SILVA.
[en] EXTRACTION OF COMPUTATIONAL CONTENTS FROM INTUITIONIST
PROOFS.
Degree: 2004, Pontifical Catholic University of Rio de Janeiro
URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5443
► [pt] Garantir que programas são implementados de forma a cumprir uma especificação é uma questão fundamental em computação, por isso, têm sido propostos vários métodos…
(more)
▼ [pt] Garantir que programas são implementados de forma
a cumprir uma especificação é uma questão fundamental em
computação, por isso, têm sido propostos vários métodos que almejam
provar a correção dos programas. Este trabalho apresenta um método,
baseado no isomorfismo de Curry-Howard, que extrai conteúdos
computacionais de provas intuicionistas, conhecido como síntese
construtiva ou proofs-as-programs. É proposto um processo de
síntese construtiva de programas, onde a extração do conteúdo
computacional gera um programa em linguagem imperativa a partir de
uma prova em lógica intuicionista poli-sortida, cujos axiomas
definem os tipos abstratos de dados, sendo utilizado como sistema
dedutivo a Dedução Natural. Também é apresentada uma prova de
correção, bem como uma prova de completude do método atráves do uso
de um sistema com regra ômega (computacional) para a aritmética de
Heyting, concluindo com uma demonstração da relação entre o uso da
indução finita no lugar da regra ômega computacional no processo de
síntese.
[en] One of the main problems in computer science is
to assure that programs are implemented in such a way that they
satisfy a given specification. There are many studies about methods
to prove correctness of programs. This work presents a method,
belonging to the constructive synthesis or proofs-as-programs
paradigm, that comes from the Curry- Howard isomorphism and
extracts the computational contents of intuitionist proofs. The
synthesis process proposed produces a program in an imperative
language from a proof in many-sorted intuitionist logic, where the
axioms define the abstract data types using Natural Deduction as
deductive system. It is proved the correctness, as well as the
completeness of the method regarding the Heyting arithmetic with
ômega-rule(in its computational version). A discussion about the
use of the finitary induction instead of computational ômega-rule
concludes the work.
Advisors/Committee Members: EDWARD HERMANN HAEUSLER.
Subjects/Keywords: [pt] SINTESE DE PROGRAMAS; [en] PROGRAM SYNTHESIS; [pt] LOGICA INTUICIONISTA; [en] INTUITIONISTIC LOGIC; [pt] DEDUCAO NATURAL; [en] NATURAL DEDUCTION
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
SILVA, G. M. H. D. (2004). [en] EXTRACTION OF COMPUTATIONAL CONTENTS FROM INTUITIONIST
PROOFS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5443
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
SILVA, GEIZA MARIA HAMAZAKI DA. “[en] EXTRACTION OF COMPUTATIONAL CONTENTS FROM INTUITIONIST
PROOFS.” 2004. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed March 01, 2021.
http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5443.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
SILVA, GEIZA MARIA HAMAZAKI DA. “[en] EXTRACTION OF COMPUTATIONAL CONTENTS FROM INTUITIONIST
PROOFS.” 2004. Web. 01 Mar 2021.
Vancouver:
SILVA GMHD. [en] EXTRACTION OF COMPUTATIONAL CONTENTS FROM INTUITIONIST
PROOFS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2004. [cited 2021 Mar 01].
Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5443.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
SILVA GMHD. [en] EXTRACTION OF COMPUTATIONAL CONTENTS FROM INTUITIONIST
PROOFS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2004. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5443
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
8.
Illivi, Frederic.
Genèse et mise en œuvre du plan « sport, santé, bien-être » : acteurs, savoirs, territoires et instruments, une sociologie de l’état en recomposition : le cas de la région Nouvelle-Aquitaine : Genesis and implementation of the Plan "sport, health, well-being" : actors, knowledge, territories and instruments, a sociology of the state in recomposition : the case of the new-Aquitaine region.
Degree: Docteur es, Sciences et techniques des activités physiques et sportives, 2018, Bordeaux
URL: http://www.theses.fr/2018BORD0145
► Les Agences Régionales de Santé (ARS) et les Directions Régionales de la Jeunesse, des Sports et de la Cohésion Sociale (DRJSCS) sont invitées, par leur…
(more)
▼ Les Agences Régionales de Santé (ARS) et les Directions Régionales de la Jeunesse, des Sports et de la Cohésion Sociale (DRJSCS) sont invitées, par leur ministère de tutelle, à mettre en œuvre le plan « Sport, Santé, Bien-Etre » dont les finalités ont été arrêtées par l’État central. Consacrant la reconnaissance de l’activité physique en tant que déterminant de santé permise par l’accumulation des savoirs, son institutionnalisation fait également suite à la mobilisation de nombreux entrepreneurs de cause. L’analyse des conditions de sa territorialisation en région Nouvelle-Aquitaine à partir d’une perspective d’instrumentation de l’action publique, donne à voir des effets de ce plan en bien des points ambivalents. Le recours à des opérateurs publics et privés, leur mise en concurrence pilotée à distance par des instruments de type incitatif, la séparation entre commanditaire et prestataire, figurent au titre des processus ayant conduit à la mise en place d’un quasi-marché du « sport santé » dans cette région. Les formes de division du travail observées rendent compte d’un glissement tangible qui semble progressivement cantonner les associations des secteurs sanitaire et sportif au rang d’opérateurs fonctionnels. Elles accélèrent également les mécanismes de diversification de l’offre sportive associative au sein d’un champ longtemps réfractaire à ce type d’évolution. L’ensemble de ces dynamiques permet, plus généralement, de participer aux débats analytiques sur la recomposition des relations entre l’État et les territoires.
The regional Health Agencies (ARS) and the regional Directorates for Youth, Sports and social cohesion (DRJSCS) are invited by their Ministry of Guardianship to implement the plan "Sport, health and well-being", the objectives of which have been adopted by The central state. With the recognition of physical activity as a determinant of health enabled by the accumulation of knowledge, its institutionalization also follows the mobilization of many cause entrepreneurs. The analysis of the conditions of its territorialisation in the new-Aquitaine region from a perspective of instrumentation of public action, gives to see the effects of this plan in many ambivalent points. The use of public and private operators, their remotely-controlled competition by incentive-type instruments, the separation between sponsor and provider, are included in the processes leading to the establishment of a quasi-market of the " Health sport in this region. The forms of Labour Division observed reflect a tangible shift that appears to be gradually confining the health and sports associations to the rank of functional operators. They also accelerate the mechanisms of diversifying the associative sports supply within a field long refractory to this type of evolution. All these dynamics allow, more generally, to participate in the analytical debates on the recomposition of relations between the State and the territories.
Advisors/Committee Members: Honta, Marina (thesis director).
Subjects/Keywords: Programme de santé publique; Activités physiques; Savoirs; Territorialisation; Instrumentation; Mise en oeuvre; Public Health Program; Physical activities; Knowledge; Territorialization; Instrumentation; Implementation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Illivi, F. (2018). Genèse et mise en œuvre du plan « sport, santé, bien-être » : acteurs, savoirs, territoires et instruments, une sociologie de l’état en recomposition : le cas de la région Nouvelle-Aquitaine : Genesis and implementation of the Plan "sport, health, well-being" : actors, knowledge, territories and instruments, a sociology of the state in recomposition : the case of the new-Aquitaine region. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2018BORD0145
Chicago Manual of Style (16th Edition):
Illivi, Frederic. “Genèse et mise en œuvre du plan « sport, santé, bien-être » : acteurs, savoirs, territoires et instruments, une sociologie de l’état en recomposition : le cas de la région Nouvelle-Aquitaine : Genesis and implementation of the Plan "sport, health, well-being" : actors, knowledge, territories and instruments, a sociology of the state in recomposition : the case of the new-Aquitaine region.” 2018. Doctoral Dissertation, Bordeaux. Accessed March 01, 2021.
http://www.theses.fr/2018BORD0145.
MLA Handbook (7th Edition):
Illivi, Frederic. “Genèse et mise en œuvre du plan « sport, santé, bien-être » : acteurs, savoirs, territoires et instruments, une sociologie de l’état en recomposition : le cas de la région Nouvelle-Aquitaine : Genesis and implementation of the Plan "sport, health, well-being" : actors, knowledge, territories and instruments, a sociology of the state in recomposition : the case of the new-Aquitaine region.” 2018. Web. 01 Mar 2021.
Vancouver:
Illivi F. Genèse et mise en œuvre du plan « sport, santé, bien-être » : acteurs, savoirs, territoires et instruments, une sociologie de l’état en recomposition : le cas de la région Nouvelle-Aquitaine : Genesis and implementation of the Plan "sport, health, well-being" : actors, knowledge, territories and instruments, a sociology of the state in recomposition : the case of the new-Aquitaine region. [Internet] [Doctoral dissertation]. Bordeaux; 2018. [cited 2021 Mar 01].
Available from: http://www.theses.fr/2018BORD0145.
Council of Science Editors:
Illivi F. Genèse et mise en œuvre du plan « sport, santé, bien-être » : acteurs, savoirs, territoires et instruments, une sociologie de l’état en recomposition : le cas de la région Nouvelle-Aquitaine : Genesis and implementation of the Plan "sport, health, well-being" : actors, knowledge, territories and instruments, a sociology of the state in recomposition : the case of the new-Aquitaine region. [Doctoral Dissertation]. Bordeaux; 2018. Available from: http://www.theses.fr/2018BORD0145
University of California – Berkeley
9.
Galenson, Joel David.
Dynamic and Interactive Synthesis of Code Snippets.
Degree: Computer Science, 2014, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/6js5v4bj
► Many code fragments are difficult to write. For example, using new and unfamiliar APIs can be a complex task with a steep learning curve. In…
(more)
▼ Many code fragments are difficult to write. For example, using new and unfamiliar APIs can be a complex task with a steep learning curve. In addition, implementing a complex data structure requires discovering and understanding all of the corner cases. And more and more end users with little to no formal training are trying to write code, whether they be scientists writing simulations or kids writing mobile apps. For all of these reasons and more, programming is a difficult task, which leads to bugs and delays in software.There are many tools that help programmers find code fragments involving complex APIs, but many are somewhat inexpressive and rely on static information. We present a new technique, which we call CodeHint, that generates and evaluates code at runtime and hence can synthesize real-world Java code that involves I/O, reflection, native calls, and other advanced language features. Our approach is dynamic (giving accurate results and allowing programmers to reason about concrete executions), easy-to-use (supporting a wide range of correctness specifications), and interactive (allowing users to refine the candidate code snippets). We evaluate CodeHint and show that its algorithms are efficient and that in two user studies it improves programmer productivity by more than a factor of two.As the second contribution, programmers and end users often find it easy to explain an algorithm on a whiteboard or with pictures in a textbook but struggle to write the code correctly. We propose a new methodology that allows users to program by demonstrating how an algorithm proceeds on concrete inputs. To reduce the burden of these demonstrations on the user, we have developed pruning algorithms to remove ambiguities in the demonstrations and control flow inference algorithms to infer missing conditionals in demonstrations. These two techniques take advantage of the knowledge encoded in the user's partial correctness condition. We show that this approach is effective in practice by analyzing its performance on several common algorithms.
Subjects/Keywords: Computer science; Programming languages; Program synthesis
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Galenson, J. D. (2014). Dynamic and Interactive Synthesis of Code Snippets. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/6js5v4bj
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Galenson, Joel David. “Dynamic and Interactive Synthesis of Code Snippets.” 2014. Thesis, University of California – Berkeley. Accessed March 01, 2021.
http://www.escholarship.org/uc/item/6js5v4bj.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Galenson, Joel David. “Dynamic and Interactive Synthesis of Code Snippets.” 2014. Web. 01 Mar 2021.
Vancouver:
Galenson JD. Dynamic and Interactive Synthesis of Code Snippets. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2021 Mar 01].
Available from: http://www.escholarship.org/uc/item/6js5v4bj.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Galenson JD. Dynamic and Interactive Synthesis of Code Snippets. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/6js5v4bj
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Penn State University
10.
Liu, Xiao.
Programming in Eliza.
Degree: 2019, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/28866
► According to the technical report by Microsoft 2012, there will be a shortage of graduates to fill available job positions in computer-related occupations till 2020.…
(more)
▼ According to the technical report by Microsoft 2012, there will be a shortage of graduates to fill available job positions in computer-related occupations till 2020. One of the possible reasons accounts for the shortage is the challenge of mastering the skill to code; the rigid and abstruse syntax of programming languages is the first barrier. Out of creating an easier environment to
program, this thesis proposes a system that allows users to
program in natural language, which enhances the coding experience for novices as well as experienced programmers.
Our prototype system, called PiE (Programming in Eliza), is based on Eliza, an early primitive AI prototype. The original Eliza was designed to be a psychotherapist. We make it a programming robot. Using a rule-based method, PiE interprets the natural commands into a universal intermediate language (PiE script) and programs in the target syntax will be synthesized according to the semantics we extract with the rules. To demonstrate the PiE system, we create PiE-LOGO, which synthesizes programs in the LOGO programming language that helps people to draw graphs. Our experimental results show that, on average, the success ratio is 88.4% for synthesizing LOGO programs from simple conversations with Eliza. PiE also enables end-users with no experience to
program in LOGO with a smoother learning curve. We also build it with a voice module, with which children can interact with PiE by voice before learning to type, and users can play with it on mobile devices more easily. We also provide an online adaptation with explanatory step-by-step tutorial through which feedbacks for further improvement are collected.
Advisors/Committee Members: Dinghao Wu, Thesis Advisor/Co-Advisor, Mary Beth Rosson, Thesis Advisor/Co-Advisor, John Yen, Thesis Advisor/Co-Advisor.
Subjects/Keywords: Program Synthesis; Natural Language; Eliza; LOGO
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Liu, X. (2019). Programming in Eliza. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/28866
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Liu, Xiao. “Programming in Eliza.” 2019. Thesis, Penn State University. Accessed March 01, 2021.
https://submit-etda.libraries.psu.edu/catalog/28866.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Liu, Xiao. “Programming in Eliza.” 2019. Web. 01 Mar 2021.
Vancouver:
Liu X. Programming in Eliza. [Internet] [Thesis]. Penn State University; 2019. [cited 2021 Mar 01].
Available from: https://submit-etda.libraries.psu.edu/catalog/28866.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Liu X. Programming in Eliza. [Thesis]. Penn State University; 2019. Available from: https://submit-etda.libraries.psu.edu/catalog/28866
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Rice University
11.
Lu, Yanxin.
Corpus-Driven Systems for Program Synthesis and Refactoring.
Degree: PhD, Engineering, 2019, Rice University
URL: http://hdl.handle.net/1911/105342
► Programming is a difficult task. Programmers need to deal with small details inside overly complex computer programs. Sometimes it is inevitable for programmers to make…
(more)
▼ Programming is a difficult task. Programmers need to deal with small details inside overly complex computer programs. Sometimes it is inevitable for programmers to make small mistakes. To deal with this problem, software engineering techniques and formal method based techniques have been proposed to help facilitate programming. These techniques include various software engineering methodologies, design patterns, sophisticated testing methods,
program repair algorithms, model checking algorithms, and
program synthesis methods.
In this thesis, we propose two additional corpus-driven systems for
program synthesis and refactoring. We first introduce
program splicing, a programming methodology that aims to automate the workflow of copying, pasting, and modifying code available online. Here, the programmer starts by writing a “draft” that mixes unfinished code, natural language comments, and correctness requirements. A
program synthesizer that interacts with a large, searchable database of
program snippets is used to automatically complete the draft into a
program that meets the requirements. Our evaluation uses the system in a suite of everyday programming tasks, and includes a comparison with a state-of-the-art competing approach as well as a user study. The results point to the broad scope and scalability of
program splicing and indicate that the approach can significantly boost programmer productivity. Next, we propose an algorithm that automates the process of API refactoring, where the goal is to rewrite an API call sequence into another sequence that only uses the API calls defined in the target library without modifying the functionality. We solve the problem of API refactoring by combining the techniques of API translation and API sequence
synthesis. We evaluated our algorithm on a diverse set of benchmark problems, and our algorithm can refactor API sequences with high accuracy. In addition, we conducted a user study which indicates that our algorithm can help human developers with API refactoring.
Advisors/Committee Members: Chaudhuri, Swarat (advisor).
Subjects/Keywords: Program Synthesis; Big Data; Machine Learning
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lu, Y. (2019). Corpus-Driven Systems for Program Synthesis and Refactoring. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/105342
Chicago Manual of Style (16th Edition):
Lu, Yanxin. “Corpus-Driven Systems for Program Synthesis and Refactoring.” 2019. Doctoral Dissertation, Rice University. Accessed March 01, 2021.
http://hdl.handle.net/1911/105342.
MLA Handbook (7th Edition):
Lu, Yanxin. “Corpus-Driven Systems for Program Synthesis and Refactoring.” 2019. Web. 01 Mar 2021.
Vancouver:
Lu Y. Corpus-Driven Systems for Program Synthesis and Refactoring. [Internet] [Doctoral dissertation]. Rice University; 2019. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/1911/105342.
Council of Science Editors:
Lu Y. Corpus-Driven Systems for Program Synthesis and Refactoring. [Doctoral Dissertation]. Rice University; 2019. Available from: http://hdl.handle.net/1911/105342
Rice University
12.
Rahbar, Afsaneh.
Learning Program Invariants from Proof Corpora.
Degree: MS, Engineering, 2018, Rice University
URL: http://hdl.handle.net/1911/105626
► In program verification, loop invariants are of particular interest. Indeed, writing a correct and useful invariant is as challenging as verifying the program itself. Current…
(more)
▼ In
program verification, loop invariants are of particular interest. Indeed, writing
a correct and useful invariant is as challenging as verifying the
program itself.
Current approaches to solving the problem of automatically generating invariants either
generate invariants by analyzing the
program or using machine learning to learn
from
program input and output examples, counterexamples, and so on. Each of these
approaches works on particular type of programs and specific data structures. In
this thesis, we describe the technique we have developed for generating these loop
invariants automatically. We introduce a more general learning technique that learns
from a database of annotated verified programs. Our new data-driven approach uses
the existing proofs to learn proof templates, or as we call them proof blocks. In
our method, the algorithm iterates over all possible proof block formulas by using
logical connectors until it finds an appropriate invariant formula. We evaluated our
approach on benchmarks and demonstrated the potential of our technique in verification
of programs. Using the approach of learning from verified annotated programs
makes invariant generation easier and reduces the burden on the verification engineer.
Advisors/Committee Members: Chaudhuri, Swarat (advisor).
Subjects/Keywords: Invariants; Proof Synthesis; Program verification; Hoare logic
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rahbar, A. (2018). Learning Program Invariants from Proof Corpora. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105626
Chicago Manual of Style (16th Edition):
Rahbar, Afsaneh. “Learning Program Invariants from Proof Corpora.” 2018. Masters Thesis, Rice University. Accessed March 01, 2021.
http://hdl.handle.net/1911/105626.
MLA Handbook (7th Edition):
Rahbar, Afsaneh. “Learning Program Invariants from Proof Corpora.” 2018. Web. 01 Mar 2021.
Vancouver:
Rahbar A. Learning Program Invariants from Proof Corpora. [Internet] [Masters thesis]. Rice University; 2018. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/1911/105626.
Council of Science Editors:
Rahbar A. Learning Program Invariants from Proof Corpora. [Masters Thesis]. Rice University; 2018. Available from: http://hdl.handle.net/1911/105626
Rice University
13.
Fang, Ye.
computer-aided mechanism design.
Degree: MS, Engineering, 2015, Rice University
URL: http://hdl.handle.net/1911/87798
► Algorithmic mechanism design, as practised today, is a manual process; however, manual design and reasoning do not scale well with the complexity of design tasks.…
(more)
▼ Algorithmic mechanism design, as practised today, is a manual process; however, manual design and reasoning do not scale well with the complexity of design tasks. In this thesis, we study computer-aided mechanism design as an alternative to manual construction and analysis of mechanisms. In our approach, a mechanism is a
program that receives inputs from agents with private preferences, and produces a public output. Rather than programming such a mechanism manually, the human designer writes a high-level partial specification that includes behavioral models of agents and a set of logical correctness requirements (for example, truth-telling) on the desired mechanism. A
program synthesis algorithm is now used to automatically search a large space of candidate mechanisms and find one that satis es the requirements. The algorithm is based on a reduction to automated rst-order logic theorem proving | speci cally, deciding the satis ability of quanti er-free formulas in the rst-order theory of reals. We present an implementation of our
synthesis approach on top of a Satis ability Modulo Theories solver. The system is evaluated through several case studies where we automatically synthesize a set of classic mechanisms and their variations, including the Vickrey auction, a multistage auction, a position auction, and a voting mechanism.
Advisors/Committee Members: Chaudhuri, Swarat (advisor), Vardi, Moshi (committee member), Nakhleh, Luay K. (committee member), Jermaine, Christopher M. (committee member).
Subjects/Keywords: program synthesis; economic mechanism design; game theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Fang, Y. (2015). computer-aided mechanism design. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/87798
Chicago Manual of Style (16th Edition):
Fang, Ye. “computer-aided mechanism design.” 2015. Masters Thesis, Rice University. Accessed March 01, 2021.
http://hdl.handle.net/1911/87798.
MLA Handbook (7th Edition):
Fang, Ye. “computer-aided mechanism design.” 2015. Web. 01 Mar 2021.
Vancouver:
Fang Y. computer-aided mechanism design. [Internet] [Masters thesis]. Rice University; 2015. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/1911/87798.
Council of Science Editors:
Fang Y. computer-aided mechanism design. [Masters Thesis]. Rice University; 2015. Available from: http://hdl.handle.net/1911/87798
Penn State University
14.
Liu, Xiao.
Neural Program Synthesis for Compiler Fuzzing.
Degree: 2020, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/17272xvl5190
► Compilers are among the most fundamental programming tools for building software However, production compilers remain buggy. GNU compiler collection (GCC), a a long-lasting software released…
(more)
▼ Compilers are among the most fundamental programming tools for building software However, production compilers remain buggy. GNU compiler collection (GCC), a a long-lasting software released in 1987, provided as a standard compiler for most Unix-like operating systems, has caught over 3,410 bugs from the day they were created. Fuzzing is often leveraged for stress testing purposes with newly-generated or mutated inputs to find new security vulnerabilities. In our study, we propose a grammar-based compiler fuzzing framework called DeepFuzz that continuously synthesizes well-formed C programs to trigger internal compiler errors or “bugs” as they are commonly called. In this framework, we are interested in how to apply generative deep neural networks (DNNs), such as the sequence-to-sequence model to synthesize well-formed C programs based on training through syntax-correct programs. We are also interested in how to synthesize programs using a novel form o reinforcement learning, where the model becomes its teacher to start with a random neural network with no training data and trains itself through self-play. We will us a synthesized set of new C programs to fuzz off-the-shelf C compilers, e.g., GC and Clang/LLVM. This thesis describes our analysis of neural
program synthesis fo compiler fuzzing in three steps
First, we conduct a first-step study by implementing DeepFuzz that deploy a sequence-to-sequence model to synthesize C programs. We have performed detailed case study on analyzing the pass rate of generating well-formed
program and achieving the goal of fuzz testing, which requires a certain degree of variation In general, DeepFuzz generated 82.63% syntax valid programs and improved the testing efficacy with regards to line, function, and branch coverage. It identified previously unknown bugs, and 8 of them were confirmed by the GCC developers
Second, for the cases when we could not get any or enough data to train model for representing the grammar, we build a reinforcement learning framework fo
program synthesis and apply it to the BF programming language. With no training data set required, the model is initialized with random weights at the very beginning and it evolves with environment rewards provided by the target compiler being tested. During the performance of the learning iterations, the neural network mode gradually learns how to construct valid and diverse programs to improve testing efficacies under four different reward functions that we defined. We implemented the proposed method into a prototyping tool called AlphaProg. We performed a in-depth diversity analysis of the generated programs that explains the improve testing coverage of a target compiler being tested. We reported two important bug for this production compiler and they were confirmed and addressed by the project owner
Third, we extend the framework to synthesize C programs, which is more challenging in terms of state space. We propose an automatic code mutation framework called FuzzBoost that is based on deep reinforcement…
Advisors/Committee Members: Dinghao Wu, Dissertation Advisor/Co-Advisor, Dinghao Wu, Committee Chair/Co-Chair, Mary Beth Rosson, Committee Member, Clyde Lee Giles, Committee Member, Danfeng Zhang, Outside Member, Mary Beth Rosson, Program Head/Chair.
Subjects/Keywords: compiler testing; fuzz testing; neural program synthesis
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Liu, X. (2020). Neural Program Synthesis for Compiler Fuzzing. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/17272xvl5190
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Liu, Xiao. “Neural Program Synthesis for Compiler Fuzzing.” 2020. Thesis, Penn State University. Accessed March 01, 2021.
https://submit-etda.libraries.psu.edu/catalog/17272xvl5190.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Liu, Xiao. “Neural Program Synthesis for Compiler Fuzzing.” 2020. Web. 01 Mar 2021.
Vancouver:
Liu X. Neural Program Synthesis for Compiler Fuzzing. [Internet] [Thesis]. Penn State University; 2020. [cited 2021 Mar 01].
Available from: https://submit-etda.libraries.psu.edu/catalog/17272xvl5190.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Liu X. Neural Program Synthesis for Compiler Fuzzing. [Thesis]. Penn State University; 2020. Available from: https://submit-etda.libraries.psu.edu/catalog/17272xvl5190
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Université Laval
15.
Dostie, Isabelle.
Les dispositions d'attachement, l'intérêt pour le
mentorat et la qualité des relations mentors-protégés.
Degree: 2011, Université Laval
URL: http://hdl.handle.net/20.500.11794/22594
► Ce mémoire poursuit deux objectifs. Le premier objectif est d'examiner les liens entre les dispositions d'attachement et le fait d'accepter d'être mentor ou protégé dans…
(more)
▼ Ce mémoire poursuit deux objectifs. Le premier
objectif est d'examiner les liens entre les dispositions
d'attachement et le fait d'accepter d'être mentor ou protégé dans
un programme de mentorat formel en milieu scolaire. Le second
objectif vise à vérifier si la qualité de la relation développée
entre le mentor et le protégé est influencée par leurs dispositions
d'attachement respectives. Les participants sont des étudiants
collégiaux et universitaires sollicités pour participer au
programme MIRES (Mentorat pour l'Intégration et la Réussite des
Étudiants de Sciences). Les dispositions d'attachement ont été
mesurées avant d'inviter les étudiants à participer au programme
MIRES alors que la qualité de la relation de mentorat a été évaluée
en deux temps, après deux mois et six mois d'intervention. Les
résultats suggèrent que les dispositions d'attachement des
étudiants universitaires influencent leur intérêt à devenir mentor.
De plus, la qualité de la relation est évaluée moins positivement
par les mentors anxieux et perçue plus positivement lorsque le
protégé présente une sécurité d'attachement. Certains effets
d'interaction des dispositions d'attachement ont également été
notés. Les dyades sécurisant-sécurisant démontrent une plus grande
satisfaction de la qualité de la relation que les autres
dyades.
Advisors/Committee Members: Larose, Simon.
Subjects/Keywords: LB 5.5 UL 2011 D724; MIRES (Programme); Mentorat en éducation; Attachement
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dostie, I. (2011). Les dispositions d'attachement, l'intérêt pour le
mentorat et la qualité des relations mentors-protégés. (Thesis). Université Laval. Retrieved from http://hdl.handle.net/20.500.11794/22594
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Dostie, Isabelle. “Les dispositions d'attachement, l'intérêt pour le
mentorat et la qualité des relations mentors-protégés.” 2011. Thesis, Université Laval. Accessed March 01, 2021.
http://hdl.handle.net/20.500.11794/22594.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Dostie, Isabelle. “Les dispositions d'attachement, l'intérêt pour le
mentorat et la qualité des relations mentors-protégés.” 2011. Web. 01 Mar 2021.
Vancouver:
Dostie I. Les dispositions d'attachement, l'intérêt pour le
mentorat et la qualité des relations mentors-protégés. [Internet] [Thesis]. Université Laval; 2011. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/20.500.11794/22594.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Dostie I. Les dispositions d'attachement, l'intérêt pour le
mentorat et la qualité des relations mentors-protégés. [Thesis]. Université Laval; 2011. Available from: http://hdl.handle.net/20.500.11794/22594
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Rice University
16.
Surendran, Rishi.
Debugging, Repair, and Synthesis of Task-Parallel Programs.
Degree: PhD, Engineering, 2017, Rice University
URL: http://hdl.handle.net/1911/96003
► Parallelizing sequential programs to effectively utilize modern multicore architectures is a key challenge facing application developers and domain experts. Therefore, it is a need of…
(more)
▼ Parallelizing sequential programs to effectively utilize modern multicore architectures is a key challenge facing application developers and domain experts. Therefore, it is a need of the hour to create tools that aid programmers in developing correct and efficient parallel programs. In this thesis, we present algorithms for debugging, repairing, and synthesizing task-parallel programs that can provide a foundation for creating such tools. Our work focuses on task-parallel programs with both imperative async-finish parallelism and functional-style parallelism using futures.
First, we address the problem of detecting races in parallel programs with async, finish and future constructs. Existing dynamic determinacy race detectors for task-parallel programs are limited to programs with strict computation graphs in which a task can only wait for some subset of its descendant tasks to complete. In this thesis, we present the first known determinacy race detector for non-strict computation graphs generated using futures. The space and time complexity of our algorithm degenerate to those of the classical SP-bags algorithm when using only structured parallel constructs such as spawn-sync and async-finish. In the presence of point-to-point synchronization using futures, the complexity of the algorithm increases by a factor determined by the number of future task creation and get operations as well as the number of non-tree edges in the computation graph.
Next, we introduce a hybrid static+dynamic test-driven approach to repairing data races in task-parallel programs. Past solutions to the problem of repairing parallel programs have used static-only or dynamic-only approaches, both of which incur significant limitations in practice. Static approaches can guarantee soundness in many cases but are limited in precision when analyzing medium or large-scale software with accesses to pointer-based data structures in multiple procedures. Dynamic approaches are more precise, but their proposed repairs are limited to a single input and are not reflected back in the original source
program. Our approach includes a novel coupling between static and dynamic analyses. First, we execute the
program on a concrete test input and determine the set of data races for this input dynamically. Next, we compute a set of static "finish" placements that repairs these races and also respects the static scoping rules of the
program while maximizing parallelism.
Finally, we introduce a novel approach to automatically synthesize task-parallel programs with futures from sequential programs through identification of pure method calls. Our approach is built on three new techniques to address the challenge of automatic parallelization via future
synthesis: candidate future
synthesis, parallelism benefit analysis, and threshold expression
synthesis. In candidate future
synthesis, our system annotates pure method calls as async expressions and synthesizes a parallel
program with future objects and their type declarations that are more precise than…
Advisors/Committee Members: Sarkar, Vivek (advisor).
Subjects/Keywords: Debugging; Program repair; Program synthesis; Futures; Async; Finish; Task Parallelism
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Surendran, R. (2017). Debugging, Repair, and Synthesis of Task-Parallel Programs. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/96003
Chicago Manual of Style (16th Edition):
Surendran, Rishi. “Debugging, Repair, and Synthesis of Task-Parallel Programs.” 2017. Doctoral Dissertation, Rice University. Accessed March 01, 2021.
http://hdl.handle.net/1911/96003.
MLA Handbook (7th Edition):
Surendran, Rishi. “Debugging, Repair, and Synthesis of Task-Parallel Programs.” 2017. Web. 01 Mar 2021.
Vancouver:
Surendran R. Debugging, Repair, and Synthesis of Task-Parallel Programs. [Internet] [Doctoral dissertation]. Rice University; 2017. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/1911/96003.
Council of Science Editors:
Surendran R. Debugging, Repair, and Synthesis of Task-Parallel Programs. [Doctoral Dissertation]. Rice University; 2017. Available from: http://hdl.handle.net/1911/96003
University of Texas – Austin
17.
-4094-6303.
Unifying program repair and program synthesis.
Degree: PhD, Electrical and Computer Engineering, 2018, University of Texas – Austin
URL: http://hdl.handle.net/2152/68477
► The last few years have seen much progress in two related but traditionally disjoint areas of research: program repair and program synthesis. Program repair is…
(more)
▼ The last few years have seen much progress in two related but traditionally disjoint areas of research:
program repair and
program synthesis.
Program repair is the problem of locating and removing faults in a given faulty
program.
Program synthesis is the problem of generating programs automatically from high-level specifications. While innovation in each of these two research areas has been impressive, the techniques developed within one area have largely been confined to that area. Our insight is that the unification of
program repair and
program synthesis holds a key to developing well-founded, systematic, and scalable tools for repairing complex defects. The contribution of this dissertation is three-fold: a
synthesis-based approach SketchRep for
program repair based on propositional satisfiability solving, an execution-driven
synthesis engine EdSketch for Java, and a
program repair approach SketchFix to repair defects at the AST node-level with execution-driven sketching.
SketchRep is a debugging approach that reduces the problem of
program repair to a sub-problem of
program synthesis, namely
program sketching, in which the user writes a sketch, i.e., an incomplete
program that has holes, and automated tools complete the sketch with respect to the given specification or reference implementation. Our
program repair approach translates the given faulty
program to a sketch and leverages an off-the-shelf inductive synthesizer to fill in the holes of the incomplete
program with respect to the given test suite.
EdSketch is an execution-driven
synthesis engine for Java. Traditional solutions to the sketching problem perform a translation to SAT formulas. While effective for a range of programs, when applied to real applications, such translation-based approaches may lead to impractical problems to translate all relevant libraries to SAT. Instead of transforming the
program to logic formulas for SAT solvers, EdSketch explores the actual
program behaviors in presence of libraries and provides a practical solution to sketching small parts of real-world applications.
SketchFix is a repair technique that generates candidate fixes on demand during the test execution. It translates faulty programs to sketches, compiles each sketch once which may represent a large number of concrete candidates, and lazily initializes the candidates of the sketches while validating them against the test execution.
The dissertation describes each technique and presents experimental results that demonstrate its efficacy.
Advisors/Committee Members: Khurshid, Sarfraz (advisor), Garg, Vijay (committee member), Julien, Christine (committee member), Perry, Dewayne (committee member), Prasad, Mukul (committee member).
Subjects/Keywords: Program repair; Program synthesis; Execution-driven; On-demand candidate generation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-4094-6303. (2018). Unifying program repair and program synthesis. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/68477
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-4094-6303. “Unifying program repair and program synthesis.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed March 01, 2021.
http://hdl.handle.net/2152/68477.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-4094-6303. “Unifying program repair and program synthesis.” 2018. Web. 01 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-4094-6303. Unifying program repair and program synthesis. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/2152/68477.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-4094-6303. Unifying program repair and program synthesis. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/68477
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
18.
-5365-808X.
An experimental evaluation and possible extensions of SyPet.
Degree: MSin Engineering, Electrical and Computer Engineering, 2017, University of Texas – Austin
URL: http://hdl.handle.net/2152/62665
► Program synthesis is an automated programming technique that automatically constructs a program which satisfies given specifications. SyPet is a recently published novel component-based synthesis tool…
(more)
▼ Program synthesis is an automated programming technique that automatically constructs a
program which satisfies given specifications. SyPet is a recently published novel component-based
synthesis tool that assembles a straight-line Java method body that invokes a sequence of methods from a given set of libraries to implement desired functionality that is defined by a given test suite. In this report, we experimentally evaluate the correctness and performance of the publicly available SyPet implementation, at the black-box level, focusing on the size of test suites. We then demonstrate how SyPet can be extended to support some other applications, such as synthesizing non-straight-line methods and
program repair. Finally, we conjecture an alternative technique that is conceptually simpler for synthesizing straight-line methods and present a few initial experimental results.
Advisors/Committee Members: Khurshid, Sarfraz (advisor), Dillig, Isil (committee member).
Subjects/Keywords: Program synthesis; Program repair
…can reduce the program repair problem into a
component-based synthesis problem, where n is… …applications
like non-straight line synthesis and program repair (Chapter 3). Finally, we… …procedure of component-based synthesis and
the procedure of program repair. They both generate… …16
Figure 14: An example of if-condition that changes program state… …18
Figure 16: Test file for program repair experiment…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-5365-808X. (2017). An experimental evaluation and possible extensions of SyPet. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/62665
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-5365-808X. “An experimental evaluation and possible extensions of SyPet.” 2017. Masters Thesis, University of Texas – Austin. Accessed March 01, 2021.
http://hdl.handle.net/2152/62665.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-5365-808X. “An experimental evaluation and possible extensions of SyPet.” 2017. Web. 01 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-5365-808X. An experimental evaluation and possible extensions of SyPet. [Internet] [Masters thesis]. University of Texas – Austin; 2017. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/2152/62665.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-5365-808X. An experimental evaluation and possible extensions of SyPet. [Masters Thesis]. University of Texas – Austin; 2017. Available from: http://hdl.handle.net/2152/62665
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Pontifical Catholic University of Rio de Janeiro
19.
OLIVIER HENRI PHILIPPE HALLOT.
[en] OPTIMIZATION METHODS FOR THE SYNTHESIS OF DIGITAL
FILTERS.
Degree: 2009, Pontifical Catholic University of Rio de Janeiro
URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14190
► [pt] Neste trabalho investigou-se o emprego dos recentes algoritmos de minimização de funções diferenciáveis para a resolução do problema da síntese de filtros digitais FIR…
(more)
▼ [pt] Neste trabalho investigou-se o emprego dos
recentes algoritmos de minimização de funções diferenciáveis para a
resolução do problema da síntese de filtros digitais FIR de fase
não linear. O problema desta síntese correspondente a um problema
de Aproximação de Funções quando o domínio e o contradomínio da
função são corpos diferentes, i.e. real e complexo respectivamente.
Serão revistos definições e propriedades dos filtros FIR, as
técnicas de síntese para o caso de resposta de fase linear e não
linear, para a seguir, apresentar a teoria e implementação da
Otimização de Funções não Diferenciáveis. Exemplos e extensões
desta teoria também serão apresentados
[en] This work will describe the use of the recent
techniques of non smooth optimization to the synthesis of
non-linear phase FIR filters. The problem of such synthesis
corresponds to a problem of Approximation of Functions when the
domain and the image sets of the function are different fields,
i.e. real and complex respectively. A revision of the theory of FIR
filters with a survey of linear and non linear phase usual
synthesis techniques will be presented and, a description of the
non-smooth optimization theory and implementation, together with
design examples will follow. An extension of theories will be
suggested.
Advisors/Committee Members: PHILIPPE MAHEY, MONICA ESPOSEL ALVAHYDO.
Subjects/Keywords: [pt] SINTESE; [en] SYNTHESIS; [pt] OTIMIZACAO; [en] OPTIMIZATION; [pt] FILTROS DIGITAIS; [en] DIGITAL FILTERS
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
HALLOT, O. H. P. (2009). [en] OPTIMIZATION METHODS FOR THE SYNTHESIS OF DIGITAL
FILTERS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14190
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
HALLOT, OLIVIER HENRI PHILIPPE. “[en] OPTIMIZATION METHODS FOR THE SYNTHESIS OF DIGITAL
FILTERS.” 2009. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed March 01, 2021.
http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14190.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
HALLOT, OLIVIER HENRI PHILIPPE. “[en] OPTIMIZATION METHODS FOR THE SYNTHESIS OF DIGITAL
FILTERS.” 2009. Web. 01 Mar 2021.
Vancouver:
HALLOT OHP. [en] OPTIMIZATION METHODS FOR THE SYNTHESIS OF DIGITAL
FILTERS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2009. [cited 2021 Mar 01].
Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14190.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
HALLOT OHP. [en] OPTIMIZATION METHODS FOR THE SYNTHESIS OF DIGITAL
FILTERS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2009. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14190
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Université du Québec à Montréal
20.
Amroune, Boudjemâa.
Impact des programmes de mise à niveau sur la performance de la PME dans un environnement ouvert et intense : cas de l'Algérie.
Degree: 2014, Université du Québec à Montréal
URL: http://archipel.uqam.ca/6744/1/D2689.pdf
► L'impact de l'environnement ouvert et intense sur les petites et moyennes entreprises « PME » est caractérisé par une forte intensité institutionnellement turbulente, notamment ces…
(more)
▼ L'impact de l'environnement ouvert et intense sur les petites et moyennes entreprises « PME » est caractérisé par une forte intensité institutionnellement turbulente, notamment ces dernières années, avec l'accélération des changements dans l'environnement externe immédiat à l'entreprise (Lecerf, 2006; El-Shobery et al. 2010; Wiji Suratno, 2013). Cette réalité a mis en relief l'incapacité de l'entreprise dans les pays en développement (PVD) de se développer adéquatement et de conquérir de nouveaux marchés. Pour parer à ces désavantages, les autorités publiques dans certains pays en développement ont mis en œuvre des programmes de mise à niveau afin d'améliorer la performance, de hisser la compétitivité et d'adapter la PME à son environnement qui est en perpétuel changement (Konopielli et Bell, 1998; Moati, 2001). Ces programmes sont devenus une pratique courante dans les pays en développement, selon Anton et al. (1996), Konopielli et Bell (1998), Moati (2001), Bennaceur et al. (2007) et Madaoui et Boukrif (2009). Bien avant, les programmes de mise à niveau ont été développés dans les pays asiatiques du Sud-est, les pays en transition de l'Europe de l'Est et la Russie, et ce dans le développement des programmes d'aides aux PME dits programmes de mise à niveau. Nous citons, entre autres : les économies en transition (Johnson et Loveman, 1995; Konopielko et Bell, 1998; Kolodko, 2003), la Pologne (Konopielko et Bell, 1998; Fogel et Zapalska, 2001), la Roumanie (Anton et al., 1996) et la Hongrie (Smallbone et Welter, 2001). Par ailleurs, dans les pays asiatiques du Sud-est, c'est le cas de la Malaisie (Lall, 1999; Habaradas, 2008), l'Indonésie (Tambunan, 2007), la Chine (White et Linden, 2002), l'Inde (Shridhar, 2006) et Taïwan (Lin et Chen, 2007). En effet, cette pratique s'est également propagée dans les pays Nord-africains, notamment les programmes de mise à niveau implantés au Maroc, en Tunisie, en Algérie et en Égypte (Bennaceur et al., 2007). Ce projet de recherche vise à identifier l'effet de ces programmes sur la performance et la recherche des facteurs clés de succès de la PME, spécifiquement mises à niveau dans les pays en développement, particulièrement en Algérie. En fait, cette recherche se veut une application dans le contexte de pays en développement, le contexte algérien servant de cas pratique. Ainsi, pour concrétiser cette recherche, une stratégie de recherche empirique déductive a été faite. La recherche s'appuie sur une méthode quantitative par la réalisation d'une enquête sur le terrain avec l'administration d'un questionnaire quantitatif et de quelques entrevues. La cueillette de données s'est faite principalement par opération e-mailing, tout en utilisant la base de données et les serveurs informatiques de la compagnie Kompass International, filiale algérienne, dans l'envoi des courriers électroniques aux entreprises algériennes. Le nombre d'entreprises qui ont répondu à notre questionnaire s'élève à 1014 entreprises, soit un taux de réponses qui totalise 11,16%. L'objectif de cette recherche est de…
Subjects/Keywords: Compétitivité; Performance; Programme gouvernemental; Petite et moyenne entreprise; Algérie; Pays en développement
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Amroune, B. (2014). Impact des programmes de mise à niveau sur la performance de la PME dans un environnement ouvert et intense : cas de l'Algérie. (Thesis). Université du Québec à Montréal. Retrieved from http://archipel.uqam.ca/6744/1/D2689.pdf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Amroune, Boudjemâa. “Impact des programmes de mise à niveau sur la performance de la PME dans un environnement ouvert et intense : cas de l'Algérie.” 2014. Thesis, Université du Québec à Montréal. Accessed March 01, 2021.
http://archipel.uqam.ca/6744/1/D2689.pdf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Amroune, Boudjemâa. “Impact des programmes de mise à niveau sur la performance de la PME dans un environnement ouvert et intense : cas de l'Algérie.” 2014. Web. 01 Mar 2021.
Vancouver:
Amroune B. Impact des programmes de mise à niveau sur la performance de la PME dans un environnement ouvert et intense : cas de l'Algérie. [Internet] [Thesis]. Université du Québec à Montréal; 2014. [cited 2021 Mar 01].
Available from: http://archipel.uqam.ca/6744/1/D2689.pdf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Amroune B. Impact des programmes de mise à niveau sur la performance de la PME dans un environnement ouvert et intense : cas de l'Algérie. [Thesis]. Université du Québec à Montréal; 2014. Available from: http://archipel.uqam.ca/6744/1/D2689.pdf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Pontifical Catholic University of Rio de Janeiro
21.
DOUGLAS MOTA DIAS.
[en] AUTOMATIC SYNTHESIS OF DIGITAL MICROCONTROLLER PROGRAMS
BY GENETIC PROGRAMMING.
Degree: 2005, Pontifical Catholic University of Rio de Janeiro
URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6666
► [pt] Esta dissertação investiga o uso de programação genética linear na síntese automática de programas em linguagem de montagem para microcontroladores, que implementem estratégias de…
(more)
▼ [pt] Esta dissertação investiga o uso de programação
genética linear na síntese automática de programas em linguagem de
montagem para microcontroladores, que implementem estratégias de
controle de tempo ótimo ou sub-ótimo, do sistema a ser controlado,
a partir da modelagem matemática por equações dinâmicas. Uma das
dificuldades encontradas no projeto convencional de um sistema de
controle ótimo é que soluções para este tipo de problema
normalmente implicam em uma função altamente não-linear das
variáveis de estado do sistema. Como resultado, várias vezes não é
possível encontrar uma solução matemática exata. Já na
implementação, surge a dificuldade de se ter que programar
manualmente o microcontrolador para executar o controle desejado. O
objetivo deste trabalho foi, portanto, contornar tais dificuldades
através de uma metodologia que, a partir da modelagem matemática de
uma planta, fornece como resultado um programa em linguagem de
montagem. O trabalho consistiu no estudo sobre os possíveis tipos
de representações para a manipulação genética de programas em
linguagem de montagem, tendo sido concluído que a linear é a mais
adequada, e na implementação de uma ferramenta para realizar os
três estudos de caso: water bath, cart centering e pêndulo
invertido. O desempenho de controle dos programas sintetizados foi
comparado com o dos sistemas obtidos por outros métodos (redes
neurais, lógica fuzzy, sistemas neurofuzzy e programação genética).
Os programas sintetizados demonstraram, no mínimo, o mesmo
desempenho, mas com a vantagem adicional de fornecerem a solução já
no formato final da plataforma de implementação escolhida: um
microcontrolador.
[en] This dissertation investigates the use of genetic
programming in automatic synthesis of assembly language programs
for microcontrollers, which implement time-optimal or sub-optimal
control strategies of the system to be controlled, from the
mathematical modeling by dynamic equations. One of the issues faced
in conventional design of an optimal control system is that
solutions for this kind of problem commonly involve a highly
nonlinear function of the state variables of the system. As a
result, frequently it is not possible to find an exact mathematical
solution. On the implementation side, the difficulty comes when one
has to manually program the microcontroller to run the desired
control. Thus, the objective of this work was to overcome these
difficulties applying a methodology that, starting from the
mathematical modeling of a plant, provides as result an assembly
language microcontroller program. The work included a study of the
possible types of genetic representation for the manipulation of
assembly language programs. In this regard, it has been concluded
that the linear is the most suitable representation. The work also
included the implementation of a tool to accomplish three study
cases: water bath, cart centering and inverted pendulum. The
performance of control of the synthesized programs was compared
with the one obtained by other methods (neural networks,…
Advisors/Committee Members: MARCO AURÉLIO CAVALCANTI PACHECO.
Subjects/Keywords: [pt] CONTROLE OTIMO; [en] OPTIMAL CONTROL; [pt] SINTESE DE PROGRAMAS; [en] PROGRAM SYNTHESIS; [pt] PROGRAMACAO GENETICA; [en] GENETIC PROGRAMMING; [pt] LINGUAGEM DE MONTAGEM; [en] ASSEMBLY LANGUAGE; [pt] MICROCONTROLADOR; [en] MICROCONTROLLER
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
DIAS, D. M. (2005). [en] AUTOMATIC SYNTHESIS OF DIGITAL MICROCONTROLLER PROGRAMS
BY GENETIC PROGRAMMING. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6666
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
DIAS, DOUGLAS MOTA. “[en] AUTOMATIC SYNTHESIS OF DIGITAL MICROCONTROLLER PROGRAMS
BY GENETIC PROGRAMMING.” 2005. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed March 01, 2021.
http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6666.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
DIAS, DOUGLAS MOTA. “[en] AUTOMATIC SYNTHESIS OF DIGITAL MICROCONTROLLER PROGRAMS
BY GENETIC PROGRAMMING.” 2005. Web. 01 Mar 2021.
Vancouver:
DIAS DM. [en] AUTOMATIC SYNTHESIS OF DIGITAL MICROCONTROLLER PROGRAMS
BY GENETIC PROGRAMMING. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2005. [cited 2021 Mar 01].
Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6666.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
DIAS DM. [en] AUTOMATIC SYNTHESIS OF DIGITAL MICROCONTROLLER PROGRAMS
BY GENETIC PROGRAMMING. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2005. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6666
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
22.
Zaccagnini, Julie.
Les déterminants de la performance des acquéreurs en série : The determinants of the serial acquirers’ performance.
Degree: Docteur es, Sciences de gestion, 2018, Lyon
URL: http://www.theses.fr/2018LYSE2076
► L’activité de fusions et acquisitions (désormais F&A) a atteint un niveau record en 2017 et s’est élevée à plus de 2 993 milliards d’euros (Thomson…
(more)
▼ L’activité de fusions et acquisitions (désormais F&A) a atteint un niveau record en 2017 et s’est élevée à plus de 2 993 milliards d’euros (Thomson Reuters, 2018). Cette dynamique sur le marché des F&A est toutefois dominée par une minorité d’acquéreurs qui entreprennent un très grand nombre de F&A (Kengelbach, Klemmer, Schwetzler et Sperling, 2012). Les importants changements environnementaux tels que la globalisation, l'intégration des économies émergentes et les progrès technologiques ont, en outre, suscité de nouvelles opportunités de croissance pour les firmes et ontfait émerger de véritables « serial acquéreurs » ; ces entreprises qui s’engagent dans des séries ou flux de F&A (Fuller, Netter et Stegemoller, 2002) afin de créer de la valeur et améliorer leur performance économique et financière (Laamanen et Keil, 2008). La mise en œuvre et la réussite de cette stratégie extrêmement complexe et risquée (Boubakri, Chan et Kooli, 2012) s’avèrent toutefois difficiles en pratique (Haleblian, Devers, McNamara, Carpenter et Davison, 2009). Plusieurs études montrent, ainsi, des résultats décevants ou une diminution de la performance des acquéreurs en série au fil de leurs opérations (Billett et Qian, 2008 ; Ismail, 2008 ; Fuller et al., 2002). Ce travail de recherche a dès lors été guidé par l’objectif d’identifier des nouveaux déterminants de la performance en s’intéressant aux fondements stratégiques de ceux-ci, qui permettent de piloter efficacement un programme de F&A, de gérer sa complexité et les risques qui y sont associés, et ainsi favoriser ultimement la performance des firmes.Les résultats de cette recherche ; menée à travers 3 essais ; soulignent l’importance des caractéristiques des programmes de F&A (le rythme, la place et le degré de diversification des F&A) et des motivations sous-jacentes aux opérations de désinvestissement (quand elles sont réalisées dans une optique de gestion de portefeuille dynamique) dans la performance financière des acquéreurs en série. De plus, la performance stratégique en matière de croissance, d’internationalisation et de diversification est permise par des séries de F&A qui s’accompagnent du développement de capacités d’acquisition et de la mise en place de mécanismes d’apprentissage organisationnel tels que la temporisation pour codifier et capitaliser les connaissances acquises, l’ajustement de la vitesse d’intégration à la nature de l’intégration poursuivie et la routinisation des processus d’acquisition par la mise en place d’un système d’information commun à l’ensemble du groupe. Ces acquéreurs en série constitueraient ainsi des acquéreurs « habituels », développant de véritables routines d’acquisition. Ces résultats suggèrent, en outre, qu’au-delà des acquéreurs en série, il existe desacquéreurs habituels en parallèle, véritables « maîtres de portefeuille » (Kengelbach, Keienburg, Schmid, Sievers et Mehring, 2016) qui acquièrent parfois en « grappes » ou qui, simultanément, acquièrent et désinvestissent pour gérer au mieux leur portefeuille d’actifs…
Advisors/Committee Members: Girod-Séville, Martine (thesis director), Goy, Hervé (thesis director).
Subjects/Keywords: Acquéreurs en série; Acquéreurs habituels; Apprentissage organisationnel; Désinvestissements; Fusion-acquisition; Performance; Programme d’acquisitions; Serial acquirer; Common acquirers; Organizational learning; Divestments; Merger-acquisition; Performance; Acquisitions program; 650
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zaccagnini, J. (2018). Les déterminants de la performance des acquéreurs en série : The determinants of the serial acquirers’ performance. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2018LYSE2076
Chicago Manual of Style (16th Edition):
Zaccagnini, Julie. “Les déterminants de la performance des acquéreurs en série : The determinants of the serial acquirers’ performance.” 2018. Doctoral Dissertation, Lyon. Accessed March 01, 2021.
http://www.theses.fr/2018LYSE2076.
MLA Handbook (7th Edition):
Zaccagnini, Julie. “Les déterminants de la performance des acquéreurs en série : The determinants of the serial acquirers’ performance.” 2018. Web. 01 Mar 2021.
Vancouver:
Zaccagnini J. Les déterminants de la performance des acquéreurs en série : The determinants of the serial acquirers’ performance. [Internet] [Doctoral dissertation]. Lyon; 2018. [cited 2021 Mar 01].
Available from: http://www.theses.fr/2018LYSE2076.
Council of Science Editors:
Zaccagnini J. Les déterminants de la performance des acquéreurs en série : The determinants of the serial acquirers’ performance. [Doctoral Dissertation]. Lyon; 2018. Available from: http://www.theses.fr/2018LYSE2076
University of Colorado
23.
McClurg, Jedidiah.
Program Synthesis for Software-Defined Networking.
Degree: PhD, 2018, University of Colorado
URL: https://scholar.colorado.edu/csci_gradetds/164
► Software-defined networking (SDN) is revolutionizing the networking industry, but even the most advanced SDN programming platforms lack mechanisms for changing the <b>global configuration</b> (the…
(more)
▼ Software-defined networking (SDN) is revolutionizing the networking industry, but even the most advanced SDN programming platforms lack mechanisms for changing the <b>global configuration</b> (the set of all forwarding rules on the switches) correctly and automatically. This seemingly-simple notion of global configuration change (known as a <b>network update</b>) can be quite challenging for SDN programmers to implement by hand, because networks are distributed systems with hundreds or thousands of interacting nodes – even if the initial and final configurations are correct, naïvely updating individual nodes can lead to bugs in the intermediate configurations. Additionally, SDN programs must simultaneously describe both static forwarding behavior, and dynamic updates in response to events. These <b>event-driven updates</b> are critical to get right, but even more difficult to implement correctly due to interleavings of data packets and control messages. Existing SDN platforms offer only weak guarantees in this regard, also opening the door for incorrect behavior. As an added wrinkle, event-driven network programs are often physically distributed, running on several nodes of the network, and this distributed setting makes programming and debugging even more difficult. Bugs arising from any of these issues can cause serious incorrect transient behaviors, including loops, black holes, and access-control violations. This thesis presents a
synthesis-based approach for solving these issues. First, I show how to automatically <b>synthesize network updates</b> that are guaranteed to preserve specified properties. I formalize the network updates problem and develop a
synthesis algorithm based on counterexample-guided search and incremental model checking. Second, I add the ability to reason about transitions between configurations in response to events, by introducing <b>event-driven consistent updates</b> that are guaranteed to preserve well-defined behaviors in this context. I propose <b>network event structures</b> (NESs) to model constraints on updates, such as which events can be enabled simultaneously and causal dependencies between events. I define an extension of the NetKAT language with mutable state, give semantics to stateful programs using NESs, and discuss provably-correct strategies for implementing NESs in SDNs. Third, I propose a <b>synchronization
synthesis</b> approach that allows correct "parallel composition" of several event-driven programs (<b>processes</b>) – the programmer can specify each sequential process, and add a declarative specification of paths that packets are allowed to take. The synthesizer then inserts synchronization among the distributed controller processes such that the declarative specification will be satisfied by all packets traversing the network. The key technical contribution here is a counterexample-guided
synthesis algorithm that furnishes network processes with the synchronization required to prevent any races causing specification violations. An important component…
Advisors/Committee Members: Pavol Cerny, Bor-Yuh Chang, Nate Foster, Dirk Grunwald, Mooly Sagiv.
Subjects/Keywords: networking; program synthesis; program verification; software-defined networking; updates; Computer Sciences; Digital Communications and Networking
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
McClurg, J. (2018). Program Synthesis for Software-Defined Networking. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/csci_gradetds/164
Chicago Manual of Style (16th Edition):
McClurg, Jedidiah. “Program Synthesis for Software-Defined Networking.” 2018. Doctoral Dissertation, University of Colorado. Accessed March 01, 2021.
https://scholar.colorado.edu/csci_gradetds/164.
MLA Handbook (7th Edition):
McClurg, Jedidiah. “Program Synthesis for Software-Defined Networking.” 2018. Web. 01 Mar 2021.
Vancouver:
McClurg J. Program Synthesis for Software-Defined Networking. [Internet] [Doctoral dissertation]. University of Colorado; 2018. [cited 2021 Mar 01].
Available from: https://scholar.colorado.edu/csci_gradetds/164.
Council of Science Editors:
McClurg J. Program Synthesis for Software-Defined Networking. [Doctoral Dissertation]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/csci_gradetds/164
University of Illinois – Urbana-Champaign
24.
Croft, Jason.
Toward predictable control of software-defined networks.
Degree: PhD, Computer Science, 2017, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/99234
► Traditional computer networks require manual configuration of potentially hundreds of forwarding devices. To ease this configuration burden, software-defined networking (SDN) provides centralized, programmatic control of…
(more)
▼ Traditional computer networks require manual configuration of potentially hundreds of forwarding devices. To ease this configuration burden, software-defined networking (SDN) provides centralized, programmatic control of switch data planes in the form of applications, or control modules. This modular design simplifies development, and allows network operators to leverage a potentially vast library of open source SDN applications.
However, configuring an SDN is still prone to misconfigurations, software bugs, and unexpected behavior. An operator must reason about the configuration on at least three planes in the network: the management plane, the control plane, and the data plane. At the control plane, an operator must ensure the applications driving the network are correct, or free of software bugs. At the management plane, an operator must determine how to compose together multiple applications to create a coherent forwarding behavior. This requires reasoning about inter-application interactions and how to resolve conflicts between them. Finally, she must understand the execution of the applications on top of the controller, and how any bugs in the controller's implementation may introduce unexpected behavior.
This thesis explores techniques in verification and
synthesis to ease the burden of configuring of an SDN and provide techniques to automatically search for unpredictable behavior. We present three primitives to search
program behavior at the management plane, control plane, and data plane, without the need to understand the implementation details of the controller or applications. Specifically, we design primitives for orchestration, fast-forwarding, and autocorrect.
First, to tackle the problem of SDN application correctness, we introduce a fast-forwarding primitive to verify and explore future behaviors of a control plane application. Unlike traditional approaches to software verification, this primitive faithfully models time – an important source of complexity in control programs. We implement this idea in a model checker called DeLorean, and develop techniques to speed up the exploration of control programs. As a result, DeLorean can explore the future behavior of programs faster than they occur.
Next, to reduce the complexity of composing together multiple, independent applications, we provide an orchestration primitive. This technique automatically discovers dependencies between applications and can suggest conflict-free composition plans to operators. With this primitive, we adopt a relational representation of the network and use a standard PostgreSQL database to develop a controller called Ravel. In addition to logic-based reasoning of inter-application dependencies, Ravel enables ad-hoc creation of new programming abstractions. Furthermore, Ravel can act as a runtime on which different abstractions or controllers can execute using translations to Ravel’s schema.
Finally, to reduce the operator's burden of understanding the low-level implementation details of an…
Advisors/Committee Members: Caesar, Matthew (advisor), Caesar, Matthew (Committee Chair), Godfrey, Brighten (committee member), Parthasarathy, Madhusudan (committee member), Mahajan, Ratul (committee member).
Subjects/Keywords: Software-defined networking; Program verification; Program synthesis; Model checking; Timed automata; Database-defined networking
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Croft, J. (2017). Toward predictable control of software-defined networks. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99234
Chicago Manual of Style (16th Edition):
Croft, Jason. “Toward predictable control of software-defined networks.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 01, 2021.
http://hdl.handle.net/2142/99234.
MLA Handbook (7th Edition):
Croft, Jason. “Toward predictable control of software-defined networks.” 2017. Web. 01 Mar 2021.
Vancouver:
Croft J. Toward predictable control of software-defined networks. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/2142/99234.
Council of Science Editors:
Croft J. Toward predictable control of software-defined networks. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99234
Université du Québec à Montréal
25.
Masmoudi, Yousr.
La formation du compagnon dans le programme d'apprentissage en milieu de travail.
Degree: 2008, Université du Québec à Montréal
URL: http://www.archipel.uqam.ca/1142/1/M10294.pdf
► La présente recherche est de type qualitatif et de nature exploratoire. Elle rend compte des représentations des comités sectoriels de la main d'oeuvre (CSMO) au…
(more)
▼ La présente recherche est de type qualitatif et de nature exploratoire. Elle rend compte des représentations des comités sectoriels de la main d'oeuvre (CSMO) au sujet de la formation pédagogique des compagnons dans le cadre du programme d'apprentissage en milieu de travail (PAMT). Cette recherche s'articule autour de trois axes: le PAMT, le compagnon et la formation pédagogique des compagnons. L'apprentissage en milieu de travail est une pratique traditionnelle, aussi ancienne que l'existence des métiers. Cependant, cette pratique a connu à travers les siècles et les systèmes de formation professionnelle plusieurs rebondissements, retracés brièvement dans cette recherche. L'apprentissage en milieu de travail est de plus en plus structuré et reconnu par une certification des compétences. Le PAMT repose sur le compagnonnage. Le compagnonnage existe depuis très longtemps, et il est encore de grande actualité puisqu'il est à la base du PAMT. Ce nouveau programme d'apprentissage en milieu de travail implanté en 2002 dans les entreprises québécoises suscite la participation active de plusieurs partenaires dont celle des CSMO.
L'échantillon choisi pour la collecte des données est de type « raisonné ». Il est constitué de huit CSMO représentés par quatre femmes et quatre hommes issus des secteurs d'activités primaire, secondaire et tertiaire. Ces huit CSMO sont les seuls sur les vingt neuf existants à avoir organisé et donné une formation aux compagnons dans le cadre du PAMT en 2004-2005. Les huit personnes interviewées ont été désignées comme celles qui ont en charge le dossier du PAMT. Elles ont partagé leur vécu de l'implantation du PAMT ainsi que celui de l'organisation de la formation du compagnon. Ellcs ont parlé de l'importance qu'elles accordaient à la formation du compagnon pour bien le préparer au rôle qui lui est attribué dans le PAMT. Elles ont spécifié la nature du contenu de la formation, le type d'intervenants et des experts sollicités pour outiller le compagnon pour son rôle dans un processus d'apprentissage. Elles ont décrit les outils élaborés propres au milieu du travail et destinés à leurs compagnons. L'analyse des données recueillies a permis de déterminer la représentation des CSMO du compagnon dans le cadre du PAMT, comme un expert dans son milieu capable de transmettre son métier et possédant des habiletés de communication et de coaching. Par conséquent, les CSMO ont exprimé le besoin de développer des outils stimulant les compétences des compagnons en relations humaines et en communication. Les CSMO ont aussi inclus dans leur formation, l'utilisation d'outils concernant les notions de santé et de sécurité ainsi que des fiches techniques de contenus variés pour aider les compagnons dans leur rôle. Les CSMO dans leur majorité, s'entendent pour dire que la formation en compagnonnage a pour objectif principal la préparation du compagnon afin qu'il puisse jouer son rôle en milieu de travail et qu'il puisse utiliser les outils fournis (carnet d'apprentissage et guide du compagnon) par le PAMT.…
Subjects/Keywords: Formation en entreprise; Programme de formation; Milieu de travail; Formation en cours d'emploi; Formation professionnelle; Animateur de formation; Québec (Province)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Masmoudi, Y. (2008). La formation du compagnon dans le programme d'apprentissage en milieu de travail. (Thesis). Université du Québec à Montréal. Retrieved from http://www.archipel.uqam.ca/1142/1/M10294.pdf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Masmoudi, Yousr. “La formation du compagnon dans le programme d'apprentissage en milieu de travail.” 2008. Thesis, Université du Québec à Montréal. Accessed March 01, 2021.
http://www.archipel.uqam.ca/1142/1/M10294.pdf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Masmoudi, Yousr. “La formation du compagnon dans le programme d'apprentissage en milieu de travail.” 2008. Web. 01 Mar 2021.
Vancouver:
Masmoudi Y. La formation du compagnon dans le programme d'apprentissage en milieu de travail. [Internet] [Thesis]. Université du Québec à Montréal; 2008. [cited 2021 Mar 01].
Available from: http://www.archipel.uqam.ca/1142/1/M10294.pdf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Masmoudi Y. La formation du compagnon dans le programme d'apprentissage en milieu de travail. [Thesis]. Université du Québec à Montréal; 2008. Available from: http://www.archipel.uqam.ca/1142/1/M10294.pdf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Ottawa
26.
Taillon, Myriam.
L’impact d’un programme éducatif sur la qualité de vie de personnes aînées autonomes et hypertendues en milieu francophone minoritaire
.
Degree: 2016, University of Ottawa
URL: http://hdl.handle.net/10393/35498
► L’hypertension artérielle est une maladie chronique qui affecte près de 50 % des personnes de plus de 65 ans au Canada et de façon disproportionnelle,…
(more)
▼ L’hypertension artérielle est une maladie chronique qui affecte près de 50 % des personnes de plus de 65 ans au Canada et de façon disproportionnelle, les communautés en situation minoritaire linguistique. L’objectif du projet était de sensibiliser des personnes de 65 ans et plus, hypertendues, en milieu francophone minoritaire aux facteurs de risque de l’hypertension par des ateliers éducatifs. L’impact de ces ateliers a été mesuré par un questionnaire sur la qualité de vie et des groupes de discussion. Il y a eu 34 participants. Les questionnaires ont révélé une amélioration dans les dimensions physique et mentale de la santé des participants (p < 0,001). Les groupes de discussion ont démontré que les participants comprenaient mieux la maladie et avaient modifié certains comportements. Les ateliers ont été reconnus comme très positifs par les participants. En conclusion, ce programme éducatif de 3 mois est efficace, faisable et apprécié chez cette population.
Subjects/Keywords: hypertension artérielle;
haute pression;
francophone en situation linguistique minoritaire;
personnes aînées;
prise en charge;
programme éducatif
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Taillon, M. (2016). L’impact d’un programme éducatif sur la qualité de vie de personnes aînées autonomes et hypertendues en milieu francophone minoritaire
. (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/35498
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Taillon, Myriam. “L’impact d’un programme éducatif sur la qualité de vie de personnes aînées autonomes et hypertendues en milieu francophone minoritaire
.” 2016. Thesis, University of Ottawa. Accessed March 01, 2021.
http://hdl.handle.net/10393/35498.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Taillon, Myriam. “L’impact d’un programme éducatif sur la qualité de vie de personnes aînées autonomes et hypertendues en milieu francophone minoritaire
.” 2016. Web. 01 Mar 2021.
Vancouver:
Taillon M. L’impact d’un programme éducatif sur la qualité de vie de personnes aînées autonomes et hypertendues en milieu francophone minoritaire
. [Internet] [Thesis]. University of Ottawa; 2016. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/10393/35498.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Taillon M. L’impact d’un programme éducatif sur la qualité de vie de personnes aînées autonomes et hypertendues en milieu francophone minoritaire
. [Thesis]. University of Ottawa; 2016. Available from: http://hdl.handle.net/10393/35498
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Pontifical Catholic University of Rio de Janeiro
27.
NIKOLAS BRANCO PADILHA.
[en] SYNTHESIS OF HYBRID METAL/OXIDE NANOSTRUCTURES AND
EVALUATION OF THEIR PROPERTIES.
Degree: 2019, Pontifical Catholic University of Rio de Janeiro
URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37263
► [pt] A síntese de nanopartículas (NP) de níquel metálico via rota solvotérmica foi estudada com o intuito de produzir estruturas híbridas destas NP ancoradas na…
(more)
▼ [pt] A síntese de nanopartículas (NP) de níquel
metálico via rota solvotérmica foi estudada com o intuito de
produzir estruturas híbridas destas NP ancoradas na superfície de
titanatos nanoestruturados. Inicialmente os parâmetros ideais para
a formação das NP com os menores e monodispersos diâmetros foram
determinados com o auxílio das técnicas de difração de raios X e de
microscopia eletrônica. Em seguida, nanotubos de titanatos foram
sintetizados via rota hidrotérmica alcalina. Esses titanatos foram
adicionados à rota solvotérmica já estudada, buscando a nucleação
heterogênea das NP de Ni metálico em sua superfície. Os produtos
das sínteses foram analisados por diversas técnicas de
caracterização a fim de determinar a nanoestrutura dos produtos
formados, a estabilidade térmica das NP, assim como identificar os
subprodutos da síntese solvotérmica e medir as eficiências
catalíticas e fotocatalíticas dos materiais. Os resultados
permitiram concluir sobre as características estruturais dos
materiais e a eficácia da ancoração, bem como os mecanismos
envolvidos na síntese solvotérmica para a redução do Ni2, presente
no precursor organometálico, para Ni0, apresentando uma nova rota
para a produção destas NP.
[en] The synthesis of metallic nickel nanoparticles
(Ni-NP) via a solvothermic route was studied to produce hybrid
structures of these NP anchored to the surface of nanostructured
titanates. Initially the ideal parameters for the formation of NP
with the smallest and monodisperse diameters were determined with
the aid of Xray diffraction and electron microscopy techniques.
Then, titanate nanotubes were synthesized via alkaline hydrothermal
route. These titanates were added to the studied solvothermic
route, seeking the heterogeneous nucleation of Ni-NP on its
surface. The synthesis products were analyzed by several
characterization techniques to determine the nanostructure of the
products, the thermal stability of the NP, to identify the
by-products of the solvothermic synthesis and to measure the
catalytic and photocatalytic efficiencies of the materials. The
results include the structural characteristics of the materials and
the anchoring efficiency, as well as the mechanisms involved in the
solvothermic synthesis to reduce the Ni2 ion, a component of the
organometallic precursor, to Ni0, introducing a new route for the
synthesis of these NPs.
Advisors/Committee Members: FERNANDO COSME RIZZO ASSUNCAO.
Subjects/Keywords: [pt] SINTESE HIDROTERMICA; [en] HIDROTHERMAL SYNTHESIS; [pt] FOTOCATÁLISE; [en] PHOTOCATALYSIS; [pt] CATALISE; [en] CATALYSIS; [pt] SINTESE DE NANOMATERIAIS; [en] SYNTHESIS OF NANOMATERIALS; [pt] NANOPARTICULA DE NIQUEL; [en] NICKEL NANOPARTICLE; [pt] TITANATO; [en] TITANATE; [pt] SINTESE SOLVOTERMICA; [en] SOLVOTHERMIC SYNTHESIS; [pt] CARACTERIZACAO DE NANOMATERIAIS; [en] CHARACTERIZATION OF NANOMATERIALS
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
PADILHA, N. B. (2019). [en] SYNTHESIS OF HYBRID METAL/OXIDE NANOSTRUCTURES AND
EVALUATION OF THEIR PROPERTIES. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37263
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
PADILHA, NIKOLAS BRANCO. “[en] SYNTHESIS OF HYBRID METAL/OXIDE NANOSTRUCTURES AND
EVALUATION OF THEIR PROPERTIES.” 2019. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed March 01, 2021.
http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37263.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
PADILHA, NIKOLAS BRANCO. “[en] SYNTHESIS OF HYBRID METAL/OXIDE NANOSTRUCTURES AND
EVALUATION OF THEIR PROPERTIES.” 2019. Web. 01 Mar 2021.
Vancouver:
PADILHA NB. [en] SYNTHESIS OF HYBRID METAL/OXIDE NANOSTRUCTURES AND
EVALUATION OF THEIR PROPERTIES. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2019. [cited 2021 Mar 01].
Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37263.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
PADILHA NB. [en] SYNTHESIS OF HYBRID METAL/OXIDE NANOSTRUCTURES AND
EVALUATION OF THEIR PROPERTIES. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2019. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37263
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of California – Berkeley
28.
Hottelier, Thibaud Baptiste.
Programming Layout by Manipulation.
Degree: Electrical Engineering & Computer Sciences, 2014, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/74r754hb
► Creating layouts for documents, GUIs, or data visualizations is a time-consuming and error-prone process. Non-programmers would like the customization and fine-grained control currently only possible…
(more)
▼ Creating layouts for documents, GUIs, or data visualizations is a time-consuming and error-prone process. Non-programmers would like the customization and fine-grained control currently only possible with handwritten layout engines. Today, such engines are written by proficient programmers. This thesis introduces new techniques for specifying layout and generating efficient layout engines.First, we present a new programming methodology which addresses the two central sources of bugs in layouts: ambiguities and conflicts. Then, we introduce a language of constraints in which we capture layout specifications formally. Finally, we show how to generate efficient layout engines automatically. We provide the following individual contributions:1) The Programming by Manipulation (PBM) paradigm targeted at non-programmers to establish specifications in visual domains such as layout. We introduce a new type of user demonstration – manipulation – which is resistant to users' imprecisions inherent in drawing. Instead of sketching the desired layout, users steer the exploration of potential layouts by pointing out what they would like to change.2) L3, a declarative language for layout specifications. L3 is based on non-directional constraints in which the flow of computation is completely abstracted away.3) A synthesis procedure – grammar modular synthesis – capable of generating layout engines from L3 specifications. Our new algorithm scales to realistic layout specifications and produces generic engines supporting languages of documents.To evaluate our work, we present two user studies showing not only that non-programmers can design interesting visualizations using PBM, but also that proficient programmers are more productive with PBM than with conventional constraint programming. We also compare the performance of our synthetized engines with state-of-the-art constraint solvers and show that our engines are up to two orders of magnitude faster.
Subjects/Keywords: Computer science; Constraint-based Layout; Manipulations; Programming by Demonstration; Program Synthesis
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hottelier, T. B. (2014). Programming Layout by Manipulation. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/74r754hb
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Hottelier, Thibaud Baptiste. “Programming Layout by Manipulation.” 2014. Thesis, University of California – Berkeley. Accessed March 01, 2021.
http://www.escholarship.org/uc/item/74r754hb.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Hottelier, Thibaud Baptiste. “Programming Layout by Manipulation.” 2014. Web. 01 Mar 2021.
Vancouver:
Hottelier TB. Programming Layout by Manipulation. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2021 Mar 01].
Available from: http://www.escholarship.org/uc/item/74r754hb.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Hottelier TB. Programming Layout by Manipulation. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/74r754hb
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Rice University
29.
Shah, Ameesh.
Differentiable Program Learning with an Admissible Neural Heuristic.
Degree: MS, Engineering, 2020, Rice University
URL: http://hdl.handle.net/1911/109184
► We study the problem of learning differentiable functions expressed as programs in a domain-specific language. Such programmatic models can offer benefits such as composability and…
(more)
▼ We study the problem of learning differentiable functions expressed as programs in a domain-specific language. Such programmatic models can offer benefits such as composability and interpretability; however, learning them requires optimizing over a combinatorial space of
program “architectures”. We frame this optimization problem
as a search in a weighted graph whose paths encode top-down derivations of
program syntax. Our key innovation is to view various classes of neural networks as continuous relaxations over the space of programs, which can then be used to complete any partial
program. This relaxed
program is differentiable and can be trained end-to-end, and the resulting training loss is an approximately admissible heuristic that can guide the combinatorial search. We instantiate our approach on top of the A* algorithm and an iteratively deepened branch-and-bound search, and use these algorithms to learn programmatic classifiers in three sequence classification tasks. Our experiments show that the algorithms outperform state-of-the-art methods for
program learning, and that they discover programmatic classifiers that yield natural interpretations and achieve competitive accuracy.
Advisors/Committee Members: Jermaine, Chris (advisor), Chaudhuri, Swarat (advisor).
Subjects/Keywords: Machine Learning; Program Synthesis; Functional Programming; Differentiable Progamming
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Shah, A. (2020). Differentiable Program Learning with an Admissible Neural Heuristic. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/109184
Chicago Manual of Style (16th Edition):
Shah, Ameesh. “Differentiable Program Learning with an Admissible Neural Heuristic.” 2020. Masters Thesis, Rice University. Accessed March 01, 2021.
http://hdl.handle.net/1911/109184.
MLA Handbook (7th Edition):
Shah, Ameesh. “Differentiable Program Learning with an Admissible Neural Heuristic.” 2020. Web. 01 Mar 2021.
Vancouver:
Shah A. Differentiable Program Learning with an Admissible Neural Heuristic. [Internet] [Masters thesis]. Rice University; 2020. [cited 2021 Mar 01].
Available from: http://hdl.handle.net/1911/109184.
Council of Science Editors:
Shah A. Differentiable Program Learning with an Admissible Neural Heuristic. [Masters Thesis]. Rice University; 2020. Available from: http://hdl.handle.net/1911/109184
30.
Dudenhefner, Andrej.
Algorithmic aspects of type-based program synthesis.
Degree: 2019, Technische Universität Dortmund
URL: http://dx.doi.org/10.17877/DE290R-20108
► In the area of type-based program synthesis, the decision problem of inhabitation (given a type environment Gamma and a type tau, is there a term…
(more)
▼ In the area of type-based
program synthesis, the decision problem of inhabitation (given a type environment Gamma and a type tau, is there a term M such that M can be assigned the type tau in Gamma?) corresponds to existence of a
program (term M) that satisfies the given specification (type tau) under additional assumptions (type environment Gamma). Inhabitation in typed lambda-calculi can be seen as functional
program synthesis from scratch. Complementarily, inhabitation in combinatory logic can be seen as domain-specific
program synthesis. Further restrictions on inhabitant search, such as principality and relevance restrictions, yield inhabitants that are more closely tied to given specifications. Alternatively, dimension, rank, order, and arity restrictions provide means to control the complexity of inhabitant search. This work provides an overview over following results in type-based
program synthesis: PSpace-completeness of principal
inhabitation in the simply typed lambda-calculus, undecidability of inhabitation in lambda-calculus with intersection types, undecidability of inhabitation in lambda-calculus with intersection types in bounded dimension, undecidability of inhabitation in subintuitionistic combinatory logic, (o+2)-ExpTime-completeness of inhabitation in combinatory logic with intersection types with instantiation of bounded order o, and ExpTime-hardness of intersection type unification.
Advisors/Committee Members: Rehof, Jakob (advisor), Urzyczyn, Pawel (referee).
Subjects/Keywords: Type theory; Inhabitation; Program synthesis; Complexity; 004; Typentheorie; Programmsynthese; Komplexität
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dudenhefner, A. (2019). Algorithmic aspects of type-based program synthesis. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-20108
Chicago Manual of Style (16th Edition):
Dudenhefner, Andrej. “Algorithmic aspects of type-based program synthesis.” 2019. Doctoral Dissertation, Technische Universität Dortmund. Accessed March 01, 2021.
http://dx.doi.org/10.17877/DE290R-20108.
MLA Handbook (7th Edition):
Dudenhefner, Andrej. “Algorithmic aspects of type-based program synthesis.” 2019. Web. 01 Mar 2021.
Vancouver:
Dudenhefner A. Algorithmic aspects of type-based program synthesis. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2019. [cited 2021 Mar 01].
Available from: http://dx.doi.org/10.17877/DE290R-20108.
Council of Science Editors:
Dudenhefner A. Algorithmic aspects of type-based program synthesis. [Doctoral Dissertation]. Technische Universität Dortmund; 2019. Available from: http://dx.doi.org/10.17877/DE290R-20108
◁ [1] [2] [3] [4] [5] … [2570] ▶
. 
Open Access Theses and Dissertations
