You searched for subject:(program analysis).
Showing records 1 – 30 of
837 total matches.
◁ [1] [2] [3] [4] [5] … [28] ▶
1.
Tarvo, Alexander.
Automated Performance Modeling of Multithreaded
Programs.
Degree: PhD, Computer Science, 2015, Brown University
URL: https://repository.library.brown.edu/studio/item/bdr:419368/ 
► The performance of multithreaded programs is often difficult to understand and predict. Multiple threads use various locking operations, resulting in the parallel execution of some…
(more)
▼ The performance of multithreaded programs is often
difficult to understand and predict. Multiple threads use various
locking operations, resulting in the parallel execution of some
computations and the sequential execution of others. Threads use
hardware resources such as a CPU or a hard drive simultaneously,
which may lead to their saturation. The result is a complex
non-linear dependency between the configuration of a multithreaded
program and its performance. To better understand this dependency a
performance prediction model is used. Such a model predicts the
performance of a system for different configurations.
Configurations reflect variations in the workload,
program options
such as the number of threads, and characteristics of the hardware.
Performance models are complex and require a solid understanding of
the pogram's behavior. As a result, building models of large
applications manually is extremely time-consuming and error-prone.
In this work we present an approach for building performance models
of multithreaded programs automatically. We employ hierarchical
discrete-event models. The higher-level model simulates the data
flow through the
program using the queueing network. The mid-level
model simulates
program's threads using probabilistic call graphs.
The low-level model simulates
program-wide locks and underlying
hardware. We extract information necessary for constructing the
model using a combination of static and dynamic analyses of the
program under study. This includes information about the structure
of the
program, the semantics of interaction between the
program's
threads, and resource demands of individual
program's components.
The discovered information is translated into the discrete-event
model of the
program. In our experiments we successfully generated
performance models of a suite of large multithreaded programs. The
resulting models predicted performance of these programs across a
range of configurations with a reasonable degree of
accuracy.
Advisors/Committee Members: Reiss, Steven (Director), Cetintemel, Ugur (Reader), Fonseca, Rodrigo (Reader), Thereska, Eno (Reader).
Subjects/Keywords: Program analysis
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):
Tarvo, A. (2015). Automated Performance Modeling of Multithreaded
Programs. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:419368/
Chicago Manual of Style (16th Edition):
Tarvo, Alexander. “Automated Performance Modeling of Multithreaded
Programs.” 2015. Doctoral Dissertation, Brown University. Accessed March 05, 2021.
https://repository.library.brown.edu/studio/item/bdr:419368/.
MLA Handbook (7th Edition):
Tarvo, Alexander. “Automated Performance Modeling of Multithreaded
Programs.” 2015. Web. 05 Mar 2021.
Vancouver:
Tarvo A. Automated Performance Modeling of Multithreaded
Programs. [Internet] [Doctoral dissertation]. Brown University; 2015. [cited 2021 Mar 05].
Available from: https://repository.library.brown.edu/studio/item/bdr:419368/.
Council of Science Editors:
Tarvo A. Automated Performance Modeling of Multithreaded
Programs. [Doctoral Dissertation]. Brown University; 2015. Available from: https://repository.library.brown.edu/studio/item/bdr:419368/
University of Waterloo
2.
Kuderski, Jakub.
Scalable Context-Sensitive Pointer Analysis for LLVM.
Degree: 2019, University of Waterloo
URL: http://hdl.handle.net/10012/14875
► Pointer analysis is indispensable for effectively verifying heap-manipulating programs. Even though it has been studied extensively, there are no publicly available pointer analyses for low-level…
(more)
▼ Pointer analysis is indispensable for effectively verifying heap-manipulating programs.
Even though it has been studied extensively, there are no publicly available pointer analyses
for low-level languages that are moderately precise while scalable to large real-world programs.
In this thesis, we show that existing context-sensitive unification-based pointer analyses suffer
from the problem of oversharing – propagating too many abstract objects across the analysis
of different procedures, which prevents them from scaling to large programs.
We present a new pointer analysis for LLVM, called TeaDsa, with such an oversharing
significantly reduced. We show how to further improve precision and speed of TeaDsa
with extra contextual information, such as flow-sensitivity at call- and return-sites, and
type information about memory accesses. We evaluate TeaDsa on the verification problem
of detecting unsafe memory accesses and compare it against two state-of-the-art pointer
analyses: SVF and SeaDsa. We show that TeaDsa is one order of magnitude faster than
either SVF or SeaDsa, strictly more precise than SeaDsa, and, surprisingly, sometimes
more precise than SVF.
Subjects/Keywords: pointer analysis; alias analysis; LLVM; program analysis; program verification; static analysis
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):
Kuderski, J. (2019). Scalable Context-Sensitive Pointer Analysis for LLVM. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14875
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):
Kuderski, Jakub. “Scalable Context-Sensitive Pointer Analysis for LLVM.” 2019. Thesis, University of Waterloo. Accessed March 05, 2021.
http://hdl.handle.net/10012/14875.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kuderski, Jakub. “Scalable Context-Sensitive Pointer Analysis for LLVM.” 2019. Web. 05 Mar 2021.
Vancouver:
Kuderski J. Scalable Context-Sensitive Pointer Analysis for LLVM. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10012/14875.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kuderski J. Scalable Context-Sensitive Pointer Analysis for LLVM. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14875
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
3.
Hirvisalo, Vesa.
Using Static Program Analysis to Compile Fast Cache Simulators.
Degree: 2004, Helsinki University of Technology
URL: http://lib.tkk.fi/Diss/2004/isbn9512270137/
► This thesis presents a generic approach towards compiling fast execution-driven simulators, and applies this to cache simulation of programs. The resulting cache simulation method reduces…
(more)
▼ This thesis presents a generic approach towards compiling fast execution-driven simulators, and applies this to cache simulation of programs. The resulting cache simulation method reduces the time needed for cache performance evaluations without losing the accuracy of the results. Fast cache simulators are needed in the performance analysis of software systems. To properly understand the cache behavior caused by a program, simulations must be performed with a sufficient number of inputs. Traditional simulation of memory operations of a program can be orders of magnitude slower than the execution of the program. This leads to simulation times that are often infeasible in software development. The approach of this thesis is based on using static cache analysis to guide partial evaluation and slicing of simulators. Because of redundancy in memory access patterns of typical programs, an execution-driven cache simulator program can be partially evaluated during its compilation. Program slicing can be used to remove the computations that have no effect on the simulation result. The static cache analysis presented in this thesis is generic. The analysis is designed especially for programs that use dynamic addressing. The thesis assumes an address analysis that gives the cache analysis static information about cache aliases and cache conflicts between accessed memory lines. To determine the memory references that always cause cache hits or cache misses, the thesis describes both must and may analyses of cache states. The cache state analysis is built by using abstract interpretation. Based on the use of abstract interpretation, the soundness of the analysis is proved. The potential performance of the method was experimentally evaluated. The thesis describes both a tool set implementing the cache analysis method and experiments done with the tool set. The experiments indicate that a simple implementation is capable of significantly speeding up the simulations.
Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory of Information Processing Science, ISSN 1239-6885; 41
Advisors/Committee Members: Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory of Information Processing Science.
Subjects/Keywords: static analysis; program analysis; performance analysis; cache simulation; program slicing
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):
Hirvisalo, V. (2004). Using Static Program Analysis to Compile Fast Cache Simulators. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2004/isbn9512270137/
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):
Hirvisalo, Vesa. “Using Static Program Analysis to Compile Fast Cache Simulators.” 2004. Thesis, Helsinki University of Technology. Accessed March 05, 2021.
http://lib.tkk.fi/Diss/2004/isbn9512270137/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Hirvisalo, Vesa. “Using Static Program Analysis to Compile Fast Cache Simulators.” 2004. Web. 05 Mar 2021.
Vancouver:
Hirvisalo V. Using Static Program Analysis to Compile Fast Cache Simulators. [Internet] [Thesis]. Helsinki University of Technology; 2004. [cited 2021 Mar 05].
Available from: http://lib.tkk.fi/Diss/2004/isbn9512270137/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Hirvisalo V. Using Static Program Analysis to Compile Fast Cache Simulators. [Thesis]. Helsinki University of Technology; 2004. Available from: http://lib.tkk.fi/Diss/2004/isbn9512270137/
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
4.
Alden, B. E. P.
An expert system approach to retrograde-analysis.
Degree: PhD, 1985, Open University
URL: http://oro.open.ac.uk/56919/
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.374286
► This thesis presents a system called RETRO, which has the capability of solving a number of retrograde-analysis chess problems of varying degrees of difficulty. Retrograde-analysis…
(more)
▼ This thesis presents a system called RETRO, which has the capability of solving a number of retrograde-analysis chess problems of varying degrees of difficulty. Retrograde-analysis problems are exercises in deductive reasoning, entirely different from conventional 'mate-in-n-moves' chess problems, their nature being such that any type of question, together with perhaps an assortment of associated initial conditions, may be presented to the solver, whilst their solution lies in asking pertinent questions at each step of the deduction process. The aim has been to investigate the extent to which the deduction of past events may direct attention to these questions, a key concept being that of a 'Significant Event' (SE), which is an event of significance that must have occurred at some time in the history of the game. An SE is akin to a frame, the usual slots being replaced by the questions that the SE prompts, to which the answers may either provide a solution to the original problem or point to another SE, together with its association questions. It is shown that a small number of SEs possess widespread application. RETRO maintains an explicit knowledge base of rules, grouped according to function, which are used both by the SEs and the system. This knowledge base is designed for easy amendment. RETRO also maintains an explanation facility, which provides an account of its deductions, including a listing of rules utilised. A number of examples are presented which demonstrate the effectiveness of the SE approach. There is also a discussion as to how the concept may be expanded, and its possible limitations.
Subjects/Keywords: 005; Programme for chess analysis
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):
Alden, B. E. P. (1985). An expert system approach to retrograde-analysis. (Doctoral Dissertation). Open University. Retrieved from http://oro.open.ac.uk/56919/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.374286
Chicago Manual of Style (16th Edition):
Alden, B E P. “An expert system approach to retrograde-analysis.” 1985. Doctoral Dissertation, Open University. Accessed March 05, 2021.
http://oro.open.ac.uk/56919/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.374286.
MLA Handbook (7th Edition):
Alden, B E P. “An expert system approach to retrograde-analysis.” 1985. Web. 05 Mar 2021.
Vancouver:
Alden BEP. An expert system approach to retrograde-analysis. [Internet] [Doctoral dissertation]. Open University; 1985. [cited 2021 Mar 05].
Available from: http://oro.open.ac.uk/56919/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.374286.
Council of Science Editors:
Alden BEP. An expert system approach to retrograde-analysis. [Doctoral Dissertation]. Open University; 1985. Available from: http://oro.open.ac.uk/56919/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.374286
5.
McCarthy, Jay.
Static Analyses of Cryptographic Protocols.
Degree: PhD, Computer Science, 2008, Brown University
URL: https://repository.library.brown.edu/studio/item/bdr:65/
► Most protocol analyses only address security properties. However, other properties are important and can increase our understanding of protocols, as well as aid in the…
(more)
▼ Most protocol analyses only address security
properties. However, other properties are important and can
increase our understanding of protocols, as well as aid in the
deployment and compilation of implementations. We investigate such
analyses. Unfortunately, existing high-level protocol
implementation languages do not accept programs that match the
style used by the protocol design community. These languages are
designed to implement protocol roles independently, not whole
protocols. Therefore, a different
program must be written for each
role. We define a language, WPPL, that avoids this problem. It
avoids the need to create a new tool-chain, however, by compiling
protocol descriptions into an existing, standard role-based
protocol implementation language. Next, we investigate two families
of analyses. The first reveals the implicit design decisions of the
protocol designer and enables fault-tolerance in implementations.
The second characterizes the infinite space of all messages a
protocol role could accept and enables scalability by determining
the session state necessary to support concurrency. Our entire work
is formalized in a mechanical proof checker, the Coq proof
assistant, to ensure its theoretical reliability. Our
implementations are automatically extracted from the formal Coq
theory, so they are guaranteed to implement the
theory.
Advisors/Committee Members: Krishnamurthi, Shriram (director), Guttman, Joshua (reader), Jannotti, John (reader), Lysyanskaya, Anna (reader), Ramsdell, John (reader).
Subjects/Keywords: Program analysis
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):
McCarthy, J. (2008). Static Analyses of Cryptographic Protocols. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:65/
Chicago Manual of Style (16th Edition):
McCarthy, Jay. “Static Analyses of Cryptographic Protocols.” 2008. Doctoral Dissertation, Brown University. Accessed March 05, 2021.
https://repository.library.brown.edu/studio/item/bdr:65/.
MLA Handbook (7th Edition):
McCarthy, Jay. “Static Analyses of Cryptographic Protocols.” 2008. Web. 05 Mar 2021.
Vancouver:
McCarthy J. Static Analyses of Cryptographic Protocols. [Internet] [Doctoral dissertation]. Brown University; 2008. [cited 2021 Mar 05].
Available from: https://repository.library.brown.edu/studio/item/bdr:65/.
Council of Science Editors:
McCarthy J. Static Analyses of Cryptographic Protocols. [Doctoral Dissertation]. Brown University; 2008. Available from: https://repository.library.brown.edu/studio/item/bdr:65/
Georgia Tech
6.
Callan, Robert Locke.
Analyzing software using unintentional electromagnetic emanations from computing devices.
Degree: PhD, Electrical and Computer Engineering, 2016, Georgia Tech
URL: http://hdl.handle.net/1853/56300
► This thesis develops methods to identify, quantify, and use information leaked in Electromagnetic (EM) emanations from a broad range of computing devices in a general…
(more)
▼ This thesis develops methods to identify, quantify, and use information leaked in Electromagnetic (EM) emanations from a broad range of computing devices in a general (i.e. not application specific) way by synthesizing techniques from the fields of electromagnetics, computer architecture, and software engineering. Computers emit EM radiation (emanations) as a side effect of the voltage and current variations required to perform computation. Aside from cryptoanalysis, EM emanations provide information about a system's operation that may be useful in other applications. A number of emerging applications make use of EM emanations to extract new types of information from computing devices. For example, EM emanations can be used to determine or verify the execution path through a
program for
program profiling, debugging, and malware detection. These new applications require a more general approach that can be rapidly and automatically applied to numerous and diverse types of programs and computing devices. This approach requires automatic and systematic identification, quantification, and
analysis of information embedded in EM emanations. Toward this goal, our research has developed (1) a methodology for quantifying the side channel signal created by single instruction differences in a computer programs, (2) a method for identifying existing signals within computing devices which are unintentionally amplitude modulated by
program activity, (3) a method for profiling computer programs via EM emanations with zero hardware and software overhead, and (4) a method for detecting the presence of unknown code during executions of a known computer
program using EM emanations alone at a distance of 3 meters.
Advisors/Committee Members: Zajic, Alenka (advisor), Prvulovic, Milos (committee member), Qureshi, Moinuddin K. (committee member), Krishna, Tushar (committee member), Orso, Alessandro (committee member), Beyah, Raheem (committee member).
Subjects/Keywords: Electromagnetic emanations; Program analysis
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):
Callan, R. L. (2016). Analyzing software using unintentional electromagnetic emanations from computing devices. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/56300
Chicago Manual of Style (16th Edition):
Callan, Robert Locke. “Analyzing software using unintentional electromagnetic emanations from computing devices.” 2016. Doctoral Dissertation, Georgia Tech. Accessed March 05, 2021.
http://hdl.handle.net/1853/56300.
MLA Handbook (7th Edition):
Callan, Robert Locke. “Analyzing software using unintentional electromagnetic emanations from computing devices.” 2016. Web. 05 Mar 2021.
Vancouver:
Callan RL. Analyzing software using unintentional electromagnetic emanations from computing devices. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/1853/56300.
Council of Science Editors:
Callan RL. Analyzing software using unintentional electromagnetic emanations from computing devices. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/56300
Georgia Tech
7.
Kulkarni, Sulekha Raghavendra.
Accelerating program analyses by cross-program training.
Degree: MS, Computer Science, 2016, Georgia Tech
URL: http://hdl.handle.net/1853/56359
► Practical programs share large modules of code. However, many program analyses are ineffective at reusing analysis results for shared code across programs. We present POLYMER,…
(more)
▼ Practical programs share large modules of code. However, many
program analyses are ineffective at reusing
analysis results for shared code across programs. We present POLYMER, an
analysis optimizer to address this problem. POLYMER runs the
analysis offline on a corpus of training programs and learns
analysis facts over shared code. It prunes the learnt facts to eliminate intermediate computations and then reuses these pruned facts to accelerate the
analysis of other programs that share code with the training corpus. We have implemented POLYMER to accelerate analyses specified in Datalog, and apply it to optimize two analyses for Java programs: a call-graph
analysis that is flow- and context-insensitive, and a points-to
analysis that is flow- and context-sensitive. We evaluate the resulting analyses on ten programs from the DaCapo suite that share the JDK library. POLYMER achieves average speedups of 2.6x for the call-graph
analysis and 5.2x for the points-to
analysis.
Advisors/Committee Members: Naik, Mayur H. (advisor), Orso, Alessandro (committee member), Pande, Santosh (committee member).
Subjects/Keywords: Program analysis; Optimization; Datalog
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):
Kulkarni, S. R. (2016). Accelerating program analyses by cross-program training. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/56359
Chicago Manual of Style (16th Edition):
Kulkarni, Sulekha Raghavendra. “Accelerating program analyses by cross-program training.” 2016. Masters Thesis, Georgia Tech. Accessed March 05, 2021.
http://hdl.handle.net/1853/56359.
MLA Handbook (7th Edition):
Kulkarni, Sulekha Raghavendra. “Accelerating program analyses by cross-program training.” 2016. Web. 05 Mar 2021.
Vancouver:
Kulkarni SR. Accelerating program analyses by cross-program training. [Internet] [Masters thesis]. Georgia Tech; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/1853/56359.
Council of Science Editors:
Kulkarni SR. Accelerating program analyses by cross-program training. [Masters Thesis]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/56359
Virginia Tech
8.
Williamson, Eric Robert.
Hybrid Analysis Tools for Computer Systems Education.
Degree: MS, Computer Science and Applications, 2018, Virginia Tech
URL: http://hdl.handle.net/10919/83894
► To learn about computer operating systems, students at Virginia Tech implement a command-line shell in their Computer Systems course. Successfully implementing the shell requires a…
(more)
▼ To learn about computer operating systems, students at Virginia Tech implement a command-line shell in their Computer Systems course. Successfully implementing the shell requires a deep understanding of operating system abstractions and interactions. Students often struggle with the project because subtle errors can take hours to debug.
In this work, we developed two hybrid domain-specific
analysis tools to pinpoint the root causes of student errors: EshMD and ShellTrace. The EshMD tool models common errors in the shell and checks the student code against those models. To accomplish this, it monitors the specific calls the
program is making and correlates those with expected changes in its environment. Students' errors are shown directly in the source code. The concept of EshMD can be applied to other programming projects by observing and modeling common bugs during implementation.
The ShellTrace tool dynamically creates a specification from a reference solution based on how the reference solution makes use of operating system resources and then uses this specification to check that a student solution is functionally identical. The ShellTrace concept can be applied to other programs that exhibit similar resource dependencies.
We deployed these tools in an undergraduate computer systems class and evaluated our tools based on the number of bugs detected and the students' perceptions of usefulness. We found that the tools detected a significant number of bugs and that the majority of students that made use of the tools found them valuable in debugging their submissions.
Advisors/Committee Members: Back, Godmar Volker (committeechair), Butt, Ali (committee member), Lee, Dongyoon (committee member).
Subjects/Keywords: CS Education; Program Analysis; Tools
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):
Williamson, E. R. (2018). Hybrid Analysis Tools for Computer Systems Education. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/83894
Chicago Manual of Style (16th Edition):
Williamson, Eric Robert. “Hybrid Analysis Tools for Computer Systems Education.” 2018. Masters Thesis, Virginia Tech. Accessed March 05, 2021.
http://hdl.handle.net/10919/83894.
MLA Handbook (7th Edition):
Williamson, Eric Robert. “Hybrid Analysis Tools for Computer Systems Education.” 2018. Web. 05 Mar 2021.
Vancouver:
Williamson ER. Hybrid Analysis Tools for Computer Systems Education. [Internet] [Masters thesis]. Virginia Tech; 2018. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10919/83894.
Council of Science Editors:
Williamson ER. Hybrid Analysis Tools for Computer Systems Education. [Masters Thesis]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/83894
University of Alberta
9.
Thiessen, Rei.
Expression data flow graph: precise flow-sensitive pointer
analysis for C programs.
Degree: MS, Department of Computing Science, 2011, University of Alberta
URL: https://era.library.ualberta.ca/files/2v23vt39w
► Pointer analysis is a program analysis that determines the memory locations pointed to by individual pointers. Imprecise pointer information is a major impediment to data-flow…
(more)
▼ Pointer analysis is a program analysis that determines
the memory locations pointed to by individual pointers. Imprecise
pointer information is a major impediment to data-flow analyses and
back-end optimizations that depend on pointer information. Most
pointer analyses are based on a points-to abstraction, which is an
abstraction of memory that partitions the conceptually infinite
number of memory locations into a finite number of abstract
objects. In a flow-sensitive pointer-analysis, a points-to
relationship between abstract objects is computed at each program
point. Our pointer analysis is based on another abstraction called
the Expression Data Flow graph, which expresses the memory
dependencies between expressions that appear in a program. This
abstraction represents pointer information in a more compact and
more precise way than a points-to abstraction. We present a
flow-sensitive and field-sensitive algorithm that computes a
precise Expression Data Flow graph of a program in a negligible
amount of time.
Subjects/Keywords: Alias analysis; Points-to analysis; Flow-sensitive; Pointer analysis; Program analysis
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):
Thiessen, R. (2011). Expression data flow graph: precise flow-sensitive pointer
analysis for C programs. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/2v23vt39w
Chicago Manual of Style (16th Edition):
Thiessen, Rei. “Expression data flow graph: precise flow-sensitive pointer
analysis for C programs.” 2011. Masters Thesis, University of Alberta. Accessed March 05, 2021.
https://era.library.ualberta.ca/files/2v23vt39w.
MLA Handbook (7th Edition):
Thiessen, Rei. “Expression data flow graph: precise flow-sensitive pointer
analysis for C programs.” 2011. Web. 05 Mar 2021.
Vancouver:
Thiessen R. Expression data flow graph: precise flow-sensitive pointer
analysis for C programs. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2021 Mar 05].
Available from: https://era.library.ualberta.ca/files/2v23vt39w.
Council of Science Editors:
Thiessen R. Expression data flow graph: precise flow-sensitive pointer
analysis for C programs. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/2v23vt39w
McMaster University
10.
Chen, Wen.
A Hybrid Software Change Impact Analysis for Large-scale Enterprise Systems.
Degree: PhD, 2015, McMaster University
URL: http://hdl.handle.net/11375/18275
► This work is concerned with analysing the potential impact of direct changes to large- scale enterprise systems, and, in particular, how to minimise testing efforts…
(more)
▼ This work is concerned with analysing the potential impact of direct changes to large- scale enterprise systems, and, in particular, how to minimise testing efforts on such changes. A typical enterprise system may consist of hundreds of thousands of classes and millions of methods. Thus, it is extremely costly and difficult to apply conventional testing techniques to such a system. Retesting everything after a change is very expensive, and in practice generally not necessary. Selective testing can be more effective. However, it requires a deep understanding of the target system and a lack of that understanding can lead to insufficient test coverage. Change Impact
Analysis can be used to estimate the impacts of the changes to be applied, providing developers/testers with confidence in selecting necessary tests and identifying untested entities. Conventional change impact
analysis approaches include static
analysis, dynamic
analysis or a hybrid of the two analyses. They have proved to be useful on small or medium size programs, providing users an inside view of the system within an acceptable running time. However, when it comes to large-scale enterprise systems, the sizes of the programs are orders of magnitude larger. Conventional approaches often run into resource problems such as insufficient memory and/or unacceptable running time (up to weeks). More critically, a large number of false-negatives and false-positives can be generated from those approaches.In this work, a conservative static
analysis with the capability of dealing with inheritance was conducted on an enterprise system and associated changes to obtain all the potential impacts. Later an aspect-based dynamic
analysis was used to instrument the system and collect a set of dynamic impacts at run-time. We are careful not to discard impacts unless we can show that they are definitely not impacted by the change. Reachability
analysis examines the
program to see “Whether a given path in a
program representation corresponds to a possible execution path”. In other words, we employ reachability
analysis to eliminate infeasible paths (i.e., miss-matched calls and returns) that are identified in the control-flow of the
program. Furthermore, in the phase of alias
analysis, we aim at identifying paths that are feasible but cannot be affected by the direct changes to the system, by searching a set of possible pairs of accesses that may be aliased at each
program point of interest.
Our contributions are, we designed a hybrid approach that combines static anal- ysis and dynamic
analysis with reachability
analysis and alias/pointer
analysis, it can be used to (1) solve the scalability problem on large-scale systems, (2) reduce false-positives and not introduce false-negatives, (3) extract both direct and indirect changes, and (4) identify impacts even before making the changes. Using our approach, organizations can focus on a much smaller, relevant subset of the overall test suite instead of blindly doing their entire suite of tests. Also it enables testers to augment…
Advisors/Committee Members: Wassyng, Alan, Maibaum, Tom, Computing and Software.
Subjects/Keywords: software impact analysis; static analysis; dynamic analysis; reachability analysis; alias analysis; program analysis
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):
Chen, W. (2015). A Hybrid Software Change Impact Analysis for Large-scale Enterprise Systems. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/18275
Chicago Manual of Style (16th Edition):
Chen, Wen. “A Hybrid Software Change Impact Analysis for Large-scale Enterprise Systems.” 2015. Doctoral Dissertation, McMaster University. Accessed March 05, 2021.
http://hdl.handle.net/11375/18275.
MLA Handbook (7th Edition):
Chen, Wen. “A Hybrid Software Change Impact Analysis for Large-scale Enterprise Systems.” 2015. Web. 05 Mar 2021.
Vancouver:
Chen W. A Hybrid Software Change Impact Analysis for Large-scale Enterprise Systems. [Internet] [Doctoral dissertation]. McMaster University; 2015. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/11375/18275.
Council of Science Editors:
Chen W. A Hybrid Software Change Impact Analysis for Large-scale Enterprise Systems. [Doctoral Dissertation]. McMaster University; 2015. Available from: http://hdl.handle.net/11375/18275
11.
Wu, Tong.
La relativisation prénominale : Prenominal Relative Clause.
Degree: Docteur es, Sciences du langage, 2011, Université Sorbonne Nouvelle – Paris III
URL: http://www.theses.fr/2011PA030210
► Notre étude porte sur la proposition relative prénominale (Prpré), dans le cadre de la typologique et du modèle minimaliste de la grammaire générative. Le premier…
(more)
▼ Notre étude porte sur la proposition relative prénominale (Prpré), dans le cadre de la typologique et du modèle minimaliste de la grammaire générative. Le premier chapitre pose pour objets principaux de définir la proposition relaive (PR) et d’établir trois typologies concernant la PR. Le deuxième chapitre spécifie la PRpré et les langues à PRpré. Nous restreindrons notre étude aux langues à PRpré première. Nous resituons ces langues dans leur répartition géographique et leur affiliation linguistique pour montrer que les facteurs géographiques et génériques ne peuvent pas rendre compte de la PRpré. Le troisième chapitre expose en détail les analyses théoriques générativistes sur la PR et rend compte de la possibilité de les intégrer dans le programme minimaliste. Le quatrième chapitre est consacré, dans la première partie, à analyser la PRpré dans une perspective minimaliste suivant Kayne (1994). Nous tentons de proposer des dérivations permettant de linéariser correctement les éléments suivants dans le SD de la PRpré : article défini, démonstratif, PR, relativiseur et nom tête. Le syntagme [SD SDem [D° [SC SN [C° [SI tSN]]]]] sert de base pour les différentes dérivations générant les 16 linéarités des éléments dans SD repérées dans les langues à PRpré. Ensuite, nous analysons les effets de reconstruction en suivant Bianchi (2004). Nous adopterons l’idée de "case-stacking" de Pesetsky (2009a et 2009b) pour le conflit casuel/Casuel et aussi pour le trou syntaxique et l’idée de Boeckx (2003) pour le pronom résomptif. Dans la deuxième section, nous présenterons l’analyse de Cinque (2003/8) pour la PRpré. Le cinquième chapitre expose les caractéristiques typologiques non-intrinsèques de la PRpré.
This study concerns the prenominal relative clause in the framework of typology and of the Minimalist model of Generative Grammar. The first chapter defines the relative clause and establishes three typologies on relative clauses. The second chapter specifies what are "prenominal relative clause" and "primary prenominal relative clause languages". These languages are presented according to their geographic distribution and linguistic affiliation, but the geographic and genetic factors cannot analyze properly the prenominal relative clause, because it can be better analyzed according to its typological properties. The third chapter exposes in detail the generative analyses on relative clauses, i.e. Head External Analysis, Head Raising Analysis and Matching Analysis, and discusses how they can be integrated into the Minimalist Program. The fourth chapter analyzes the prenominal relative clause in the Minimalist framework according to Kayne (1994). It is shown how the following elements in the DP of the prenominal relative clause can be correctly linearized, i.e. definite article, demonstrative, relative clause, relativizer and head noun. The basic structure is [DP DemP [D° [CP NP [C° [IP tNP]]]]]. It can derive the 16 linear orders found in prenominal relative clause languages. The reconstruction effect is analyzed according to…
Advisors/Committee Members: Rebuschi, Georges (thesis director), Vries, Mark de (thesis director).
Subjects/Keywords: Proposition relative prénominale; Programme minimaliste; Analyse de la Montée de Tête; Hypothèse de SD; Spécifieurs multiples; Prenominal relative clause; Minimalist Program; Head Raising Analysis; DP-Hypothesis; Multiple specifier; 400.1
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):
Wu, T. (2011). La relativisation prénominale : Prenominal Relative Clause. (Doctoral Dissertation). Université Sorbonne Nouvelle – Paris III. Retrieved from http://www.theses.fr/2011PA030210
Chicago Manual of Style (16th Edition):
Wu, Tong. “La relativisation prénominale : Prenominal Relative Clause.” 2011. Doctoral Dissertation, Université Sorbonne Nouvelle – Paris III. Accessed March 05, 2021.
http://www.theses.fr/2011PA030210.
MLA Handbook (7th Edition):
Wu, Tong. “La relativisation prénominale : Prenominal Relative Clause.” 2011. Web. 05 Mar 2021.
Vancouver:
Wu T. La relativisation prénominale : Prenominal Relative Clause. [Internet] [Doctoral dissertation]. Université Sorbonne Nouvelle – Paris III; 2011. [cited 2021 Mar 05].
Available from: http://www.theses.fr/2011PA030210.
Council of Science Editors:
Wu T. La relativisation prénominale : Prenominal Relative Clause. [Doctoral Dissertation]. Université Sorbonne Nouvelle – Paris III; 2011. Available from: http://www.theses.fr/2011PA030210
12.
Cohen, Joël.
Deux résultats d'analyse harmonique sur un groupe P-adique tordu : Two results of Harmonic Anlysis on a twisted p-adic group.
Degree: Docteur es, Mathématiques, 2013, Aix Marseille Université
URL: http://www.theses.fr/2013AIXM4088
► Dans cette thèse, nous montrons deux résultats d'analyse harmonique sur un groupe réductif p-adique tordu.Le premier résultat est un analogue non connexe au théorème matriciel…
(more)
▼ Dans cette thèse, nous montrons deux résultats d'analyse harmonique sur un groupe réductif p-adique tordu.Le premier résultat est un analogue non connexe au théorème matriciel de Paley Wiener. Soit G réductif p-adique (non nécessairement connexe). L'algèbre de Hecke des fonctions complexes sur G localement constantes à support compact agit les représentations complexe lisses irréductibles de G. L'action d'une fonction est vue comme sa transformée de Fourier. Le théorème fournit une caractérisation de l'image de l'algèbre de Hecke par la transformée de Fourier, ainsi qu'une formule d'inversion.Le second résultat établit une identité spectrale sur le groupe GLn tordu (avec n pair, sur un corps p-adique) pour l'intégrale orbitale tordue sur la classe de conjugaison tordue stable des matrices antisymétriques inversibles. Cette dernière s'exprime comme une intégrale sur les représentations irréductibles tempérées auto-duales de GLn dont le paramètre de Langlands est symplectique. La preuve repose sur le transfert endoscopique.
In this thesis, we show tow results of Harmonic Analysis on réductive p-adic group.The first results extends the matrix Paley-Wiener theorem to the non-connected case. Let G be reductive (non necessarily connected) p-adic group. The Hecke algebra of compactly supported locally constant complex functions on G acts on complex smooth irreducible representations of G. The action of a given function is seen as its Fourier transform. The theorem characterizes the image of the Hecke algebra under the Fourier transform and provides an inversion formula.The second result is the proof of a spectral identity on the so-called twisted GLn group (where n is even, on a p-adic field) for the twisted orbital integral over the twisted stable conjugacy class of antisymetric invertible matrices. We express it as an integral over those irreducible tempered auto-dual representations of GLn whose Langlands' parameter is symplectic. Our proof uses endoscopic transfer.
Advisors/Committee Members: Heiermann, Volker (thesis director).
Subjects/Keywords: Mathématiques; Analyse Harmonique p-adique; Théorie des Représentations; Groupes tordus; Programme de Langlands; Endoscopie; Mathematics; P-adic Harmonic analysis; Representation Theory; Twisted groups; Langlands program; Endoscopy; 510
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):
Cohen, J. (2013). Deux résultats d'analyse harmonique sur un groupe P-adique tordu : Two results of Harmonic Anlysis on a twisted p-adic group. (Doctoral Dissertation). Aix Marseille Université. Retrieved from http://www.theses.fr/2013AIXM4088
Chicago Manual of Style (16th Edition):
Cohen, Joël. “Deux résultats d'analyse harmonique sur un groupe P-adique tordu : Two results of Harmonic Anlysis on a twisted p-adic group.” 2013. Doctoral Dissertation, Aix Marseille Université. Accessed March 05, 2021.
http://www.theses.fr/2013AIXM4088.
MLA Handbook (7th Edition):
Cohen, Joël. “Deux résultats d'analyse harmonique sur un groupe P-adique tordu : Two results of Harmonic Anlysis on a twisted p-adic group.” 2013. Web. 05 Mar 2021.
Vancouver:
Cohen J. Deux résultats d'analyse harmonique sur un groupe P-adique tordu : Two results of Harmonic Anlysis on a twisted p-adic group. [Internet] [Doctoral dissertation]. Aix Marseille Université 2013. [cited 2021 Mar 05].
Available from: http://www.theses.fr/2013AIXM4088.
Council of Science Editors:
Cohen J. Deux résultats d'analyse harmonique sur un groupe P-adique tordu : Two results of Harmonic Anlysis on a twisted p-adic group. [Doctoral Dissertation]. Aix Marseille Université 2013. Available from: http://www.theses.fr/2013AIXM4088
Université de Grenoble
13.
Pietrek, Artur.
TIREX : une représentation textuelle intermédiaire pour un environnement d'exécution virtuel, échanger des informations du compilateur et d'analyse du programme : TIREX : A textual target-level intermediate representation for virtual execution environment, compiler information exchange and program analysis.
Degree: Docteur es, Informatique, 2012, Université de Grenoble
URL: http://www.theses.fr/2012GRENM046
► Certains environnements ont besoin de plusieurs compilateurs, par exemple un pour le système d'exploitation, supportant la norme C/C++ complète, et l'autre pour les applications, qui…
(more)
▼ Certains environnements ont besoin de plusieurs compilateurs, par exemple un pour le système d'exploitation, supportant la norme C/C++ complète, et l'autre pour les applications, qui supporte éventuellement un sous-ensemble de la norme, mais capable de fournir plus de performance. Le maintien de plusieurs compilateurs pour une plateforme cible représente un effort considérable. Il est donc plus facile d'implémenter et de maintenir un seul outil responsable des optimisations particulières au processeur ciblé. Il nous faut alors un moyen de relier ces compilateurs à l'optimiseur, de préférence, en gardant au passage certaines structures de données internes aux compilateurs qui, soit prendraient du temps, soit seraient impossible à reconstruire à partir du code assembleur par exemple. Dans cette thèse, nous introduisons Tirex, une représentation textuelle intermédiaire pour échanger des informations de bas niveau, déjà dépendantes de la cible, entre les compilateurs, les optimiseurs et les autres outils de la chaîne de compilation. Notre représentation contient un flot d'instructions du processeur cible, mais garde également la structure explicite du programme et supporte la forme SSA (Static Single Assignment). Elle est facilement extensible et très flexible, ce qui permet de transmettre toute donnée jugée importante à l'optimiseur. Nous construisons Tirex par extension de MinIR, une représentation intermédiaire elle-même basée sur un encodage YAML des structures du compilateur. Nos extensions de Tirex comprennent: l'abaissement de la représentation au niveau du processeur cible, la conservation du flot de données du programme, ainsi que l'ajout d'informations sur les structures de boucles et les dépendances de données. Nous montrons que Tirex est polyvalent et peut être utilisé dans une variété d'applications différentes, comme par exemple un environnement d'exécution virtuel (VEE),et fournit une base forte pour un environnement d'analyse du programme. Dans le cadre d'un VEE, nous présentons un interprèteur de la forme SSA et un compilateur just-in-time (JIT). Nous montrons comment l'interprétation d'une représentation au niveau du processeur cible élimine la plupart des problèmes liés à l'exécution en mode mixte. Nous explorons également les questions liées à l'interprétation efficace d'une représentation de programme sous la forme SSA.
Some environments require several compilers, for instance one for the operating system, supporting the full C/C++ norm, and one for the applications, potentially supporting less but able to derive more performance. Maintaining different compilers for a target requires considerable effort, thus it is easier to implement and maintain target-dependent optimizations in a single, external tool. This requires a way of connecting these compilers with the target-dependent optimizer, preferably passing along some internal compiler data structures that would be time-consuming, difficult or even impossible to reconstruct from assembly language for instance. In this thesis we introduce Tirex,…
Advisors/Committee Members: Fernandez, Jean-Claude (thesis director).
Subjects/Keywords: Représentation intermédiaire; Compilation; Interpretation SSA; Just-In-Time; Langage de programmation; Analyse du programme; Intermediate representation; Compilation; Interpretation SSA; Just-In-Time; Programming languages; Program analysis
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):
Pietrek, A. (2012). TIREX : une représentation textuelle intermédiaire pour un environnement d'exécution virtuel, échanger des informations du compilateur et d'analyse du programme : TIREX : A textual target-level intermediate representation for virtual execution environment, compiler information exchange and program analysis. (Doctoral Dissertation). Université de Grenoble. Retrieved from http://www.theses.fr/2012GRENM046
Chicago Manual of Style (16th Edition):
Pietrek, Artur. “TIREX : une représentation textuelle intermédiaire pour un environnement d'exécution virtuel, échanger des informations du compilateur et d'analyse du programme : TIREX : A textual target-level intermediate representation for virtual execution environment, compiler information exchange and program analysis.” 2012. Doctoral Dissertation, Université de Grenoble. Accessed March 05, 2021.
http://www.theses.fr/2012GRENM046.
MLA Handbook (7th Edition):
Pietrek, Artur. “TIREX : une représentation textuelle intermédiaire pour un environnement d'exécution virtuel, échanger des informations du compilateur et d'analyse du programme : TIREX : A textual target-level intermediate representation for virtual execution environment, compiler information exchange and program analysis.” 2012. Web. 05 Mar 2021.
Vancouver:
Pietrek A. TIREX : une représentation textuelle intermédiaire pour un environnement d'exécution virtuel, échanger des informations du compilateur et d'analyse du programme : TIREX : A textual target-level intermediate representation for virtual execution environment, compiler information exchange and program analysis. [Internet] [Doctoral dissertation]. Université de Grenoble; 2012. [cited 2021 Mar 05].
Available from: http://www.theses.fr/2012GRENM046.
Council of Science Editors:
Pietrek A. TIREX : une représentation textuelle intermédiaire pour un environnement d'exécution virtuel, échanger des informations du compilateur et d'analyse du programme : TIREX : A textual target-level intermediate representation for virtual execution environment, compiler information exchange and program analysis. [Doctoral Dissertation]. Université de Grenoble; 2012. Available from: http://www.theses.fr/2012GRENM046
14.
Kiepas, Patryk.
Analyses de performances et transformations de code pour les applications MATLAB : Performance analyses and code transformations for MATLAB applications.
Degree: Docteur es, Informatique temps réel, robotique et automatique, 2019, Paris Sciences et Lettres (ComUE)
URL: http://www.theses.fr/2019PSLEM063
► MATLAB est un environnement informatique doté d'un langage de programmation simple et d'une vaste bibliothèque de fonctions couramment utilisées en science et ingénierie (CSE) pour…
(more)
▼ MATLAB est un environnement informatique doté d'un langage de programmation simple et d'une vaste bibliothèque de fonctions couramment utilisées en science et ingénierie (CSE) pour le prototypage rapide. Cependant, certaines caractéristiques de son environnement, comme son langage dynamique ou son style de programmation interactif, affectent la rapidité d'exécution des programmes. Les approches actuelles d'amélioration des programmes MATLAB traduisent le code dans des langages statiques plus rapides comme C ou Fortran, ou bien appliquent systématiquement des transformations de code au programme MATLAB sans considérer leur impact sur les performances. Dans cette thèse, nous comblons cette lacune en développant des techniques d'analyse et de transformation de code des programmes MATLAB afin d'augmenter leur performance. Plus précisément, nous analysons et modélisons le comportement d'un environnement MATLAB black-box uniquement en mesurant l'exécution caractéristique des programmes sur CPU. À partir des données obtenues, nous formalisons un modèle statique qui prédit le type et l'ordonnancement des instructions programmées lors de l'exécution par le compilateur Just-In-Time (JIT). Ce modèle nous permet de proposer plusieurs transformations de code qui améliorent les performances des programmes MATLAB en influençant la façon dont le compilateur JIT génère le code machine. Les résultats obtenus démontrent les avantages pratiques de la méthodologie présentée.
MATLAB is a computing environment with an easy programming language and a vast library of functions commonly used in Computation Science and Engineering (CSE) for fast prototyping. However, some features of its environment, such as its dynamic language or interactive style of programming affect how fast the programs can execute. Current approaches to improve MATLAB programs either translate the code to faster static languages like C or Fortran, or apply code transformations to MATLAB code systematically without considering their impact on the performance. In this thesis, we fill this gap by developing techniques for the analysis and codetransformation of MATLAB programs in order to improve their performance. More precisely, we analyse and model the behaviour of the black-box MATLAB environment by measuring the execution characteristics of programs on CPU. From the resulting data, we formalise a static model which predicts the type and order of instructions scheduled by the Just-In-Time (JIT)compiler. This model allows us to propose several code transformations which increase the performance of MATLAB programs by influencing how the JIT compiler generates the machine code. The obtained results demonstrate the practical benefits of the presented methodology.
Advisors/Committee Members: Tadonki, Claude (thesis director), Kozlak, Jaroslaw (thesis director), Ancourt, Corinne (thesis director).
Subjects/Keywords: Optimisation du programme; Analyse de performance; Compteurs de performance; MATLAB; Modèle d'exécution; Transformation de code; Program optimisation; Performance analysis; Performance counters; MATLAB; Execution model; Code transformation; 005.13
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):
Kiepas, P. (2019). Analyses de performances et transformations de code pour les applications MATLAB : Performance analyses and code transformations for MATLAB applications. (Doctoral Dissertation). Paris Sciences et Lettres (ComUE). Retrieved from http://www.theses.fr/2019PSLEM063
Chicago Manual of Style (16th Edition):
Kiepas, Patryk. “Analyses de performances et transformations de code pour les applications MATLAB : Performance analyses and code transformations for MATLAB applications.” 2019. Doctoral Dissertation, Paris Sciences et Lettres (ComUE). Accessed March 05, 2021.
http://www.theses.fr/2019PSLEM063.
MLA Handbook (7th Edition):
Kiepas, Patryk. “Analyses de performances et transformations de code pour les applications MATLAB : Performance analyses and code transformations for MATLAB applications.” 2019. Web. 05 Mar 2021.
Vancouver:
Kiepas P. Analyses de performances et transformations de code pour les applications MATLAB : Performance analyses and code transformations for MATLAB applications. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres (ComUE); 2019. [cited 2021 Mar 05].
Available from: http://www.theses.fr/2019PSLEM063.
Council of Science Editors:
Kiepas P. Analyses de performances et transformations de code pour les applications MATLAB : Performance analyses and code transformations for MATLAB applications. [Doctoral Dissertation]. Paris Sciences et Lettres (ComUE); 2019. Available from: http://www.theses.fr/2019PSLEM063
Universiteit Utrecht
15.
Hulshof, L.P.
Gatekeepers in Innovation Networks. Who are the gatekeepers in innovation networks of the
German biotechnology sector?.
Degree: 2012, Universiteit Utrecht
URL: http://dspace.library.uu.nl:8080/handle/1874/256346
► In this study, the process of innovation through knowledge transfer is investigated by identifying gatekeepers in cognitive innovation networks in the biotech industry in Germany,…
(more)
▼ In this study, the process of innovation through knowledge transfer is investigated by identifying gatekeepers in cognitive innovation networks in the biotech industry in Germany, using network
analysis on records from an unprecedented combination of subsidy programs of the European Commission (FP6) and the federal German government. The results indicate that geographical distance between organizations does not act as a boundary for collaboration between the organizations that take part in these subsidy programs: Most actors are well connected beyond their own region. The gatekeepers are organizations that play an important role in connecting all organizations of the cognitive network. All gatekeepers are found to be organizations with a public mission (universities or research organizations), most gatekeepers are very active in the subsidy programs, taking part in many different collaborative projects, but the decisive characteristics of gatekeepers have yet to be discovered. Government and private organizations may utilize these conclusions in fine-tuning innovation (stimulation) policies and strategies.
Advisors/Committee Members: Morrison, Andrea, Broekel, Tom.
Subjects/Keywords: Geowetenschappen; Gatekeepers, Innovation Networks, Network Analysis, Knowledge Transfer, Innovation Policy, Germany, Framework Programme, Subsidy Networks
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):
Hulshof, L. P. (2012). Gatekeepers in Innovation Networks. Who are the gatekeepers in innovation networks of the
German biotechnology sector?. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/256346
Chicago Manual of Style (16th Edition):
Hulshof, L P. “Gatekeepers in Innovation Networks. Who are the gatekeepers in innovation networks of the
German biotechnology sector?.” 2012. Masters Thesis, Universiteit Utrecht. Accessed March 05, 2021.
http://dspace.library.uu.nl:8080/handle/1874/256346.
MLA Handbook (7th Edition):
Hulshof, L P. “Gatekeepers in Innovation Networks. Who are the gatekeepers in innovation networks of the
German biotechnology sector?.” 2012. Web. 05 Mar 2021.
Vancouver:
Hulshof LP. Gatekeepers in Innovation Networks. Who are the gatekeepers in innovation networks of the
German biotechnology sector?. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2021 Mar 05].
Available from: http://dspace.library.uu.nl:8080/handle/1874/256346.
Council of Science Editors:
Hulshof LP. Gatekeepers in Innovation Networks. Who are the gatekeepers in innovation networks of the
German biotechnology sector?. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/256346
Universidade Federal de Viçosa
16.
Cláudia Valéria Távora Cabral.
Análise de dimensionamento estocástico e determinístico de sistemas fotovoltaicos isolados.
Degree: 2006, Universidade Federal de Viçosa
URL: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=425
► This paper presents the photovoltaic systems modeling (photovoltaic generators and batteries) and a new methodology for the sizing of stand-alone photovoltaic systems using a stochastic…
(more)
▼ This paper presents the photovoltaic systems modeling (photovoltaic generators and batteries) and a new methodology for the sizing of stand-alone photovoltaic systems using a stochastic method, comparing it to the existing deterministic methods. Softwares were developed for the stochastic and deterministic sizings, the probabilistic one being composed of four parts. The first part involves the data synthetic generation of hourly solar irradiance from monthly average daily data; the second part corresponds to the estimate of the Beta probability density function for the estimation of the output average power of photovoltaic modules. The third part corresponds to the calculation of the system reliability, that is to say, the Loss of Power Supply Probability (LPSP), and the fourth, to the calculation of the number of modules and batteries that make the system more economically viable, based on the chosen reliability and simulation. The standard chosen for the working up of the deterministic sizing software was that of Sandia (Sandia National Laboratories), because it is the most widespread nowadays, including that it is the one adopted by Companhia Energética de Minas Gerais. For the stochastic sizing, the European standard (Universal Technical Standard for Solar Home Systems) was also analysed. Database containing technical information on modules and batteries was developed. By means of the simulations and sizing analysis, it was proved that the optimized performance of the whole photovoltaic system is closely related to its sizing. The comparison between the stochastic and deterministic methodologies proved that the proposed probabilistic method presents innumerable advantages when compared to the other ones analysed. One concludes that the stochastic method is the most indicated for sizing a stand-alone photovoltaic system, as long as there is availability of metereologic data and load, this sizing being closer to real and more reliable.
Este trabalho apresenta a modelagem de componentes de sistemas fotovoltaicos (geradores fotovoltaicos e baterias) e uma nova metodologia para o dimensionamento de sistemas fotovoltaicos isolados utilizando um método estocástico, comparando-o com métodos determinísticos existentes. Foram desenvolvidos programas computacionais para os dimensionamentos estocástico e determinístico, sendo o probabilístico composto por quatro partes. A primeira parte envolve a geração sintética de dados de irradiância solar horária a partir de dados diários médios mensais; a segunda parte corresponde à estimativa da função densidade de probabilidade Beta para estimação da potência média de saída dos módulos fotovoltaicos. A terceira parte corresponde ao cálculo da confiabilidade do sistema, ou seja, da probabilidade de perda de fornecimento de energia à carga (LPSP), e a quarta, ao cálculo do número de módulos e baterias que tornam o sistema mais viável economicamente, baseado na confiabilidade escolhida e na simulação. O procedimento escolhido para elaboração do programa de dimensionamento…
Advisors/Committee Members: Delly Oliveira Filho, Paulo Marcos de Barros Monteiro, Antônia Sônia Alves Cardoso Diniz, Aristides Ribeiro, Heleno do Nascimento Santos.
Subjects/Keywords: Dimensionamento; Sistemas voltaicos; Programa computacional; ENERGIZACAO RURAL; Sizing analysis; Photovoltaic systems; Computer programme
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):
Cabral, C. V. T. (2006). Análise de dimensionamento estocástico e determinístico de sistemas fotovoltaicos isolados. (Thesis). Universidade Federal de Viçosa. Retrieved from http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=425
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):
Cabral, Cláudia Valéria Távora. “Análise de dimensionamento estocástico e determinístico de sistemas fotovoltaicos isolados.” 2006. Thesis, Universidade Federal de Viçosa. Accessed March 05, 2021.
http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=425.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Cabral, Cláudia Valéria Távora. “Análise de dimensionamento estocástico e determinístico de sistemas fotovoltaicos isolados.” 2006. Web. 05 Mar 2021.
Vancouver:
Cabral CVT. Análise de dimensionamento estocástico e determinístico de sistemas fotovoltaicos isolados. [Internet] [Thesis]. Universidade Federal de Viçosa; 2006. [cited 2021 Mar 05].
Available from: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=425.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Cabral CVT. Análise de dimensionamento estocástico e determinístico de sistemas fotovoltaicos isolados. [Thesis]. Universidade Federal de Viçosa; 2006. Available from: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=425
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Victoria University of Wellington
17.
Grams, Mark.
Active Investment: Evaluating the Benefits and Costs of Investing in Active Travel in the Urban New Zealand Context.
Degree: 2015, Victoria University of Wellington
URL: http://hdl.handle.net/10063/8760
► Increased uptake of active travel is widely acknowledged to promote improved health, environmental and community outcomes. Although active travel participation rates in New Zealand compare…
(more)
▼ Increased uptake of active travel is widely acknowledged to promote improved health, environmental and community outcomes. Although active travel participation rates in New Zealand compare favourably to other Anglo-Saxon countries, many northern European countries report active travel rates that are many fold higher.
In response to declining rates of active travel across New Zealand, the New Zealand Transport Agency created the Model Communities Programme. The goal of this programme was to boost walking and cycling rates in two demonstration cities, Hastings and New Plymouth, by improving walking and cycling infrastructure, as well as funding promotional and educational initiatives.
This study evaluates the effectiveness of the Model Communities Programme. This evaluation includes a quantitative appraisal in the form of a cost-benefit
analysis. In addition to evaluating the economic efficiency of the programme, this study provides qualitative
analysis derived from user intercept surveys and interviews with district council project managers to further assess the effectiveness of the intervention.
This study has found the Model Communities Programme to be cost-beneficial under several evaluative frameworks. In addition to this, the qualitative
analysis has also presented largely positive feedback from both users and project managers. This study concludes that the Model Communities Programme has indeed boosted active travel in the demonstration cities, and that similar interventions are likely to be effective at promoting active travel across urban New Zealand.
Advisors/Committee Members: Chapman, Ralph.
Subjects/Keywords: Active travel; Cost-benefit analysis; Model Communities Programme; Walking; Cycling; Economic evaluation
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):
Grams, M. (2015). Active Investment: Evaluating the Benefits and Costs of Investing in Active Travel in the Urban New Zealand Context. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/8760
Chicago Manual of Style (16th Edition):
Grams, Mark. “Active Investment: Evaluating the Benefits and Costs of Investing in Active Travel in the Urban New Zealand Context.” 2015. Masters Thesis, Victoria University of Wellington. Accessed March 05, 2021.
http://hdl.handle.net/10063/8760.
MLA Handbook (7th Edition):
Grams, Mark. “Active Investment: Evaluating the Benefits and Costs of Investing in Active Travel in the Urban New Zealand Context.” 2015. Web. 05 Mar 2021.
Vancouver:
Grams M. Active Investment: Evaluating the Benefits and Costs of Investing in Active Travel in the Urban New Zealand Context. [Internet] [Masters thesis]. Victoria University of Wellington; 2015. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10063/8760.
Council of Science Editors:
Grams M. Active Investment: Evaluating the Benefits and Costs of Investing in Active Travel in the Urban New Zealand Context. [Masters Thesis]. Victoria University of Wellington; 2015. Available from: http://hdl.handle.net/10063/8760
University of Toronto
18.
Wong, Michelle Yan Yi.
Targeted Dynamic Analysis for Android Malware.
Degree: 2015, University of Toronto
URL: http://hdl.handle.net/1807/69183
► The identification and analysis of Android malware involves either static or dynamic program analysis of the malware binary. While static analysis has good code coverage,…
(more)
▼ The identification and analysis of Android malware involves either static or dynamic program analysis of the malware binary. While static analysis has good code coverage, it is not as precise due to the lack of run-time information. In contrast, because Android malware is often bundled with applications that have legitimate functionality, dynamic analysis can take a long time to find and analyze the small amount of code implementing the malicious functionality. We propose IntelliDroid, a tool that combines the advantages of both static and dynamic analyses to efficiently analyze suspicious behavior in Android applications. A lightweight static phase identifies possible malicious behavior and gathers information to generate inputs that can dynamically exercise that behavior. IntelliDroid overcomes several key challenges of analyzing Android malware and when evaluated on 30 instances of malicious behavior, IntelliDroid successfully identifies the behavior, extracts path constraints, and executes the malicious code in all but one case.
M.A.S.
Advisors/Committee Members: Lie, David, Electrical and Computer Engineering.
Subjects/Keywords: android; constraint solving; dynamic analysis; malware; program analysis; static analysis; 0464
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):
Wong, M. Y. Y. (2015). Targeted Dynamic Analysis for Android Malware. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/69183
Chicago Manual of Style (16th Edition):
Wong, Michelle Yan Yi. “Targeted Dynamic Analysis for Android Malware.” 2015. Masters Thesis, University of Toronto. Accessed March 05, 2021.
http://hdl.handle.net/1807/69183.
MLA Handbook (7th Edition):
Wong, Michelle Yan Yi. “Targeted Dynamic Analysis for Android Malware.” 2015. Web. 05 Mar 2021.
Vancouver:
Wong MYY. Targeted Dynamic Analysis for Android Malware. [Internet] [Masters thesis]. University of Toronto; 2015. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/1807/69183.
Council of Science Editors:
Wong MYY. Targeted Dynamic Analysis for Android Malware. [Masters Thesis]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/69183
University of Pretoria
19.
[No author].
The experiences of students participating in an
HIV/AIDS teacher education pilot programme
.
Degree: 2012, University of Pretoria
URL: http://upetd.up.ac.za/thesis/available/etd-12192011-153108/
► The current research study was a qualitative investigation to explore and describe how students, registered for the Education 364 module, experienced the HIV/AIDS teacher education…
(more)
▼ The current research study was a qualitative
investigation to explore and describe how students, registered for
the Education 364 module, experienced the HIV/AIDS teacher
education pilot programme (TEPP), implemented at the University of
Pretoria. The availability of in-depth interview transcriptions, as
raw data, permitted
analysis of existing data from a different
perspective. Transcriptions of a focus group interview and two
individual interviews with Afrikaans students were purposefully
selected and inductively analysed. Two main themes emerged
following the thematic
analysis of interview transcriptions.
Findings indicate that the content of the HIV/AIDS TEPP provided
students with a solid HIV/AIDS-related theoretical basis. Findings
furthermore suggest that the HIV/AIDS TEPP could be adapted for
different levels of knowledge and teaching phases. Appropriate and
sufficient resource materials, in accordance with the explicit
needs of each teaching phase, could be developed. Practical
examples and clear guidelines may be incorporated into HIV/AIDS
programmes to equip teachers to deal with difficult situations. In
addition, sufficient time allocation to and early implementation of
HIV/AIDS programmes seem necessary. The value of a range of
teaching and learning methodologies and the role of HIV/AIDS
programme presenters were emphasised. Since existing teacher
training may not adequately prepare teachers to address HIV/AIDS
challenges, the need for continuous development, lifelong learning
as well as support for teachers were also highlighted. Finally,
findings indicate that engagement in affective and
identity-construction domains may reduce HIV/AIDS fatigue and
encourage students to take on active roles to address
HIV/AIDS-related challenges.
Advisors/Committee Members: Dr K Mohangi (advisor), Prof L Ebersohn (advisor), Prof M Moletsane (advisor).
Subjects/Keywords: Content analysis;
Experiences;
Curriculum development;
Heaids;
Hiv;
Aids;
Pilot programme;
Secondary data;
Teachers training;
Teachers;
Thematic analysis;
UCTD
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):
author], [. (2012). The experiences of students participating in an
HIV/AIDS teacher education pilot programme
. (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-12192011-153108/
Chicago Manual of Style (16th Edition):
author], [No. “The experiences of students participating in an
HIV/AIDS teacher education pilot programme
.” 2012. Masters Thesis, University of Pretoria. Accessed March 05, 2021.
http://upetd.up.ac.za/thesis/available/etd-12192011-153108/.
MLA Handbook (7th Edition):
author], [No. “The experiences of students participating in an
HIV/AIDS teacher education pilot programme
.” 2012. Web. 05 Mar 2021.
Vancouver:
author] [. The experiences of students participating in an
HIV/AIDS teacher education pilot programme
. [Internet] [Masters thesis]. University of Pretoria; 2012. [cited 2021 Mar 05].
Available from: http://upetd.up.ac.za/thesis/available/etd-12192011-153108/.
Council of Science Editors:
author] [. The experiences of students participating in an
HIV/AIDS teacher education pilot programme
. [Masters Thesis]. University of Pretoria; 2012. Available from: http://upetd.up.ac.za/thesis/available/etd-12192011-153108/
University of Pretoria
20.
Jonker, Carine-Mari.
The experiences
of students participating in an HIV/AIDS teacher education pilot
programme.
Degree: Educational Psychology, 2012, University of Pretoria
URL: http://hdl.handle.net/2263/30434
► The current research study was a qualitative investigation to explore and describe how students, registered for the Education 364 module, experienced the HIV/AIDS teacher education…
(more)
▼ The current research study was a qualitative
investigation to explore and describe how students, registered for
the Education 364 module, experienced the HIV/AIDS teacher
education pilot programme (TEPP), implemented at the University of
Pretoria. The availability of in-depth interview transcriptions, as
raw data, permitted
analysis of existing data from a different
perspective. Transcriptions of a focus group interview and two
individual interviews with Afrikaans students were purposefully
selected and inductively analysed. Two main themes emerged
following the thematic
analysis of interview transcriptions.
Findings indicate that the content of the HIV/AIDS TEPP provided
students with a solid HIV/AIDS-related theoretical basis. Findings
furthermore suggest that the HIV/AIDS TEPP could be adapted for
different levels of knowledge and teaching phases. Appropriate and
sufficient resource materials, in accordance with the explicit
needs of each teaching phase, could be developed. Practical
examples and clear guidelines may be incorporated into HIV/AIDS
programmes to equip teachers to deal with difficult situations. In
addition, sufficient time allocation to and early implementation of
HIV/AIDS programmes seem necessary. The value of a range of
teaching and learning methodologies and the role of HIV/AIDS
programme presenters were emphasised. Since existing teacher
training may not adequately prepare teachers to address HIV/AIDS
challenges, the need for continuous development, lifelong learning
as well as support for teachers were also highlighted. Finally,
findings indicate that engagement in affective and
identity-construction domains may reduce HIV/AIDS fatigue and
encourage students to take on active roles to address
HIV/AIDS-related challenges.
Advisors/Committee Members: Dr K Mohangi (advisor), Prof L Ebersohn (advisor), Prof M Moletsane (advisor).
Subjects/Keywords: Content
analysis;
Experiences; Curriculum
development;
Heaids;
Hiv;
Aids; Pilot
programme; Secondary
data; Teachers
training;
Teachers; Thematic
analysis;
UCTD
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):
Jonker, C. (2012). The experiences
of students participating in an HIV/AIDS teacher education pilot
programme. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/30434
Chicago Manual of Style (16th Edition):
Jonker, Carine-Mari. “The experiences
of students participating in an HIV/AIDS teacher education pilot
programme.” 2012. Masters Thesis, University of Pretoria. Accessed March 05, 2021.
http://hdl.handle.net/2263/30434.
MLA Handbook (7th Edition):
Jonker, Carine-Mari. “The experiences
of students participating in an HIV/AIDS teacher education pilot
programme.” 2012. Web. 05 Mar 2021.
Vancouver:
Jonker C. The experiences
of students participating in an HIV/AIDS teacher education pilot
programme. [Internet] [Masters thesis]. University of Pretoria; 2012. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/2263/30434.
Council of Science Editors:
Jonker C. The experiences
of students participating in an HIV/AIDS teacher education pilot
programme. [Masters Thesis]. University of Pretoria; 2012. Available from: http://hdl.handle.net/2263/30434
University of Minnesota
21.
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 05, 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. 05 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 05].
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
University of Waterloo
22.
Fang, Zheng.
Test Clone Detection via Assertion Fingerprints.
Degree: 2014, University of Waterloo
URL: http://hdl.handle.net/10012/8831
► Large software systems require large test suites to achieve high coverage. Test suites often employ closed unit tests that are self-contained and have no input…
(more)
▼ Large software systems require large test suites to achieve high coverage. Test suites often employ closed unit tests that are self-contained and have no input parameters. To achieve acceptable coverage with self-contained unit tests, developers often clone existing tests and reproduce both boilerplate and essential environment setup code as well as assertions. Existing technologies such as parametrized unit tests and theories could mitigate cloning in test suites. These technologies give developers new ways to express refactorings. However, they do not help detect refactorable clones in the
first place, which requires tedious manual effort.
This thesis proposes a novel technique, assertion fingerprints, for detecting clones based on the set of assertion/fail calls in test methods. Assertion fingerprints encode the control flow around the ordered set of assertions in methods.
We have implemented clone set detection using assertion fingerprints and applied it to 10 test suites for open-source Java programs. We provide an empirical study and a qualitative analysis of our results. Assertion fingerprints enable the discovery of test clones that exhibit strong structural similarities and are amenable to refactoring. Our technique delivers an overall 75% true positive rate on our benchmarks and identifies
44% of the benchmark test methods as clones.
Subjects/Keywords: Software testing; Program analysis; Program comprehension and visualization
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, Z. (2014). Test Clone Detection via Assertion Fingerprints. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8831
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):
Fang, Zheng. “Test Clone Detection via Assertion Fingerprints.” 2014. Thesis, University of Waterloo. Accessed March 05, 2021.
http://hdl.handle.net/10012/8831.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Fang, Zheng. “Test Clone Detection via Assertion Fingerprints.” 2014. Web. 05 Mar 2021.
Vancouver:
Fang Z. Test Clone Detection via Assertion Fingerprints. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10012/8831.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Fang Z. Test Clone Detection via Assertion Fingerprints. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8831
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Universiteit Utrecht
23.
Naus, N.
Dynamic type inference for JavaScript.
Degree: 2015, Universiteit Utrecht
URL: http://dspace.library.uu.nl:8080/handle/1874/319986
► With this master thesis, we have shown that Dynamic Type Inference is a feasi- ble method for doing type inference for JavaScript. The idea of…
(more)
▼ With this master thesis, we have shown that Dynamic Type Inference is a feasi- ble method for doing type inference for JavaScript. The idea of Dynamic Type Inference is to observe the
program at run-time, and generate type constraints from the observations. With these constraints, types for the
program can be inferred.
To demonstrate this, we have developed both a formal and practical imple- mentation. Our formal system consists of a core JavaScript language and an instrumented semantics. The semantics collects the constraints and infers the types for us. The types inferred by this system are shown to be sound.
Our practical implementation does the same as our formal system, but works on full JavaScript. We have evaluated this system by running it on the SunSpider benchmark. This resulted in useful types, type errors and type warnings.
Advisors/Committee Members: Thiemann, Prof. Dr. P., Dijkstra, Dr. A., Jeuring, Prof. Dr. J.T..
Subjects/Keywords: JavaScript; Type Inference; Automatic Program Analysis
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):
Naus, N. (2015). Dynamic type inference for JavaScript. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/319986
Chicago Manual of Style (16th Edition):
Naus, N. “Dynamic type inference for JavaScript.” 2015. Masters Thesis, Universiteit Utrecht. Accessed March 05, 2021.
http://dspace.library.uu.nl:8080/handle/1874/319986.
MLA Handbook (7th Edition):
Naus, N. “Dynamic type inference for JavaScript.” 2015. Web. 05 Mar 2021.
Vancouver:
Naus N. Dynamic type inference for JavaScript. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2021 Mar 05].
Available from: http://dspace.library.uu.nl:8080/handle/1874/319986.
Council of Science Editors:
Naus N. Dynamic type inference for JavaScript. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/319986
Penn State University
24.
Kilmer, Eric David.
Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications.
Degree: 2017, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/14016eyk5120
► In 2016, DARPA held the Cyber Grand Challenge (CGC) using a special execution and evaluation environment to compare the results of different techniques in automated…
(more)
▼ In 2016, DARPA held the Cyber Grand Challenge (CGC) using a special execution and evaluation environment to compare the results of different techniques in automated vulnerability discovery. However, this special execution environment simplifies many of the complexities seen in real binaries on a desktop Linux system. In this paper, we augment the top-scoring, open source, vulnerability discovery component from the CGC by providing additional functionality with respect to files, file systems, and library function summaries to more effectively operate on realistic Linux binaries. We begin by transforming the CGC challenge binaries to resemble more realistic Linux binaries by way of dynamically linked standard C library functions and compiling for a 64-bit system. We then look at examples of popular Linux applications to evaluate our solution. We find that support for files is important and the lack of function summaries for C library functions and system calls limits the effective use of symbolic execution in a real Linux environment as compared with the CGC.
Advisors/Committee Members: Patrick McDaniel, Thesis Advisor/Co-Advisor.
Subjects/Keywords: Symbolic Execution; Vulnerability Discovery; Program Analysis; Fuzzing
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):
Kilmer, E. D. (2017). Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/14016eyk5120
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):
Kilmer, Eric David. “Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications.” 2017. Thesis, Penn State University. Accessed March 05, 2021.
https://submit-etda.libraries.psu.edu/catalog/14016eyk5120.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kilmer, Eric David. “Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications.” 2017. Web. 05 Mar 2021.
Vancouver:
Kilmer ED. Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications. [Internet] [Thesis]. Penn State University; 2017. [cited 2021 Mar 05].
Available from: https://submit-etda.libraries.psu.edu/catalog/14016eyk5120.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kilmer ED. Extending Vulnerability Discovery with Fuzzing and Symbolic Execution to Realistic Applications. [Thesis]. Penn State University; 2017. Available from: https://submit-etda.libraries.psu.edu/catalog/14016eyk5120
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Penn State University
25.
Liu, Shen.
Quantitative Privilege Separation with Pointer Supports.
Degree: 2020, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/17582sxl463
► Partitioning a security-sensitive application into least-privileged components and putting each into a separate protection domain have long been a goal of security practitioners and researchers.…
(more)
▼ Partitioning a security-sensitive application into least-privileged components and
putting each into a separate protection domain have long been a goal of security
practitioners and researchers. However, existing techniques suffer from several obstacles that prevent
program partitioning from being adopted in practice. For example,
in C/C++ programs, the presence of pointers makes calculating data dependence,
a key step in
program partitioning, difficult and hard to scale; furthermore, C-style
pointers do not carry bounds information, making it impossible to automatically
marshall and unmarshall pointer data when they are sent across the boundary of
partitions. More importantly, traditional partitioning approaches, which are based
on static
analysis, cannot find the optimal boundary for partitioning automatically. Programmers still have to do lots of manual work (e.g., declassification) to
adjust the partitioning boundary to balance between performance and security.
Furthermore, past partitioning systems only support a single label (i.e., sensitive
vs. non-sensitive). It is useful to extend the
program partitioning approach to
support multiple labels, since complicated software usually handles sensitive data
from multiple sources.
In this dissertation, we introduce our work for solving these problems in privilege separation. First, we propose a set of techniques for supporting general
pointers in automatic
program partitioning. Our system, called PtrSplit, constructs a
Program Dependence Graph (PDG) for tracking data and control
dependencies in the input
program and employs a parameter-tree approach for
representing data of pointer types; this approach is modular and avoids global
pointer
analysis. Ptrsplit performs selective pointer bounds tracking to enable marshalling/unmarshalling of pointer data. Furthermore, we develop a toolchain called
Program-mandering(PM), which can automatically find the optimal boundary
in secure
program partitioning, according to user-provided constraints. The optimal
boundary is selected by solving an integer programming model that simultaneously
considers both security and performance. As a result, functions in the sensitive
module but right on the optimal boundary are automatically declassified. We use
experiments to show that Ptrsplit and PM work effectively on real-world security
programs. Finally, we also extend our framework to support more general partitioning – partitioning an application into multiple modules instead of only two to
protect different kinds of sensitive data separately.
Advisors/Committee Members: Gang Tan, Dissertation Advisor/Co-Advisor, Gang Tan, Committee Chair/Co-Chair, Trent Ray Jaeger, Committee Member, Danfeng Zhang, Committee Member, Peng Liu, Outside Member, Chitaranjan Das, Program Head/Chair.
Subjects/Keywords: Privilege Separation; Program Analysis; Software Security
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, S. (2020). Quantitative Privilege Separation with Pointer Supports. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/17582sxl463
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, Shen. “Quantitative Privilege Separation with Pointer Supports.” 2020. Thesis, Penn State University. Accessed March 05, 2021.
https://submit-etda.libraries.psu.edu/catalog/17582sxl463.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Liu, Shen. “Quantitative Privilege Separation with Pointer Supports.” 2020. Web. 05 Mar 2021.
Vancouver:
Liu S. Quantitative Privilege Separation with Pointer Supports. [Internet] [Thesis]. Penn State University; 2020. [cited 2021 Mar 05].
Available from: https://submit-etda.libraries.psu.edu/catalog/17582sxl463.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Liu S. Quantitative Privilege Separation with Pointer Supports. [Thesis]. Penn State University; 2020. Available from: https://submit-etda.libraries.psu.edu/catalog/17582sxl463
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Addis Ababa University
26.
Kefyalew, Mergiya.
Causes of Failure of Projects under Universal Electricity Access Program of Ethiopian Electric Power: The Case of Projects Financed by the Ethiopian Government
.
Degree: 2015, Addis Ababa University
URL: http://etd.aau.edu.et/dspace/handle/123456789/6860
► Achieving 75% electricity access coverage target of the nation by the end of year 2015 is given to Ethiopian Electric Power Corporation and to meet…
(more)
▼ Achieving 75% electricity access coverage target of the nation by the end of year 2015 is given
to Ethiopian Electric Power Corporation and to meet this ambition the corporation has
established Universal Electricity Access
program office for running multiple projects which have
been financed by the Government of Ethiopia. However, as per the annual report of the
corporation for the year ended 2012/2013, the coverage is not gone as it is expected i.e. limited
to 43% only. The main challenge of this limitation, as indicated in the report was the failure of
projects. Therefore the objective of this research project was to identify the major causes of
failure of projects that have been financed by the government of Ethiopia.40 projects were
sampled of which 20 from successful and 20 from failed projects. As determinant variables,
Projects (payment) category, projects size and quality of manpower deployed to the projects
were identified through document
analysis and the interview held by the researcher. After
collecting the necessary data, a regression
analysis with logistic regression model had been
carried out. The results of the
analysis had shown that the identified determinant variables are
found statistically non-significant for failure/success of projects that were being managed under
universal electricity access
program office that are financed by the Government.
Besides, from 20 projects sampled out of the failed projects, 13(65%) were found to be projects
from project payment category 1and there is no failed project from projects payment category 2.
Advisors/Committee Members: Mohamed Seid (Dr.) (advisor).
Subjects/Keywords: Universal Electricity access program;
regression analysis
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):
Kefyalew, M. (2015). Causes of Failure of Projects under Universal Electricity Access Program of Ethiopian Electric Power: The Case of Projects Financed by the Ethiopian Government
. (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/dspace/handle/123456789/6860
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):
Kefyalew, Mergiya. “Causes of Failure of Projects under Universal Electricity Access Program of Ethiopian Electric Power: The Case of Projects Financed by the Ethiopian Government
.” 2015. Thesis, Addis Ababa University. Accessed March 05, 2021.
http://etd.aau.edu.et/dspace/handle/123456789/6860.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kefyalew, Mergiya. “Causes of Failure of Projects under Universal Electricity Access Program of Ethiopian Electric Power: The Case of Projects Financed by the Ethiopian Government
.” 2015. Web. 05 Mar 2021.
Vancouver:
Kefyalew M. Causes of Failure of Projects under Universal Electricity Access Program of Ethiopian Electric Power: The Case of Projects Financed by the Ethiopian Government
. [Internet] [Thesis]. Addis Ababa University; 2015. [cited 2021 Mar 05].
Available from: http://etd.aau.edu.et/dspace/handle/123456789/6860.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kefyalew M. Causes of Failure of Projects under Universal Electricity Access Program of Ethiopian Electric Power: The Case of Projects Financed by the Ethiopian Government
. [Thesis]. Addis Ababa University; 2015. Available from: http://etd.aau.edu.et/dspace/handle/123456789/6860
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Colorado
27.
Price, Graham David.
Dynamic Trace Analysis with Zero-Suppressed BDDs.
Degree: PhD, Electrical, Computer & Energy Engineering, 2011, University of Colorado
URL: https://scholar.colorado.edu/ecen_gradetds/27
► Instruction level parallelism (ILP) limitations have forced processor manufacturers to develop multi-core platforms with the expectation that programs will be able to exploit thread…
(more)
▼ Instruction level parallelism (ILP) limitations have forced processor manufacturers to develop multi-core platforms with the expectation that programs will be able to exploit thread level parallelism (TLP). Multi-core programming shifts the burden of locating additional performance away from computer hardware to the software developers, who often attempt high-level redesigns focused on exposing thread level parallelism, as well as explore aggressive optimizations for sequential codes. Precise dynamic
analysis can provide useful guidance for
program optimization efforts, including efforts to find and extract thread level parallelism. Unfortunately, finding regions of code amenable to further optimization efforts requires analyzing traces that can quickly grow in size.
Analysis of large dynamic traces (e.g. one billion instructions or more) is often impractical for commodity hardware. An ideal representation for dynamic trace data would provide compression. However, decompressing large software traces, even if decompressed data is never permanently stored, would make many
analysis impractical. A better solution would allow
analysis of the compressed data, without a costly decompression step. Prior works have developed trace compressors that generate an analyzable representation, but often limit the precision or scope of analyses. Zero-suppressed binary decision diagram (ZDDs) exhibit many of the desired properties of an ideal trace representation. This thesis shows: (1) dynamic trace data may be represented by zero-suppressed binary decision diagrams (ZDDs); (2) ZDDs allow many analyses to scale; (3) encoding traces as ZDDs can be performed in a reasonable amount of time; and, (4) ZDD-based analyses, such as irrelevant instruction detection and potential coarse-grained thread level parallelism extraction, can reveal a number of performance
Advisors/Committee Members: Manish Vachharajani, Fabio Somenzi, Bor-Yuh Evan Chang.
Subjects/Keywords: Dynamic Program Analysis; Parallelism; Computer Sciences; Engineering
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):
Price, G. D. (2011). Dynamic Trace Analysis with Zero-Suppressed BDDs. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/ecen_gradetds/27
Chicago Manual of Style (16th Edition):
Price, Graham David. “Dynamic Trace Analysis with Zero-Suppressed BDDs.” 2011. Doctoral Dissertation, University of Colorado. Accessed March 05, 2021.
https://scholar.colorado.edu/ecen_gradetds/27.
MLA Handbook (7th Edition):
Price, Graham David. “Dynamic Trace Analysis with Zero-Suppressed BDDs.” 2011. Web. 05 Mar 2021.
Vancouver:
Price GD. Dynamic Trace Analysis with Zero-Suppressed BDDs. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2021 Mar 05].
Available from: https://scholar.colorado.edu/ecen_gradetds/27.
Council of Science Editors:
Price GD. Dynamic Trace Analysis with Zero-Suppressed BDDs. [Doctoral Dissertation]. University of Colorado; 2011. Available from: https://scholar.colorado.edu/ecen_gradetds/27
University of Illinois – Chicago
28.
Monshizadeh, Maliheh -.
Inferring Specifications for Web Application Security.
Degree: 2017, University of Illinois – Chicago
URL: http://hdl.handle.net/10027/21846
► Over the past two decades, we have been witnessing the evolution of the web applications from simple static pages into complex, interactive platforms. With increasing…
(more)
▼ Over the past two decades, we have been witnessing the evolution of the web applications from simple static pages into complex, interactive platforms. With increasing demand to have more features added to the applications, we also have observed an increase in the frequency and significance of data breaches due to web application vulnerabilities. The need to secure the applications, however, has not been met promptly. The current practice of web application development does not address security concerns even against known vulnerabilities, let alone new unknown attacks.
The goal of the thesis is to improve the security of web applications. To achieve this goal, we would like to detect, and retrofit vulnerabilities. In studying the cyber threat landscape, we observed common web development practices and mistakes, which cause security flaws in design and implementation of web applications. By examining the existing security
analysis tools, we identify their capabilities and their limitations. Most of these tools require some
program specifications to be available to generate sound reports. However, specifications are often missing in web applications due to market demands for fast releases.
The lack of
program specification in web applications makes it challenging to analyze and verify web applications. In the absence of
program specifications, the only source of information about the web developer’s design intentions with respect to security policies in the application source code. While this source code obscures the high-level logic of the application among so many low-level details, there still are some development patterns available to us to infer the intention of the developers. Based on this belief, it is very much possible to infer
program specifications from low-level artifacts and leverage them in order to detect and retrofit vulnerabilities in legacy applications. We are also able to use this knowledge to build newer development frameworks for automated synthesis of secure code.
This thesis develops techniques to infer security specifications from the web application source. As a result of using the inferred specifications, we can improve the security of the applications in numerous ways. First, we are able to examine the inferred authentication and authorization policies to find autho- rization inconsistencies. Such inconsistencies are the main source of privilege escalation vulnerabilities in web applications. To present the effectiveness of our approach, we evaluated it on various web applications. The results suggest that we are able to detect previously unknown vulnerabilities by precise inference of access control policies.
Secondly, we are able to generate security patches for the reported vulnerabilities in web applications. Traditionally, the applications were being patched manually due to the poor quality of the automated generated patches. Using specification inference techniques, we can generate correct security patches for the vulnerable applications and suggest suitable placement of these patches…
Advisors/Committee Members: Venkatakrishnan, Venkatesan Natarajan (advisor), Naldurg, Prasad (committee member), Sistla, Prasad (committee member), Grechanik, Mark (committee member), Zuck, Lenore (committee member), Venkatakrishnan, Venkatesan Natarajan (chair).
Subjects/Keywords: Program Analysis; Web Applications; Software Security
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):
Monshizadeh, M. -. (2017). Inferring Specifications for Web Application Security. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21846
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):
Monshizadeh, Maliheh -. “Inferring Specifications for Web Application Security.” 2017. Thesis, University of Illinois – Chicago. Accessed March 05, 2021.
http://hdl.handle.net/10027/21846.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Monshizadeh, Maliheh -. “Inferring Specifications for Web Application Security.” 2017. Web. 05 Mar 2021.
Vancouver:
Monshizadeh M-. Inferring Specifications for Web Application Security. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10027/21846.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Monshizadeh M-. Inferring Specifications for Web Application Security. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21846
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Iowa State University
29.
Holland, Benjamin Robert.
Computing homomorphic program invariants.
Degree: 2018, Iowa State University
URL: https://lib.dr.iastate.edu/etd/16818
► Program invariants are properties that are true at a particular program point or points. Program invariants are often undocumented assertions made by a programmer that…
(more)
▼ Program invariants are properties that are true at a particular program point or points. Program invariants are often undocumented assertions made by a programmer that hold the key to reasoning correctly about a software verification task. Unlike the contemporary research in which program invariants are defined to hold for all control flow paths, we propose it{homomorphic program invariants}, which hold with respect to a relevant equivalence class of control flow paths. For a problem-specific task, homomorphic program invariants can form stricter assertions. This work demonstrates that the novelty of computing homomorphic program invariants is both useful and practical.
Towards our goal of computing homomorphic program invariants, we deal with the challenge of the astronomical number of paths in programs. Since reasoning about a class of program paths must be efficient in order to scale to real-world programs, we extend prior work to efficiently divide program paths into equivalence classes with respect to control flow events of interest. Our technique reasons about inter-procedural paths, which we then use to determine how to modify a program binary to abort execution at the start of an irrelevant program path. With off-the-shelf components, we employ the state-of-the-art in fuzzing and dynamic invariant detection tools to mine homomorphic program invariants.
To aid in the task of identifying likely software anomalies, we develop human-in-the-loop analysis methodologies and a toolbox of human-centric static analysis tools. We present work to perform a statically-informed dynamic analysis to efficiently transition from static analysis to dynamic analysis and leverage the strengths of each approach. To evaluate our approach, we apply our techniques to three case study audits of challenge applications from DARPA's Space/Time Analysis for Cybersecurity (STAC) program. In the final case study, we discover an unintentional vulnerability that causes a denial of service (DoS) in space and time, despite the challenge application having been hardened against static and dynamic analysis techniques.
Subjects/Keywords: invariants; program analysis; software security; Computer Sciences
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):
Holland, B. R. (2018). Computing homomorphic program invariants. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/16818
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):
Holland, Benjamin Robert. “Computing homomorphic program invariants.” 2018. Thesis, Iowa State University. Accessed March 05, 2021.
https://lib.dr.iastate.edu/etd/16818.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Holland, Benjamin Robert. “Computing homomorphic program invariants.” 2018. Web. 05 Mar 2021.
Vancouver:
Holland BR. Computing homomorphic program invariants. [Internet] [Thesis]. Iowa State University; 2018. [cited 2021 Mar 05].
Available from: https://lib.dr.iastate.edu/etd/16818.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Holland BR. Computing homomorphic program invariants. [Thesis]. Iowa State University; 2018. Available from: https://lib.dr.iastate.edu/etd/16818
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Tennessee – Knoxville
30.
Zhou, Tong.
Slot-based Calling Context Encoding.
Degree: MS, Computer Science, 2018, University of Tennessee – Knoxville
URL: https://trace.tennessee.edu/utk_gradthes/5131
► Calling context is widely used in software engineering areas such as profiling, debugging and event logging. It can also enhance some dynamic analysis such as…
(more)
▼ Calling context is widely used in software engineering areas such as profiling, debugging and event logging. It can also enhance some dynamic
analysis such as data race detection. To obtain the calling context at runtime, current approaches either perform expensive stack walking to recover contexts or instrument the application and dynamically encode the context into an integer. The current encoding schemes are either not fully precise, or have high instrumentation and detection overhead, and scalability issue for large and highly recursive applications.We propose slot-based calling context encoding (SCCE), which consists of a scalable encoding for acyclic contexts and an efficient encoding for cyclic contexts. Evaluating with CPU 2006 benchmark suite, we show that our acyclic encoding is scalable, has very low instrumentation overhead, and an acceptable detection overhead. We also show that our cyclic encoding also has lower instrumentation and detection overhead than the state-of-the-art approach by significantly reducing the number of bytes pushed and checked for cyclic contexts.
Advisors/Committee Members: Michael R. Jantz, Micah Beck, James S. Plank.
Subjects/Keywords: calling context encoding; context sensitivity; program analysis
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):
Zhou, T. (2018). Slot-based Calling Context Encoding. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/5131
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):
Zhou, Tong. “Slot-based Calling Context Encoding.” 2018. Thesis, University of Tennessee – Knoxville. Accessed March 05, 2021.
https://trace.tennessee.edu/utk_gradthes/5131.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhou, Tong. “Slot-based Calling Context Encoding.” 2018. Web. 05 Mar 2021.
Vancouver:
Zhou T. Slot-based Calling Context Encoding. [Internet] [Thesis]. University of Tennessee – Knoxville; 2018. [cited 2021 Mar 05].
Available from: https://trace.tennessee.edu/utk_gradthes/5131.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhou T. Slot-based Calling Context Encoding. [Thesis]. University of Tennessee – Knoxville; 2018. Available from: https://trace.tennessee.edu/utk_gradthes/5131
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] … [28] ▶
. 
Open Access Theses and Dissertations