Transforming The Code: More Than Meets The Eye
|
|
|
- Sharon Alexandrina McCoy
- 5 years ago
- Views:
Transcription
1 1 / 19 Transforming The Code: More Than Meets The Eye Doni Pracner Department of Mathematics and Informatics Faculty of Sciences University of Novi Sad 12th Workshop Software Engineering, Education & Reverse Engineering 2 9 September 2012, Opatija, Croatia
2 2 / 19 Presentation Organization 1 Introduction Software Evolution WSL Wide Spectrum Language 2 Assembly Transformation Process Our Transformation Process Problems 3 (Micro)Java Bytecode Bytecode Type System 4 Summary Results and open questions
3 3 / 19 Presentation Organisation 1 Introduction Software Evolution WSL Wide Spectrum Language 2 Assembly Transformation Process Our Transformation Process Problems 3 (Micro)Java Bytecode Bytecode Type System 4 Summary Results and open questions
4 4 / 19 Change in all things is sweet. Aristotle Therefore: Aristotle was not a software maintainer Software maintainers have a high diabetes risk
5 4 / 19 Change in all things is sweet. Aristotle Therefore: Aristotle was not a software maintainer Software maintainers have a high diabetes risk
6 4 / 19 Change in all things is sweet. Aristotle Therefore: Aristotle was not a software maintainer Software maintainers have a high diabetes risk
7 5 / 19 Software Evolution Software does not degrade with time on its own, the environment changes A need for constant maintainance and enhancement Software Evolution is (largely) repeated reengineering. Previously our group built tools with aim to make old, low level, assembly code easier to understand, and hopefully restructure it. Currently we are working on doing similar things with Java Bytecode.
8 6 / 19 WSL Wide Spectrum Language The tools use WSL Developed by Martin Ward (since 1989) Strong mathematical core Formal transformations Wide spectrum: from abstract specifications to low level program code MetaWSL operations on WSL code Successfully used in migrating legacy assembly code to maintainable C/COBOL code Implemented as FermaT program transformation system
9 7 / 19 Presentation Organisation 1 Introduction Software Evolution WSL Wide Spectrum Language 2 Assembly Transformation Process Our Transformation Process Problems 3 (Micro)Java Bytecode Bytecode Type System 4 Summary Results and open questions
10 Our transformation process manual transf. manual transf. Assembly asm2wsl WSL transf.wsl Structured WSL Figure: Work-flow diagram asm2wsl and transf.wsl were built around WSL Main goal is to get a high level version of the original program. 8 / 19
11 9 / 19 Asm2wsl application Translates a subset of x86 assembly to WSL Mostly presumes for simplicity Implemented in Java Basically a line by line translator. Focus is on translating all aspects, not optimization (at this stage) Uses Action systems built into WSL for handling unstructured code We work with a virtual processor, simulating: Processor registers (with Low and High parts) Flags, overflow Stack a list Labels Action system names Some special macros are recognized and translated directly Procedures nested Action systems
12 10 / 19 Automatic transformations transf.wsl A small script to call the existing transformations Main transformations: Collapse Action Systems Transform DO... OD loops Constant propagation Remove Redundant Flag removal Translating assembly programs to WSL so we can: Generate call diagrams for easier understanding of original code; Automatically transform the code to much simpler versions; Optionally to manually tweak the results with more transformations
13 11 / 19 Problems Questions of feasibility of an all-high-level translation Problematic standards order of operands, macros, architectures, various hacks, input/output Lack of a good assembly code base to experiment on Little experience with coding assembly lack of feel Has been done in other ways (with auxiliary files) Plan: use mainly in Software Evolution courses for examples and adapt if needed
14 12 / 19 Presentation Organisation 1 Introduction Software Evolution WSL Wide Spectrum Language 2 Assembly Transformation Process Our Transformation Process Problems 3 (Micro)Java Bytecode Bytecode Type System 4 Summary Results and open questions
15 13 / 19 Java Bytecode Similar to classic assembly in many ways Has a standard virtual machine Widely used, even by other language compilers A lot of code available, as well as experience in working with it. Plan: build translators to and from WSL Useful for formal verification or transformation, as well as code compiled from non-java languages
16 14 / 19 MicroJava Bytecode First step: use MicroJava proof of concept Developed by Hanspeter Moessenboeck, for use in Compiler Construction courses; not the same as Java ME Concepts are similar to full Java Bytecode, but simplified Less instructions, only int and char primitive types, arrays and basic classes MJ Bytecode does not encode types New tool mjc2wsl (mjc MicroJava Compiled) Similar in many ways to asm2wsl local variables, stack etc.
17 15 / 19 Generalized transformation process Figure: Generalized work-flow diagram
18 16 / 19 Type system WSL has no type system Therefore transformations can t check type consistency, possible source of errors. This is necessary for full Java Bytecode A Wide Spectrum Type System was developed by Matthias Ladkau in his PhD thesis Not yet fully integrated into FermaT It could be used to improve many of the transformations one of the goals of this project
19 17 / 19 Presentation Organisation 1 Introduction Software Evolution WSL Wide Spectrum Language 2 Assembly Transformation Process Our Transformation Process Problems 3 (Micro)Java Bytecode Bytecode Type System 4 Summary Results and open questions
20 18 / 19 Summary Previously: tools for some basic assembly conversion and transformation New tools for translating MicroJava Bytecode (simplified Java) Future work Further work on the MJ Bytecode translator and transformations Development of WSL to MJ Bytecode translators Integration of the Wide Spectrum Type System into FermaT Development of Java Bytecode translators to and from WSL
21 19 / 19 Thank you for your attention Questions?
Understanding old assembly code using formal transformations
1 / 29 Understanding old assembly code using formal transformations Doni Pracner Department of mathematics and informatics Faculty of Sciences University of Novi Sad 22 27 August 2011 11th Workshop Software
Transforming Assembly to WSL, a high-level language
10 th Workshop Software Engineering Education and Reverse Engineering, Ivanjica, Serbia, 5-12 September, 2010 Transforming Assembly to WSL, a high-level language Doni Pracner Department of Mathematics
Transforming Low-level Languages Using FermaT and WSL
9 Transforming Low-level Languages Using FermaT and WSL DONI PRACNER AND ZORAN BUDIMAC, University of Novi Sad There are many known problems in software maintanance, especially in cases where the available
FermaT Maintenance Environment Tutorial
UTC - Software Evolution Software Technology Research Laboratory http://www.cse.dmu.ac.uk/strl/ FermaT Maintenance Environment Tutorial Document type Tutorial Author Matthias Ladkau Date April 22, 2007
Lecture content. Course goals. Course Introduction. TDDA69 Data and Program Structure Introduction
Lecture content TDDA69 Data and Program Structure Introduction Cyrille Berger Course Introduction to the different Programming Paradigm The different programming paradigm Why different paradigms? Introduction
Software re-engineering
Software re-engineering Reorganising and modifying existing software systems to make them more maintainable Ian Sommerville 2000 Software Engineering, 6th edition. Chapter 28 Slide 1 Objectives To explain
A Formal Model Driven Approach to Dependable Software Evolution
A Formal Model Driven Approach to Dependable Software Evolution Feng Chen, Hongji Yang and Bing Qiao Software Technology Research Laboratory De Montfort University, Leicester, UK fengchen, hyang, bqiao
CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)
By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable
Software Maintenance. Maintenance is Inevitable. Types of Maintenance. Managing the processes of system change
Software Maintenance Managing the processes of system change Maintenance is Inevitable The system requirements are likely to change while the system is being developed because the environment is changing.
Evolution of XML Applications
Evolution of XML Applications University of Technology Sydney, Australia Irena Mlynkova 9.11. 2011 XML and Web Engineering Research Group Department of Software Engineering Faculty of Mathematics and Physics
CSI33 Data Structures
Outline Department of Mathematics and Computer Science Bronx Community College October 24, 2018 Outline Outline 1 Chapter 8: A C++ Introduction For Python Programmers Expressions and Operator Precedence
Toward Language Independent Worst-Case Execution Time Calculation
10 Toward Language Independent Worst-Case Execution Time Calculation GORDANA RAKIĆ and ZORAN BUDIMAC, Faculty of Science, University of Novi Sad Set of Software Quality Static Analyzers (SSQSA) is a set
Stack effect calculus with typed wildcards, polymorphism and inheritance. Abstract
Stack effect calculus with typed wildcards, polymorphism and inheritance Jaanus Pöial University of Tartu, Estonia Abstract In early 1990s author introduced a formal stack effect calculus for verification
VA Smalltalk Update. 24 th ESUG Conference Prague, Czech Republic August 23, John O Keefe Chief Technical Officer Instantiations, Inc.
24 th ESUG Conference Prague, Czech Republic August 23, 2016 VA Smalltalk Update John O Keefe Chief Technical Officer Instantiations, Inc. Agenda Company Update Current Release Content Next Release Candidates
Administration CS 412/413. Why build a compiler? Compilers. Architectural independence. Source-to-source translator
CS 412/413 Introduction to Compilers and Translators Andrew Myers Cornell University Administration Design reports due Friday Current demo schedule on web page send mail with preferred times if you haven
Verification and Validation
2014-2015 Verification and Validation Part I : Extended Static Analysis Burkhart Wolff Département Informatique Université Paris-Sud / Orsay Static Analysis! We have seen test methods, and proof methods.
Review for Test 1 (Chapter 1-5)
Review for Test 1 (Chapter 1-5) 1. Introduction to Computers, Programs, and Java a) What is a computer? b) What is a computer program? c) A bit is a binary digit 0 or 1. A byte is a sequence of 8 bits.
COMP 181 Compilers. Administrative. Last time. Prelude. Compilation strategy. Translation strategy. Lecture 2 Overview
COMP 181 Compilers Lecture 2 Overview September 7, 2006 Administrative Book? Hopefully: Compilers by Aho, Lam, Sethi, Ullman Mailing list Handouts? Programming assignments For next time, write a hello,
Establishment of new Department of Informatics, UNIRI and experiences in teaching SE course
Establishment of new Department of Informatics, UNIRI and experiences in teaching SE course Nataša Hoić-Božić, natasah@inf.uniri.hr Sanja Čandrlić, sanjac@inf.uniri.hr Odjel za informatiku, Sveučilište
COMPILER CONSTRUCTION Seminar 02 TDDB44
COMPILER CONSTRUCTION Seminar 02 TDDB44 Martin Sjölund (martin.sjolund@liu.se) Adrian Horga (adrian.horga@liu.se) Department of Computer and Information Science Linköping University LABS Lab 3 LR parsing
A Type is a Set of Values. Here we declare n to be a variable of type int; what we mean, n can take on any value from the set of all integer values.
Types A Type is a Set of Values Consider the statement: Read Chapter 6 int n; Here we declare n to be a variable of type int; what we mean, n can take on any value from the set of all integer values. Also
Verified compilers. Guest lecture for Compiler Construction, Spring Magnus Myréen. Chalmers University of Technology
Guest lecture for Compiler Construction, Spring 2015 Verified compilers Magnus Myréen Chalmers University of Technology Mentions joint work with Ramana Kumar, Michael Norrish, Scott Owens and many more
Parsing Scheme (+ (* 2 3) 1) * 1
Parsing Scheme + (+ (* 2 3) 1) * 1 2 3 Compiling Scheme frame + frame halt * 1 3 2 3 2 refer 1 apply * refer apply + Compiling Scheme make-return START make-test make-close make-assign make- pair? yes
Chapter 04: Instruction Sets and the Processor organizations. Lesson 18: Stack-based processor Organisation
Chapter 04: Instruction Sets and the Processor organizations Lesson 18: Stack-based processor Organisation 1 Objective To understand stack based processor organisation Instruction set of a stack organized
Assembler Restructuring in FermaT
Assembler Restructuring in FermaT Martin Ward Software Technology Research Lab De Montfort University Bede Island Building, Leicester LE1 9BH, UK martin@gkc.org.uk Abstract The FermaT transformation system
An Approach to the Generation of High-Assurance Java Card Applets
An Approach to the Generation of High-Assurance Java Card Applets Alessandro Coglio Kestrel Institute 3260 Hillview Avenue, Palo Alto, CA 94304, USA Ph. +1-650-493-6871 Fax +1-650-424-1807 http://www.kestrel.edu/
Implementation of Customized FindBugs Detectors
Implementation of Customized FindBugs Detectors Jerry Zhang Department of Computer Science University of British Columbia jezhang@cs.ubc.ca ABSTRACT There are a lot of static code analysis tools to automatically
Computer Components. Software{ User Programs. Operating System. Hardware
Computer Components Software{ User Programs Operating System Hardware What are Programs? Programs provide instructions for computers Similar to giving directions to a person who is trying to get from point
G Programming Languages - Fall 2012
G22.2110-003 Programming Languages - Fall 2012 Lecture 4 Thomas Wies New York University Review Last week Control Structures Selection Loops Adding Invariants Outline Subprograms Calling Sequences Parameter
Why Study Assembly Language?
Why Study Assembly Language? This depends on the decade in which you studied assembly language. 1940 s You cannot study assembly language. It does not exist yet. 1950 s You study assembly language because,
Logic Model Checking
Logic Model Checking Lecture Notes 17:18 Caltech 101b.2 January-March 2005 Course Text: The Spin Model Checker: Primer and Reference Manual Addison-Wesley 2003, ISBN 0-321-22862-6, 608 pgs. checking omega
COMPILER CONSTRUCTION LAB 2 THE SYMBOL TABLE. Tutorial 2 LABS. PHASES OF A COMPILER Source Program. Lab 2 Symbol table
COMPILER CONSTRUCTION Lab 2 Symbol table LABS Lab 3 LR parsing and abstract syntax tree construction using ''bison' Lab 4 Semantic analysis (type checking) PHASES OF A COMPILER Source Program Lab 2 Symtab
CMPT 379 Compilers. Anoop Sarkar.
CMPT 379 Compilers Anoop Sarkar http://www.cs.sfu.ca/~anoop! Program Compiler Machine Code Input Runtime Output 2012-11- 01 2 main(){char *c="main(){char *c=%c%s%c;printf(c,34,c,34);}";printf(c,34,c,34);}!
Optimizing Compilers. Vineeth Kashyap Department of Computer Science, UCSB. SIAM Algorithms Seminar, 2014
Optimizing Compilers Vineeth Kashyap Department of Computer Science, UCSB SIAM Algorithms Seminar, 2014 Warning!! Optimizing compiler is a misnomer My Background Worked on a compiler team for 2 years at
Organization of Programming Languages (CSE452) Why are there so many programming languages? What makes a language successful?
Organization of Programming Languages (CSE452) Instructor: Dr. B. Cheng Fall 2004 1 Why are there so many programming languages? Evolution -- we've learned better ways of doing things over time Socio-economic
Secure Programming. An introduction to Splint. Informatics and Mathematical Modelling Technical University of Denmark E
Secure Programming An introduction to Splint Christian D. Jensen René Rydhof Hansen Informatics and Mathematical Modelling Technical University of Denmark E05-02230 CDJ/RRH (IMM/DTU) Secure Programming
COMP 410 Lecture 1. Kyle Dewey
COMP 410 Lecture 1 Kyle Dewey About Me I research automated testing techniques and their intersection with CS education My dissertation used logic programming extensively This is my second semester at
Accelerating Ruby with LLVM
Accelerating Ruby with LLVM Evan Phoenix Oct 2, 2009 RUBY RUBY Strongly, dynamically typed RUBY Unified Model RUBY Everything is an object RUBY 3.class # => Fixnum RUBY Every code context is equal RUBY
Pierce Ch. 3, 8, 11, 15. Type Systems
Pierce Ch. 3, 8, 11, 15 Type Systems Goals Define the simple language of expressions A small subset of Lisp, with minor modifications Define the type system of this language Mathematical definition using
Agenda. CSE P 501 Compilers. Java Implementation Overview. JVM Architecture. JVM Runtime Data Areas (1) JVM Data Types. CSE P 501 Su04 T-1
Agenda CSE P 501 Compilers Java Implementation JVMs, JITs &c Hal Perkins Summer 2004 Java virtual machine architecture.class files Class loading Execution engines Interpreters & JITs various strategies
Lecture 5: The Halting Problem. Michael Beeson
Lecture 5: The Halting Problem Michael Beeson Historical situation in 1930 The diagonal method appears to offer a way to extend just about any definition of computable. It appeared in the 1920s that it
CSCE 145 Exam 1 Review. This exam totals to 100 points. Follow the instructions. Good luck!
CSCE 145 Exam 1 Review This exam totals to 100 points. Follow the instructions. Good luck! Chapter 1 This chapter was mostly terms so expect a fill in the blank style questions on definition. Remember
Code Generation. The Main Idea of Today s Lecture. We can emit stack-machine-style code for expressions via recursion. Lecture Outline.
The Main Idea of Today s Lecture Code Generation We can emit stack-machine-style code for expressions via recursion (We will use MIPS assembly as our target language) 2 Lecture Outline What are stack machines?
Basic operators, Arithmetic, Relational, Bitwise, Logical, Assignment, Conditional operators. JAVA Standard Edition
Basic operators, Arithmetic, Relational, Bitwise, Logical, Assignment, Conditional operators JAVA Standard Edition Java - Basic Operators Java provides a rich set of operators to manipulate variables.
We can emit stack-machine-style code for expressions via recursion
Code Generation The Main Idea of Today s Lecture We can emit stack-machine-style code for expressions via recursion (We will use MIPS assembly as our target language) 2 Lecture Outline What are stack machines?
Addressing Verification Bottlenecks of Fully Synthesized Processor Cores using Equivalence Checkers
Addressing Verification Bottlenecks of Fully Synthesized Processor Cores using Equivalence Checkers Subash Chandar G (g-chandar1@ti.com), Vaideeswaran S (vaidee@ti.com) DSP Design, Texas Instruments India
RISC Architecture Ch 12
RISC Architecture Ch 12 Some History Instruction Usage Characteristics Large Register Files Register Allocation Optimization RISC vs. CISC 18 Original Ideas Behind CISC (Complex Instruction Set Comp.)
METAWSL and Meta-Transformations in the FermaT Transformation System
METAWSL and Meta-Transformations in the FermaT Transformation System Martin Ward and Hussein Zedan Software Technology Research Laboratory, De Montfort University, Leicester, UK mward@dmu.ac.uk http://www.cse.dmu.ac.uk/
REDUCED INSTRUCTION SET COMPUTERS (RISC)
Datorarkitektur Fö 5/6-1 Datorarkitektur Fö 5/6-2 What are RISCs and why do we need them? REDUCED INSTRUCTION SET COMPUTERS (RISC) RISC architectures represent an important innovation in the area of computer
Decompilation of Binary Programs & Structuring Decompiled Graphs
Decompilation of Binary Programs & Structuring Decompiled Graphs Ximing Yu May 3, 2011 1 Introduction A decompiler, or reverse compiler, is a program that attempts to perform the inverse process of the
Symbol Tables Symbol Table: In computer science, a symbol table is a data structure used by a language translator such as a compiler or interpreter, where each identifier in a program's source code is
Chapter 1 GETTING STARTED. SYS-ED/ Computer Education Techniques, Inc.
Chapter 1 GETTING STARTED SYS-ED/ Computer Education Techniques, Inc. Objectives You will learn: Java platform. Applets and applications. Java programming language: facilities and foundation. Memory management
SOFTWARE MAINTENANCE: A
SOFTWARE MAINTENANCE: A TUTORIAL BY KEITH H. BENNETT 2008.10.13 소프트웨어 200310612 조보경 Software Engineering Field Main problem of software engineering Scale and Complexity of the software Goal of software
AIR FORCE SCHOOL,BAMRAULI COMPUTER SCIENCE (083) CLASS XI Split up Syllabus (Session ) Contents
AIR FORCE SCHOOL,BAMRAULI COMPUTER SCIENCE (083) CLASS XI Split up Syllabus (Session- 2017-18) Month July Contents UNIT 1: COMPUTER FUNDAMENTALS Evolution of computers; Basics of computer and its operation;
What is a compiler? Xiaokang Qiu Purdue University. August 21, 2017 ECE 573
What is a compiler? Xiaokang Qiu Purdue University ECE 573 August 21, 2017 What is a compiler? What is a compiler? Traditionally: Program that analyzes and translates from a high level language (e.g.,
What is a compiler? var a var b mov 3 a mov 4 r1 cmpi a r1 jge l_e mov 2 b jmp l_d l_e: mov 3 b l_d: ;done
What is a compiler? What is a compiler? Traditionally: Program that analyzes and translates from a high level language (e.g., C++) to low-level assembly language that can be executed by hardware int a,
CPS122 Lecture: From Python to Java last revised January 4, Objectives:
Objectives: CPS122 Lecture: From Python to Java last revised January 4, 2017 1. To introduce the notion of a compiled language 2. To introduce the notions of data type and a statically typed language 3.
Lecture Outline. Code Generation. Lecture 30. Example of a Stack Machine Program. Stack Machines
Lecture Outline Code Generation Lecture 30 (based on slides by R. Bodik) Stack machines The MIPS assembly language The x86 assembly language A simple source language Stack-machine implementation of the
Lecture Notes on Decompilation
Lecture Notes on Decompilation 15411: Compiler Design Maxime Serrano Lecture 20 October 31, 2013 1 Introduction In this lecture, we consider the problem of doing compilation backwards - that is, transforming
Formal Verification of Stack Manipulation in the SCIP Processor. J. Aaron Pendergrass
Formal Verification of Stack Manipulation in the SCIP Processor J. Aaron Pendergrass High Level Challenges to developing capability in formal methods: Perceived high barrier to entry, Specialized tools
Crafting a Compiler with C (II) Compiler V. S. Interpreter
Crafting a Compiler with C (II) 資科系 林偉川 Compiler V S Interpreter Compilation - Translate high-level program to machine code Lexical Analyzer, Syntax Analyzer, Intermediate code generator(semantics Analyzer),
Exam 2. CSC 121 MW Class. Lecturer: Howard Rosenthal. April 26, 2017
Your Name: Exam 2. CSC 121 MW Class Lecturer: Howard Rosenthal April 26, 2017 The following questions (or parts of questions) in numbers 1-7 are all worth 3 points each. 1. Answer the following as true
Scala in Martin Odersky
Scala in 2016 - Martin Odersky 2015 was on the quiet side Maturing tools: 2.11.x, IDEs, sbt Steady growth indeed.com jobs google trends In 2016, things will move again Scala 2.12 release Rethinking the
A Type System for Object Initialization In the Java TM Bytecode Language
Electronic Notes in Theoretical Computer Science 10 (1998) URL: http://www.elsevier.nl/locate/entcs/volume10.html 7 pages A Type System for Object Initialization In the Java TM Bytecode Language Stephen
Code Generation. Lecture 30
Code Generation Lecture 30 (based on slides by R. Bodik) 11/14/06 Prof. Hilfinger CS164 Lecture 30 1 Lecture Outline Stack machines The MIPS assembly language The x86 assembly language A simple source
Where We Are. Lexical Analysis. Syntax Analysis. IR Generation. IR Optimization. Code Generation. Machine Code. Optimization.
Where We Are Source Code Lexical Analysis Syntax Analysis Semantic Analysis IR Generation IR Optimization Code Generation Optimization Machine Code Where We Are Source Code Lexical Analysis Syntax Analysis
Slicing as a Program Transformation
Slicing as a Program Transformation MARTIN WARD Martin.Ward@durham.ac.uk De Montfort University and HUSSEIN ZEDAN zedan@dmu.ac.uk De Montfort University The aim of this paper is to provide a unified mathematical
Lecture 20: SW Testing Presented by: Mohammad El-Ramly, PhD
Cairo University Faculty of Computers and Information CS251 Software Engineering Lecture 20: SW Testing Presented by: Mohammad El-Ramly, PhD http://www.acadox.com/join/75udwt Outline Definition of Software
CS61C : Machine Structures
Get your clickers ready...! inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 3 Introduction to the C Programming Language (pt 1)!!Senior Lecturer SOE Dan Garcia!!!www.cs.berkeley.edu/~ddgarcia
The Sun s Java Certification and its Possible Role in the Joint Teaching Material
The Sun s Java Certification and its Possible Role in the Joint Teaching Material Nataša Ibrajter Faculty of Science Department of Mathematics and Informatics Novi Sad 1 Contents Kinds of Sun Certified
E-Book. Compatibility Doomsday: Discoverer, Microsoft and Java It s Only a Matter of Time. September 2017
E-Book Compatibility Doomsday: Discoverer, Microsoft and Java It s Only a Matter of Time September 2017 SplashBI 3079 Peachtree Industrial Blvd Duluth, GA 30097 www.splashbi.com info@splashbi.com It s
Life Cycle of Source Program - Compiler Design
Life Cycle of Source Program - Compiler Design Vishal Trivedi * Gandhinagar Institute of Technology, Gandhinagar, Gujarat, India E-mail: raja.vishaltrivedi@gmail.com Abstract: This Research paper gives
Software Development & Education Center. Java Platform, Standard Edition 7 (JSE 7)
Software Development & Education Center Java Platform, Standard Edition 7 (JSE 7) Detailed Curriculum Getting Started What Is the Java Technology? Primary Goals of the Java Technology The Java Virtual
Adam Chlipala University of California, Berkeley ICFP 2006
Modular Development of Certified Program Verifiers with a Proof Assistant Adam Chlipala University of California, Berkeley ICFP 2006 1 Who Watches the Watcher? Program Verifier Might want to ensure: Memory
Second-generation: Assembly language. Figure 6.1 Generations of programming languages. Assembly Language Characteristics.
Chapter 6: Programming Languages Computer Science: An Overview Eleventh Edition by J. Glenn Brookshear Chapter 6: Programming Languages 6.1 Historical Perspective 6.2 Traditional Programming Concepts 6.3
5 Object Oriented Analysis
5 Object Oriented Analysis 5.1 What is OOA? 5.2 Analysis Techniques 5.3 Booch's Criteria for Quality Classes 5.4 Project Management and Iterative OOAD 1 5.1 What is OOA? How to get understanding of what
Transparent Access to Legacy Data in Java. Olivier Gruber. IBM Almaden Research Center. San Jose, CA Abstract
Transparent Access to Legacy Data in Java Olivier Gruber IBM Almaden Research Center San Jose, CA 95120 Abstract We propose in this paper an extension to PJava in order to provide a transparent access
Topic IV. Block-structured procedural languages Algol and Pascal. References:
References: Topic IV Block-structured procedural languages Algol and Pascal Chapters 5 and 7, of Concepts in programming languages by J. C. Mitchell. CUP, 2003. Chapters 10( 2) and 11( 1) of Programming
CSE 374 Programming Concepts & Tools. Hal Perkins Spring 2010
CSE 374 Programming Concepts & Tools Hal Perkins Spring 2010 Lecture 12 C: structs, t linked lists, and casts Where we are We ve seen most of the basic stuff about C, but we still need to look at structs
Learning Outcomes. Extended OS. Observations Operating systems provide well defined interfaces. Virtual Machines. Interface Levels
Learning Outcomes Extended OS An appreciation that the abstract interface to the system can be at different levels. Virtual machine monitors (VMMs) provide a lowlevel interface An understanding of trap
Reengineering II. Transforming the System
Reengineering II Transforming the System Recap: Reverse Engineering We have a detailed impression of the current state We identified the important parts We identified reengineering opportunities We have
C - Basics, Bitwise Operator. Zhaoguo Wang
C - Basics, Bitwise Operator Zhaoguo Wang Java is the best language!!! NO! C is the best!!!! Languages C Java Python 1972 1995 2000 (2.0) Procedure Object oriented Procedure & object oriented Compiled
CSE450. Translation of Programming Languages. Lecture 11: Semantic Analysis: Types & Type Checking
CSE450 Translation of Programming Languages Lecture 11: Semantic Analysis: Types & Type Checking Structure Project 1 - of a Project 2 - Compiler Today! Project 3 - Source Language Lexical Analyzer Syntax
https://lambda.mines.edu Evaluating programming languages based on: Writability: How easy is it to write good code? Readability: How easy is it to read well written code? Is the language easy enough to
Chapter 6: Programming Languages
Chapter 6: Programming Languages Computer Science: An Overview Tenth Edition by J. Glenn Brookshear Copyright 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 6: Programming Languages
WACC Report. Zeshan Amjad, Rohan Padmanabhan, Rohan Pritchard, & Edward Stow
WACC Report Zeshan Amjad, Rohan Padmanabhan, Rohan Pritchard, & Edward Stow 1 The Product Our compiler passes all of the supplied test cases, and over 60 additional test cases we wrote to cover areas (mostly
A Partial Correctness Proof for Programs with Decided Specifications
Applied Mathematics & Information Sciences 1(2)(2007), 195-202 An International Journal c 2007 Dixie W Publishing Corporation, U. S. A. A Partial Correctness Proof for Programs with Decided Specifications
Compilers Project Proposals
Compilers Project Proposals Dr. D.M. Akbar Hussain These proposals can serve just as a guide line text, it gives you a clear idea about what sort of work you will be doing in your projects. Still need
Tutorial 1 Answers. Question 1
Tutorial 1 Answers Question 1 Complexity Software in it what is has to do, is often essentially complex. We can think of software which is accidentally complex such as a large scale e-commerce system (simple
3.0 Instruction Set. 3.1 Overview
3.0 Instruction Set 3.1 Overview There are 16 different P8 instructions. Research on instruction set usage was the basis for instruction selection. Each instruction has at least two addressing modes, with
The Isar Proof Language in 2016
The Isar Proof Language in 2016 Makarius Wenzel sketis.net August 2016 = Isabelle λ β Isar α Introduction History of Isar 1999: first usable version primary notion of proof document (not proof script )
Java TM. Multi-Dispatch in the. Virtual Machine: Design and Implementation. Computing Science University of Saskatchewan
Multi-Dispatch in the Java TM Virtual Machine: Design and Implementation Computing Science University of Saskatchewan Chris Dutchyn (dutchyn@cs.ualberta.ca) September 22, 08 Multi-Dispatch in the Java
Introduction to Programming Using Java (98-388)
Introduction to Programming Using Java (98-388) Understand Java fundamentals Describe the use of main in a Java application Signature of main, why it is static; how to consume an instance of your own class;
Testing Exceptions with Enforcer
Testing Exceptions with Enforcer Cyrille Artho February 23, 2010 National Institute of Advanced Industrial Science and Technology (AIST), Research Center for Information Security (RCIS) Abstract Java library
Chapter 3 (part 3) Describing Syntax and Semantics
Chapter 3 (part 3) Describing Syntax and Semantics Chapter 3 Topics Introduction The General Problem of Describing Syntax Formal Methods of Describing Syntax Attribute Grammars Describing the Meanings
Testing and Debugging C Programming and Software Tools. N.C. State Department of Computer Science
Testing and Debugging C Programming and Software Tools N.C. State Department of Computer Science Introduction Majority of software development is testing, debugging, and bug fixing The best software developers
Intermediate Code Generation
Intermediate Code Generation In the analysis-synthesis model of a compiler, the front end analyzes a source program and creates an intermediate representation, from which the back end generates target
CHAPTER 11 Refactoring
CHAPTER 11 Refactoring Introduction When, Why, What? Which Refactoring Tools? Demonstration: Internet Banking Iterative Development Life-cycle Prototype Consolidation: design review Expansion: concurrent
Topic IV. Parameters. Chapter 5 of Programming languages: Concepts & constructs by R. Sethi (2ND EDITION). Addison-Wesley, 1996.
References: Topic IV Block-structured procedural languages Algol and Pascal Chapters 5 and 7, of Concepts in programming languages by J. C. Mitchell. CUP, 2003. Chapter 5 of Programming languages: Concepts
Important Java terminology
1 Important Java terminology The information we manage in a Java program is either represented as primitive data or as objects. Primitive data פרימיטיביים) (נתונים include common, fundamental values as