Filters








62,133 Hits in 6.7 sec

More Type Inference in Java 8 [chapter]

Martin Plümicke
2015 Lecture Notes in Computer Science  
Lambda-expressions Java 8 features Type-inference in Java 8 Java 8 features Lambda-expressions functional interfaces restricted type inference method references default methods Introduction  ...  Introduction Type inference algorithm TI Implementation Summary and Outlook Lambda-expressions Java 8 features Type-inference in Java 8 Functional interfaces (SAM-Types) An interface with one method  ... 
doi:10.1007/978-3-662-46823-4_20 fatcat:5s457c6ggnh7bjpd75rrqic7ra

Adding overloading to Java type inference

Andreas Stadelmeier, Martin Plümicke
2015 Software Engineering  
In this paper we extend our Java with type inference by adding methods.  ...  Functions had been realized as lambda expressions defined in fields until now, which led to the restrictions that no overloading is available.  ...  Furthermore every type declaration, which is necessary in Java 8, is optional in the given subset.  ... 
dblp:conf/se/StadelmeierP15 fatcat:va7hllxn2fhr5dgexv3msjtoxa

ReImInfer

Wei Huang, Ana Milanova
2012 Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering - FSE '12  
We build a purity inference tool called ReImInfer on top of a type inference and checking framework. ReImInfer infers method purity for Java.  ...  Method purity inference, also known as side-effect analysis, is an important problem.  ...  The detailed inference algorithm is described in [8] .  ... 
doi:10.1145/2393596.2393640 dblp:conf/sigsoft/HuangM12 fatcat:uk2hw5zjzfez3kmnquatip7boe

Enabling static analysis for partial java programs

Barthélémy Dagenais, Laurie Hendren
2008 Proceedings of the 23rd ACM SIGPLAN conference on Object oriented programming systems languages and applications - OOPSLA '08  
We present a framework that performs partial type inference and uses heuristics to recover the declared type of expressions and resolve ambiguities in partial Java programs.  ...  We have implemented this framework and used it in an empirical study on four large open source systems which shows that our system recovers most declared types with a low error rate, even when only one  ...  This project was sup-7 www.eclipse.org/jdt/core/index.php 8 www.eclipsezone.com/eclipse/forums/t61137.html ported by the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1145/1449764.1449790 dblp:conf/oopsla/DagenaisH08 fatcat:leizs7iwszeurjdup5l4ubv7ju

Enabling static analysis for partial java programs

Barthélémy Dagenais, Laurie Hendren
2008 SIGPLAN notices  
We present a framework that performs partial type inference and uses heuristics to recover the declared type of expressions and resolve ambiguities in partial Java programs.  ...  We have implemented this framework and used it in an empirical study on four large open source systems which shows that our system recovers most declared types with a low error rate, even when only one  ...  This project was sup-7 www.eclipse.org/jdt/core/index.php 8 www.eclipsezone.com/eclipse/forums/t61137.html ported by the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1145/1449955.1449790 fatcat:5pjq223ogzfmnmbwzham45xgqa

Efficient local type inference

Ben Bellamy, Pavel Avgustinov, Oege de Moor, Damien Sereni
2008 Proceedings of the 23rd ACM SIGPLAN conference on Object oriented programming systems languages and applications - OOPSLA '08  
I begin by examining the Java bytecode verifier, which is perhaps the 'most executed' example of local type inference algorithm.  ...  I derive a 'core' algorithm for local type inference in a language that obeys certain requirements, and prove this correct.  ...  Primitive Types The .lava primitive types offer more difficulties for local type inference, due t.o Java.'  ... 
doi:10.1145/1449764.1449802 dblp:conf/oopsla/BellamyAMS08 fatcat:qliglwjlhrahbpd7ni3yheq6ni

An Evaluation of Current Java Bytecode Decompilers

James Hamilton, Sebastian Danicic
2009 2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation  
Although easier than that of decompilation of machine code, problems still arise in Java bytecode decompilation. These include type inference of local variables and exception-handling.  ...  In this paper, we evaluate the currently available Java bytecode decompilers using an extension of the criteria that were used in the original study.  ...  Type inference is an interesting problem in decompilation and two of the best decompilers tested (Dava and JODE) were both able to correctly type the variables in the type inference test.  ... 
doi:10.1109/scam.2009.24 dblp:conf/scam/HamiltonD09 fatcat:a2ofhnmh3fa77aiqkrjtthtrme

Type qualifier inference for java

David Greenfieldboyce, Jeffrey S. Foster
2007 Proceedings of the 22nd annual ACM SIGPLAN conference on Object oriented programming systems and applications - OOPSLA '07  
We found that JQual is able to automatically infer readonly in many places on method signatures. These results suggest that type qualifiers and type qualifier inference are a useful addition to Java.  ...  Java's type system provides programmers with strong guarantees of type and memory safety, but there are many important properties not captured by standard Java types.  ...  This research was supported in part by NSF CCF-0430118.  ... 
doi:10.1145/1297027.1297051 dblp:conf/oopsla/GreenfieldboyceF07 fatcat:cwdungrvtjag7hhpbtth6apnoe

Efficiently Refactoring Java Applications to Use Generic Libraries [chapter]

Robert Fuhrer, Frank Tip, Adam Kieżun, Julian Dolby, Markus Keller
2005 Lecture Notes in Computer Science  
Our approach distinguishes itself from the state-of-the-art [8] by being more scalable, by its ability to accommodate user-defined subtypes of generic library classes, and by being incorporated in a popular  ...  The refactoring infers actual type parameters for allocation sites and declarations using an existing framework of type constraints, and removes casts that have been rendered redundant.  ...  Acknowledgments We are grateful to Alan Donovan and Michael Ernst for many useful discussions about comparisons between our two algorithms, and for sharing information about the benchmarks used in [8]  ... 
doi:10.1007/11531142_4 fatcat:ec7y2bkh6zbxxmb3riowmkupnm

Type qualifier inference for java

David Greenfieldboyce, Jeffrey S. Foster
2007 SIGPLAN notices  
We found that JQual is able to automatically infer readonly in many places on method signatures. These results suggest that type qualifiers and type qualifier inference are a useful addition to Java.  ...  Java's type system provides programmers with strong guarantees of type and memory safety, but there are many important properties not captured by standard Java types.  ...  This research was supported in part by NSF CCF-0430118.  ... 
doi:10.1145/1297105.1297051 fatcat:7tejhd6d3zfrpcspyesvlpzeqa

Taming wildcards in Java's type system

Ross Tate, Alan Leung, Sorin Lerner
2012 SIGPLAN notices  
Furthermore, some Java types with wildcards have no joins, making inference of type arguments for generic methods particularly difficult.  ...  For example, there are no known sound and complete algorithms for subtyping (and consequently type checking) Java wildcards, and in fact subtyping is suspected to be undecidable because wildcards are a  ...  Furthermore, as Kennedy and Pierce mention [8] , wildcards are a more expressive domain than declaration-site variance. We will discuss these connections more in Section 10.1.  ... 
doi:10.1145/2345156.1993570 fatcat:kgy7hcgijvdiljhk2gyr2hbgaq

Taming wildcards in Java's type system

Ross Tate, Alan Leung, Sorin Lerner
2011 SIGPLAN notices  
Furthermore, some Java types with wildcards have no joins, making inference of type arguments for generic methods particularly difficult.  ...  For example, there are no known sound and complete algorithms for subtyping (and consequently type checking) Java wildcards, and in fact subtyping is suspected to be undecidable because wildcards are a  ...  Furthermore, as Kennedy and Pierce mention [8] , wildcards are a more expressive domain than declaration-site variance. We will discuss these connections more in Section 10.1.  ... 
doi:10.1145/1993316.1993570 fatcat:fmtcaifkxfddplaqialf57gf6e

Xbase

Sven Efftinge, Moritz Eysholdt, Jan Köhnlein, Sebastian Zarnekow, Robert von Massow, Wilhelm Hasselbring, Michael Hanus
2012 Proceedings of the 11th International Conference on Generative Programming and Component Engineering - GPCE '12  
Xbase expressions provide both control structures and program expressions in a uniform way. Xbase is statically typed and tightly integrated with the Java type system.  ...  Because behavioral aspects are significantly more complicated to implement, they are often delegated to generalpurpose programming languages.  ...  Type Inference Xbase is a statically typed language, based on the Java type system. In Java, type information must often be specified redundantly which is perceived to be verbose in the code.  ... 
doi:10.1145/2371401.2371419 dblp:conf/gpce/EfftingeEKZMHH12 fatcat:bxkalbavzvhijaj35afqfii5ae

Taming wildcards in Java's type system

Ross Tate, Alan Leung, Sorin Lerner
2011 Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation - PLDI '11  
Furthermore, some Java types with wildcards have no joins, making inference of type arguments for generic methods particularly difficult.  ...  For example, there are no known sound and complete algorithms for subtyping (and consequently type checking) Java wildcards, and in fact subtyping is suspected to be undecidable because wildcards are a  ...  Furthermore, as Kennedy and Pierce mention [8] , wildcards are a more expressive domain than declaration-site variance. We will discuss these connections more in Section 10.1.  ... 
doi:10.1145/1993498.1993570 dblp:conf/pldi/TateLL11 fatcat:gwdflnxi6be7zcj3sgflv4iv74

JFIX: semantics-based repair of Java programs via symbolic PathFinder

Xuan-Bach D. Le, Duc-Hiep Chu, David Lo, Claire Le Goues, Willem Visser
2017 Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis - ISSTA 2017  
While syntactic-based APR techniques have been shown successful on bugs in real-world programs written in both C and Java, semantics-based APR techniques mostly target C programs.  ...  We demonstrate that semantics-based APR can indeed efficiently and effectively repair a variety of classes of bugs in large real-world Java programs.  ...  Duc-Hiep Chu was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).  ... 
doi:10.1145/3092703.3098225 dblp:conf/issta/LeCLGV17 fatcat:ozy3ijyiqremlnpixi27io7z7e
« Previous Showing results 1 — 15 out of 62,133 results