| G. Serban, G.S. Moldovan, A Graph Algorithm for Identification of Crosscutting Concerns | 3 |
| L. Samuelis, C. Szabo, Notes on the Role of the Incrementality in Software Engineering | 11 |
| A. Campan, T.M. Truta, Extended p-Sensitive k-Anonymity | 19 |
| D. Tatar, M. Frentiu, Recognizing Textual Entailment by Theorem Proving Approach | 31 |
| Z. Katai, Dynamic Programming and d-Graphs | 41 |
| G.S. Moldovan, G. Serban, A Study on Distance Metrics for Partitioning Based Aspect Mining | 53 |
| N.E. Mouhoub, H. Belouadah, A. Boubetra, Algorithme de Construction d’un Graphe Pert a Partir d’un Graphe des Potentiels Donne | 61 |
| A. Sabau, Indexing Mobile Objects Using BrickR Structures | 71 |
| A. Tarta, S. Motogna, Operational Semantics of Task Models | 81 |
| M. Lupea, Sequent Calculus in Computing Default Extensions | 93 |
| I. Lazar, D. Cojocar, On Model-Driven Development for Web Applications | 101 |