Posts Tagged ‘ reference

First papers collected and analyzed

While I am waiting for my wiki to be setup, I’m updating here my first week of work. I read lots of papers regarding dynamic car pooling and friends. Most of them are listed on this MIT website and on dynamicridesharing.org. The second site is maintained by Dan Kirshner, the author of three (unlucky) experiments regarding dynamic car pooling.
I actually selected 13 publications for my scope. I’m going to publish the list as soon as I’ve got my wiki. What I’m going to do is to review them, comparing my work with the excellent one done by Hannes Zimmerman and Yann Stempfel (Current Trends in Dynamic Ridesharing, identification of Bottleneck Problems and Propositions of Solutions).

Related posts

Introduction To Software Testing

Elements and Concepts – A brief overview


Download PDF version of the whole document. You can browse the article online but I encourage the download of the PDF since it is written with accuracy.


Introduction

This document contains some basic concepts and definitions about software testing. It has been written for studying a part of the Software Engineering Project course at my University. It is composed by a summary of the intersection of more than 10 different sources, all of which are cited. If you feel that some contents of this publication belong to your intellectual property and it is not cited, please contact the author who is willing to correct any mistake.

The first part of the paper focuses on the definition of the most important key aspects of software testing. Then some information about input partitioning are given. What follows is a research about code coverage and two useful and famous tools, Control-flow coverage and Data-flow analysis. A complete example on using those tools is then given. The second half of the document also contains the definition of the most important software testing practices.

The goal of this tiny document is to clarify key terms and therefore become a base start for the reader to go in deep with the interested topics. Another goal is to give a simple but clear example about data flow analysis, as I realized that not all the people understand the examples around the Net.

Software Testing

Software Testing is an empirical investigation conducted to provide stakeholders with information about the quality of the product or service under test, with respect to the context in which it is intended to operate. Software Testing also provides an objective, independent view of the software to allow the business to appreciate and understand the risks at implementation of the software. Test techniques include, but are not limited to, the process of executing a program or application with the intent of finding software bugs. It can also be stated as the process of validating and verifying that a software program/application/product meets the business and technical requirements that guided its design and development, so that it works as expected and can be implemented with the same characteristics. 1

Read more

Related posts

Heap vs. Stack in C++

After the study of pointers versus references, the second natural question that comes in head of a ex Java developer turning to C++ is:

“What are the difference between static and dynamic memory allocation in C++?”

which can be translated as:

“When should I use the stack and when do I have to use the heap in C++?”

that can be further simplified to:

“When should I use the new operator in C++?”

I could simply summarize the answer to: “Use stack when possible”, but I think that this time there is the need of more explanations. Let’s have the following model for a process in the system:

A simplified model for a process

A simplified model for a process

I’m not really interested in an real representation of a process (see Modern Operating Systems by A. S. Tanenbaum for a very good explanation on processes), but focus on the stack and on the heap.
In reality the heap is a software abstraction but you can also imagine it like the stack.
In C++ programs there are also several other memory areas in which objects and non-object values may be stored (see this article on GotW for further details).

Why then choose between stack or heap? Quoting my publication on object-oriented memory management in Java:

Stack-based variables have their extent determined by their scope, so the former is constrained by the structure of the code at compile-time .

Sometimes there is a need for the variables with unconstrained extent in order to cope with
problems where lifetime of a variable can only be known at run-time.
In this case heap-based variables, whose extent is strictly under control of the programmer, are used. [..]

I promise that I will update my 17 pages about OO-memory management to cover also C++ by the end of June. By the way, following some forums, wikipedia, my publication and GotW, I also summarized pros and cons of stack and heap use in C++:

Stack Heap
Its size is determined at compile-time Size determined at run-time
Therefore, it is less expensive and quick Therefore, it is more expensive and slower than stack
The preferred way to store objects and variables if their size is limited. To be used only if needed: the amount of memory needed is variable and unknown, and may increase rapidly.
There is an AUTOMATIC CLEANUP of objects when they go out of their scope Objects STAY IN MEMORY even when you don’t use them anymore.
Programmers don’t have to bother to free resources Therefore, programmers HAVE TO CLEAN memory manually. However, all modern OS free the resources when the program exits.

Update 2009-07-03
After 4 months of heavy GUI and Database C++ programming, here are my thoughts: if you are planning to write a program with something more than a couple of objects interacting, using associations and therefore, objects as attributes, use the heap. Every serious program, even if not really big, uses heap for object allocation. Just take care to delete the objects when you don’t need them anymore. Objects on the heap are dynamically allocated and it is more comfortable to pass them through other objects using pointers. The use of the heap assures the live of objects even if the method that generated them runs out of scope ( =dies ). If you also plan to write GUIs, solid toolkits like QT recommend the use of heap to create graphical objects.

In some Operating Systems, stack is also very limited while heap is usually not.

Here are listed the sources I used for writing this article:

  • http://www.velocityreviews.com/forums/t278261-stack-vs-heap.html
  • http://www.computing.net/answers/programming/stackheap-c/2293.html
  • http://www.codeguru.com/forum/showthread.php?p=1186307#post1186307
  • http://www.codeguru.com/forum/showthread.php?t=350945
  • http://www.gotw.ca/gotw/009.htm
  • http://en.wikipedia.org/wiki/Process_(computing)#Representation
  • http://bd-things.net/object-oriented-memory-management/

Hope that this article helped you to clearly understand the differences between stack and heap allocation in C++, write me if there are other issues or you need more explanations!

Related posts

Reference vs. Pointer

In Software Engineering Project course we need to learn some C++ to develop the project. A question that some programmers have when passing from Java to C++ (like me) is “Which are the differences between pointers and references?“. You can find a lot of answers around developers forum, but I summarized them in the following table. Glad if you found it useful!

Reference Pointer
is an object which IS AN ALIAS for another object is an object that CONTAINS THE ADRRESS IN MEMORY of another object
the preferred way of undirectly access objects you should use it just if you really need it, as it lets you to work in a lower level than a reference does
keeps your code clear the code is less clear but still understandable
it must be initialized when created you don’t have to initialize it when declared
it references to the one object and only that one, therefore you can not modify the address referenced because it contains an address, it can point to many different objects during lifetime. The address can be manipulated
when used, the address is dereferenced without using any particular operator the address must be dereferenced using the * operator

Related posts

Fedora 10, thank you very much! (macbook review and fixes)

I’ve never been a big fan of rpm-based Gnu/Linux distributions, since I’ve always preferred the stability of Debian and Debian based distros, with their great dpkg system.
The problem with Debian on Macbooks is that I do not see both the stability and performance anymore, as I have to use Lenny/Sid. Etch is too old and I don’t have the time (*sic*) to play with it to make it work well. Lenny should be next to be released but I don’t feel the very famous stability AND lightness of Debian distributions on this release, like I was accustomed in the past years. Is this because I own a Macbook? Maybe, but a Macbook Santa Rosa is nothing more than an Intel-powered notebook with some strange input devices and a strange non-bios system :-)

Regarding Ubuntu, I believe that this distribution has become naff and really slow. See this Slashdot discussion on this topic.

Yesterday I stumbled to Scientechie review of Fedora 10, which convinced me to try it out.
The software shipped with Fedora 10 is aligned with the one provided with the other distributions: Gnome 2.24.0, kernel 2.6.27.5, NetworkManager 0.7.0 (svn) and so on. Read the release notes for more information.

Fedora 10 really surprises me, as it is the first Gnu/Linux distribution in many, many years that makes me feel again the great stability and performance of the Penguin. Therefore I’m writing this review that is also a how-to, as it contains some fixes for Fedora 10 and Macbooks.

Read more

Related posts

How to install MintMenu on Debian (lenny, sid)

I really like (and miss) Linux Mint Menu (mintmenu), so I installed it on my Debian Sid box and here is how I managed it:

  • Install mintsystem and mintmenu deb packages, either by adding mint repository to yout sources.list file or by downloading them from mint packages or simplier, by grabbing them from my blog
  • Help it to recognize your applications by symlinking some files in /etc/xdg/menus (as root):

    ln -s gnome-applications.menu applications.menu
    ln -s gnome-preferences.menu preferences.menu
    ln -s gnome-settings.menu settings.menu

  • Add mintMenu to your Gnome panel..

et voilà! Here are the two deb files I’m using:
mintsystem_61_all
mintmenu_4.2_all

Here is an updated screenshot:
MintMenu complete under Debian Sid

MintMenu complete under Debian Sid

If you also want to enable beagle or tracker, be sure to add the correct search command in the preferences of mintMenu (see the screenshot)

Related posts