Einloggen

Thematische Bibliographien / Java bytecode / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Java bytecode.

Zeitschriftenartikel zum Thema „Java bytecode“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 11. März 2023

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Java bytecode" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Gal, Andreas, Christian W. Probst und Michael Franz. „Integrated Java Bytecode Verification“. Electronic Notes in Theoretical Computer Science 131 (Mai 2005): 27–38. http://dx.doi.org/10.1016/j.entcs.2005.01.020.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Kim, Ki-Tae, Je-Min Kim und Weon-Hee Yoo. „Implementation of Java Bytecode Framework“. Journal of the Korea Contents Association 10, Nr. 3 (28.03.2010): 122–31. http://dx.doi.org/10.5392/jkca.2010.10.3.122.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Reynolds, Mark C. „Modeling the Java Bytecode Verifier“. Science of Computer Programming 78, Nr. 3 (März 2013): 327–42. http://dx.doi.org/10.1016/j.scico.2011.03.008.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Bertelsen, Peter. „Dynamic semantics of Java bytecode“. Future Generation Computer Systems 16, Nr. 7 (Mai 2000): 841–50. http://dx.doi.org/10.1016/s0167-739x(99)00094-1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Cook, J. J. „Reverse Execution of Java Bytecode“. Computer Journal 45, Nr. 6 (01.06.2002): 608–19. http://dx.doi.org/10.1093/comjnl/45.6.608.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Zhao, Jian-jun. „Static analysis of Java bytecode“. Wuhan University Journal of Natural Sciences 6, Nr. 1-2 (März 2001): 383–90. http://dx.doi.org/10.1007/bf03160273.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Dobravec, Tomaž. „JAVA BYTECODE INSTRUCTION USAGE COUNTING WITH ALGATOR“. Acta Electrotechnica et Informatica 18, Nr. 4 (05.01.2018): 17–25. http://dx.doi.org/10.15546/aeei-2018-0028.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Wang, Tao, und Abhik Roychoudhury. „Dynamic slicing on Java bytecode traces“. ACM Transactions on Programming Languages and Systems 30, Nr. 2 (März 2008): 1–49. http://dx.doi.org/10.1145/1330017.1330021.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Chan, Jien-Tsai, und Wuu Yang. „Advanced obfuscation techniques for Java bytecode“. Journal of Systems and Software 71, Nr. 1-2 (April 2004): 1–10. http://dx.doi.org/10.1016/s0164-1212(02)00066-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Ghosh, Sudipto, und John L. Kelly. „Bytecode fault injection for Java software“. Journal of Systems and Software 81, Nr. 11 (November 2008): 2034–43. http://dx.doi.org/10.1016/j.jss.2008.02.047.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Chrząszcz, Jacek, Patryk Czarnik und Aleksy Schubert. „A Dozen Instructions Make Java Bytecode“. Electronic Notes in Theoretical Computer Science 264, Nr. 4 (Februar 2011): 19–34. http://dx.doi.org/10.1016/j.entcs.2011.02.003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Eichberg, Michael. „BAT2XML: XML-based Java Bytecode Representation“. Electronic Notes in Theoretical Computer Science 141, Nr. 1 (Dezember 2005): 93–107. http://dx.doi.org/10.1016/j.entcs.2005.02.035.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Leroy, Xavier. „Bytecode verification on Java smart cards“. Software: Practice and Experience 32, Nr. 4 (2002): 319–40. http://dx.doi.org/10.1002/spe.438.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Li, Zhiming, Qing Wu und Kun Qian. „Adabot: Fault-Tolerant Java Decompiler (Student Abstract)“. Proceedings of the AAAI Conference on Artificial Intelligence 34, Nr. 10 (03.04.2020): 13861–62. http://dx.doi.org/10.1609/aaai.v34i10.7203.

Der volle Inhalt der Quelle

Annotation:

Reverse Engineering has been an extremely important field in software engineering, it helps us to better understand and analyze the internal architecture and interrealtions of executables. Classical Java reverse engineering task includes disassembly and decompilation. Traditional Abstract Syntax Tree (AST) based disassemblers and decompilers are strictly rule defined and thus highly fault intolerant when bytecode obfuscation were introduced for safety concern. In this work, we view decompilation as a statistical machine translation task and propose a decompilation framework which is fully based on self-attention mechanism. Through better adaption to the linguistic uniqueness of bytecode, our model fully outperforms rule-based models and previous works based on recurrence mechanism.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Jiang, Long Long, und Dai Ping Li. „Using Contour Marking Bytecode Verification Algorithm on the Java Card“. Applied Mechanics and Materials 556-562 (Mai 2014): 4120–23. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.4120.

Der volle Inhalt der Quelle

Annotation:

Java bytecode verification could not be well performed in the smart card due to the resource usage especially in the resource-constrained devices. Currently, on the card there are several bytecode verifications which exist kinds of problems, in order to be better and be better adapt to the environment, such as a smart card platform, raised using the contour subroutine labeled bytecode verification algorithm on a card. First, through the analysis of existing card byte code verification algorithm to determine the imperfections and difficulties in the judgment and the verification of subroutine, and then propose a method for marking the subroutine in the place of the jump to it. Thus not only get the program structure and enhance the effectiveness and efficiency of the validation. The feasibility of the method is demonstrated by simulating typical examples verification.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Ogata, Kazunori, Hideaki Komatsu und Toshio Nakatani. „Bytecode fetch optimization for a Java interpreter“. ACM SIGARCH Computer Architecture News 30, Nr. 5 (Dezember 2002): 58–67. http://dx.doi.org/10.1145/635506.605404.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Ogata, Kazunori, Hideaki Komatsu und Toshio Nakatani. „Bytecode fetch optimization for a Java interpreter“. ACM SIGOPS Operating Systems Review 36, Nr. 5 (Dezember 2002): 58–67. http://dx.doi.org/10.1145/635508.605404.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Munsil, Wes, und Chia-Jiu Wang. „Reducing stack usage in Java bytecode execution“. ACM SIGARCH Computer Architecture News 26, Nr. 1 (März 1998): 7–11. http://dx.doi.org/10.1145/1216461.1216464.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Qian, Zhenyu. „Standard fixpoint iteration for Java bytecode verification“. ACM Transactions on Programming Languages and Systems 22, Nr. 4 (Juli 2000): 638–72. http://dx.doi.org/10.1145/363911.363915.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Doyon, S., und M. Debbabi. „On object initialization in the Java bytecode“. Computer Communications 23, Nr. 17 (November 2000): 1594–605. http://dx.doi.org/10.1016/s0140-3664(00)00245-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Ogata, Kazunori, Hideaki Komatsu und Toshio Nakatani. „Bytecode fetch optimization for a Java interpreter“. ACM SIGPLAN Notices 37, Nr. 10 (Oktober 2002): 58–67. http://dx.doi.org/10.1145/605432.605404.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Avvenuti, Marco, Cinzia Bernardeschi und Nicoletta De Francesco. „Java bytecode verification for secure information flow“. ACM SIGPLAN Notices 38, Nr. 12 (Dezember 2003): 20–27. http://dx.doi.org/10.1145/966051.966055.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Stata, Raymie, und Martin Abadi. „A type system for Java bytecode subroutines“. ACM Transactions on Programming Languages and Systems 21, Nr. 1 (Januar 1999): 90–137. http://dx.doi.org/10.1145/314602.314606.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Albert, E., P. Arenas, S. Genaim, G. Puebla und D. Zanardini. „Experiments in Cost Analysis of Java Bytecode“. Electronic Notes in Theoretical Computer Science 190, Nr. 1 (Juli 2007): 67–83. http://dx.doi.org/10.1016/j.entcs.2007.02.061.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Vincenzi, A. M. R., M. E. Delamaro, J. C. Maldonado und W. E. Wong. „Establishing structural testing criteria for Java bytecode“. Software: Practice and Experience 36, Nr. 14 (2006): 1513–41. http://dx.doi.org/10.1002/spe.726.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Collberg, Christian, Ginger Myles und Michael Stepp. „An empirical study of Java bytecode programs“. Software: Practice and Experience 37, Nr. 6 (2007): 581–641. http://dx.doi.org/10.1002/spe.776.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Meehan, Gary, und Mike Joy. „Compiling lazy functional programs to Java bytecode“. Software: Practice and Experience 29, Nr. 7 (Juni 1999): 617–45. http://dx.doi.org/10.1002/(sici)1097-024x(199906)29:7<617::aid-spe250>3.0.co;2-e.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Sherman, Elena, Yannic Noller, Cyrille Artho, Franck van Breugel, Anto Nanah Ji, John Kellerman, Parssa Khazra et al. „The Java Pathfinder Workshop 2022“. ACM SIGSOFT Software Engineering Notes 48, Nr. 1 (10.01.2023): 19–21. http://dx.doi.org/10.1145/3573074.3573080.

Der volle Inhalt der Quelle

Annotation:

Java Pathfinder (JPF) was originally developed as an explicit state software model checker and subsequently evolved into an extensible Java bytecode analysis framework that has been successfully used to implement techniques such as symbolic and concolic execution, compositional verification, parallel execution, incremental program analysis, and many more. Apart from its original domain of concurrent Java programs, JPF now supports the verification of new domains such as UMLs, numeric programs, graphical user interfaces, and Android applications.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Bernardeschi, C., N. De Francesco, G. Lettieri und L. Martini. „Checking secure information flow in Java bytecode by code transformation and standard bytecode verification“. Software: Practice and Experience 34, Nr. 13 (18.10.2004): 1225–55. http://dx.doi.org/10.1002/spe.611.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Haase, Oliver. „Abstract Interpretation of Java Bytecode for Immutability Analysis“. Journal of Computer Science 12, Nr. 7 (01.07.2016): 314–22. http://dx.doi.org/10.3844/jcssp.2016.314.322.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Clausen, Lars Ræder, Ulrik Pagh Schultz, Charles Consel und Gilles Muller. „Java bytecode compression for low-end embedded systems“. ACM Transactions on Programming Languages and Systems 22, Nr. 3 (Mai 2000): 471–89. http://dx.doi.org/10.1145/353926.353933.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Jipping, Michael J., Cameron Calka, Brian O'Neill und Christopher R. Padilla. „Teaching students java bytecode using lego mindstorms robots“. ACM SIGCSE Bulletin 39, Nr. 1 (07.03.2007): 170–74. http://dx.doi.org/10.1145/1227504.1227371.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Gal, Andreas, Christian W. Probst und Michael Franz. „Java bytecode verification via static single assignment form“. ACM Transactions on Programming Languages and Systems 30, Nr. 4 (Juli 2008): 1–21. http://dx.doi.org/10.1145/1377492.1377496.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

BARTHE, GILLES, DAVID PICHARDIE und TAMARA REZK. „A certified lightweight non-interference Java bytecode verifier“. Mathematical Structures in Computer Science 23, Nr. 5 (17.05.2013): 1032–81. http://dx.doi.org/10.1017/s0960129512000850.

Der volle Inhalt der Quelle

Annotation:

Non-interference guarantees the absence of illicit information flow throughout program execution. It can be enforced by appropriate information flow type systems. Much of the previous work on type systems for non-interference has focused on calculi or high-level programming languages, and existing type systems for low-level languages typically omit objects, exceptions and method calls. We define an information flow type system for a sequential JVM-like language that includes all these programming features, and we prove, in the Coq proof assistant, that it guarantees non-interference. An additional benefit of the formalisation is that we have extracted from our proof a certified lightweight bytecode verifier for information flow. Our work provides, to the best of our knowledge, the first sound and certified information flow type system for such an expressive fragment of the JVM.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Payet, Étienne, und Fausto Spoto. „Experiments with Non-Termination Analysis for Java Bytecode“. Electronic Notes in Theoretical Computer Science 253, Nr. 5 (Dezember 2009): 83–96. http://dx.doi.org/10.1016/j.entcs.2009.11.016.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Spoto, Fausto, und Étienne Payet. „Magic-sets for localised analysis of Java bytecode“. Higher-Order and Symbolic Computation 23, Nr. 1 (März 2010): 29–86. http://dx.doi.org/10.1007/s10990-010-9063-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

McGhan, H., und M. O'Connor. „PicoJava: a direct execution engine for Java bytecode“. Computer 31, Nr. 10 (1998): 22–30. http://dx.doi.org/10.1109/2.722273.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Knoblock, Todd B., und Jakob Rehof. „Type elaboration and subtype completion for Java bytecode“. ACM Transactions on Programming Languages and Systems 23, Nr. 2 (März 2001): 243–72. http://dx.doi.org/10.1145/383043.383045.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Clausen, Lars R. „A Java bytecode optimizer using side-effect analysis“. Concurrency: Practice and Experience 9, Nr. 11 (November 1997): 1031–45. http://dx.doi.org/10.1002/(sici)1096-9128(199711)9:11<1031::aid-cpe354>3.0.co;2-o.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Bernardeschi, Cinzia, Giuseppe Lettieri, Luca Martini und Paolo Masci. „A Space-Aware Bytecode Verifier for Java Cards“. Electronic Notes in Theoretical Computer Science 141, Nr. 1 (Dezember 2005): 237–54. http://dx.doi.org/10.1016/j.entcs.2005.02.027.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Binder, Walter, und Jarle Hulaas. „Java Bytecode Transformations for Efficient, Portable CPU Accounting“. Electronic Notes in Theoretical Computer Science 141, Nr. 1 (Dezember 2005): 53–73. http://dx.doi.org/10.1016/j.entcs.2005.02.037.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Coglio, Alessandro. „Improving the official specification of Java bytecode verification“. Concurrency and Computation: Practice and Experience 15, Nr. 2 (2003): 155–79. http://dx.doi.org/10.1002/cpe.714.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Coglio, Alessandro. „Simple verification technique for complex Java bytecode subroutines“. Concurrency and Computation: Practice and Experience 16, Nr. 7 (27.04.2004): 647–70. http://dx.doi.org/10.1002/cpe.798.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Lambert, Jonathan, Rosemary Monahan und Kevin Casey. „Accidental Choices—How JVM Choice and Associated Build Tools Affect Interpreter Performance“. Computers 11, Nr. 6 (14.06.2022): 96. http://dx.doi.org/10.3390/computers11060096.

Der volle Inhalt der Quelle

Annotation:

Considering the large number of optimisation techniques that have been integrated into the design of the Java Virtual Machine (JVM) over the last three decades, the Java interpreter continues to persist as a significant bottleneck in the performance of bytecode execution. This paper examines the relationship between Java Runtime Environment (JRE) performance concerning the interpreted execution of Java bytecode and the effect modern compiler selection and integration within the JRE build toolchain has on that performance. We undertook this evaluation relative to a contemporary benchmark suite of application workloads, the Renaissance Benchmark Suite. Our results show that the choice of GNU GCC compiler version used within the JRE build toolchain statistically significantly affects runtime performance. More importantly, not all OpenJDK releases and JRE JVM interpreters are equal. Our results show that OpenJDK JVM interpreter performance is associated with benchmark workload. In addition, in some cases, rolling back to an earlier OpenJDK version and using a more recent GNU GCC compiler within the build toolchain of the JRE can significantly positively impact JRE performance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Vartanov, S. P., und M. K. Ermakov. „Applying Java bytecode static instrumentation for software dynamic analysis“. Proceedings of the Institute for System Programming of the RAS 27, Nr. 1 (2015): 25–38. http://dx.doi.org/10.15514/ispras-2015-27(1)-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

GAMESS, ERIC. „EXECUTION OF SEQUENTIAL AND PARALLEL JAVA BYTECODE IN A METACOMPUTING SYSTEM“. Parallel Processing Letters 13, Nr. 01 (März 2003): 53–64. http://dx.doi.org/10.1142/s0129626403001148.

Der volle Inhalt der Quelle

Annotation:

In this paper, we address the goal of executing Java parallel applications in a group of nodes of a Beowulf cluster transparently chosen by a metacomputing system oriented to efficient execution of Java bytecode, with support for scientific computing. To this end, we extend the Java virtual machine by providing a message passing interface and quick access to distributed high performance resources. Also, we introduce the execution of parallel linear algebra methods for large objects from sequential Java applications by invoking SPLAM, our parallel linear algebra package.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Papadimitriou, Stergios, Seferina Mavroudi, Kostas Theofilatos und Spiridon Likothanasis. „MATLAB-Like Scripting of Java Scientific Libraries in ScalaLab“. Scientific Programming 22, Nr. 3 (2014): 187–99. http://dx.doi.org/10.1155/2014/570902.

Der volle Inhalt der Quelle

Annotation:

Although there are a lot of robust and effective scientific libraries in Java, the utilization of these libraries in pure Java is difficult and cumbersome, especially for the average scientist that does not expertise in software development. We illustrate that ScalaLab presents an easier and productive MATLAB like front end. Also, the main strengths and weaknesses of the core Java libraries of ScalaLab are elaborated. Since performance is of paramount importance for scientific computation, the article discusses extensively performance aspects of the ScalaLab environment. Also, Java bytecode performance is compared to native code.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Bockisch, Christoph, Gabriele Taentzer, Nebras Nassar und Lukas Wydra. „Java Bytecode Verification with OCL Why, How and Whenc.“ Journal of Object Technology 19, Nr. 3 (2020): 3:1. http://dx.doi.org/10.5381/jot.2020.19.3.a13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Achour, Safaa, Ali Chouenyib und Mohammed Benattou. „A Constraint-Based Verification Approach for Java Bytecode Programs“. International Journal of Software Engineering and Its Applications 12, Nr. 2 (30.06.2018): 1–17. http://dx.doi.org/10.14257/ijseia.2018.12.2.01.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Kumar, Krishan, Viney Kehar und Prabhpreet Kaur. „An Evaluation of Dynamic Java Bytecode Software Watermarking Algorithms“. International Journal of Security and Its Applications 10, Nr. 7 (31.07.2016): 147–56. http://dx.doi.org/10.14257/ijsia.2016.10.7.13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!