His scientific interests lie mostly in Programming language, Theoretical computer science, Constraint, Type qualifier and Type inference. Jeffrey S. Foster merges Programming language with Flexibility in his study. His work deals with themes such as Effect system, Dynamic software updating, Correctness and Automatic programming, which intersect with Theoretical computer science.
His studies in Type qualifier integrate themes in fields like Type theory, Reliability and Linux kernel. His study on Type inference also encompasses disciplines like
Jeffrey S. Foster mainly focuses on Programming language, Theoretical computer science, Software engineering, Software and Static analysis. His Programming language research is multidisciplinary, incorporating elements of Type checking and Type inference. His Theoretical computer science study integrates concerns from other disciplines, such as Type qualifier, Inference, Correctness and Symbolic execution.
Jeffrey S. Foster studied Type qualifier and Type theory that intersect with String. The Software engineering study which covers Software quality that intersects with Software construction. His Static analysis research is multidisciplinary, relying on both Scalability, Source code and Static program analysis.
His primary scientific interests are in Programming language, Set, Theoretical computer science, Software engineering and Android. His Programming language study incorporates themes from Type checking, Web application and Key. His studies deal with areas such as Selection and Operations research as well as Set.
His work on Abstract interpretation as part of general Theoretical computer science study is frequently connected to Constraint, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. Jeffrey S. Foster interconnects Program analysis, Debugging and Reverse engineering in the investigation of issues within Software engineering. His Android research focuses on World Wide Web and how it relates to Authorization and Model checking.
His study in Metaprogramming is interdisciplinary in nature, drawing from both Process, Encoding, Correctness, Translation and Host. Many of his research projects under Set are closely connected to Social choice theory with Social choice theory, tying the diverse disciplines of science together. The study incorporates disciplines such as Program synthesis, Java, Java collections framework, Software design pattern and Software engineering in addition to Program analysis.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A First Step Towards Automated Detection of Buffer Overrun Vulnerabilities.
David A. Wagner;Jeffrey S. Foster;Eric A. Brewer;Alexander Aiken.
network and distributed system security symposium (2000)
Detecting format string vulnerabilities with type qualifiers
Umesh Shankar;Kunal Talwar;Jeffrey S. Foster;David Wagner.
usenix security symposium (2001)
Flow-sensitive type qualifiers
Jeffrey S. Foster;Tachio Terauchi;Alex Aiken.
programming language design and implementation (2002)
SCanDroid: Automated Security Certification of Android
Adam P. Fuchs;Avik Chaudhuri;Jeffrey S. Foster.
A comparison of bug finding tools for Java
N. Rutar;C.B. Almazan;J.S. Foster.
international symposium on software reliability engineering (2004)
A theory of type qualifiers
Jeffrey S. Foster;Manuel Fähndrich;Alexander Aiken.
programming language design and implementation (1999)
From program verification to program synthesis
Saurabh Srivastava;Sumit Gulwani;Jeffrey S. Foster.
symposium on principles of programming languages (2010)
Dr. Android and Mr. Hide: fine-grained permissions in android applications
Jinseong Jeon;Kristopher K. Micinski;Jeffrey A. Vaughan;Ari Fogel.
security and privacy in smartphones and mobile devices (2012)
LOCKSMITH: context-sensitive correlation analysis for race detection
Polyvios Pratikakis;Jeffrey S. Foster;Michael Hicks.
programming language design and implementation (2006)
Understanding source code evolution using abstract syntax tree matching
Iulian Neamtiu;Jeffrey S. Foster;Michael Hicks.
mining software repositories (2005)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: