Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic -- Slicing Abstractions -- Nuovo DRM Paradiso: Towards a Verified Fair DRM Scheme -- Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata -- Is Your Security Protocol on Time ? -- Adapting the UPPAAL Model of a Distributed Lift System -- Zone-Based Universality Analysis for Single-Clock Timed Automata -- Compositional Semantics of System-Level Designs Written in SystemC -- Reusing Requirements: The Need for Extended Variability Models -- Test Selection Criteria for Quantifier-Free First-Order Specifications -- Formal Testing of Systems Presenting Soft and Hard Deadlines -- Automatic Composition of Stateless Components: A Logical Reasoning Approach -- A Model of Component-Based Programming -- Contract Based Multi-party Service Composition -- Regulating Data Exchange in Service Oriented Applications -- A Behavioural Congruence for Web Services -- Logic-Based Detection of Conflicts in Appel Policies -- Hoare Logic for ARM Machine Code -- Action Abstraction in Timed Process Algebra -- Type Abstractions of Name-Passing Processes -- Formal Specification of Multi-agent Systems by Using EUSMs -- Strong Safe Realizability of Message Sequence Chart Specifications -- Implication-Based Approximating Bounded Model Checking -- Logical Bisimulations and Functional Languages -- Efficient State Space Reduction for Automata by Fair Simulation -- Model Checking Temporal Metric Specifications with Trio2Promela -- Design and Implementation of a Dynamic-Reconfigurable Architecture for Protocol Stack -- Vulnerability Analysis in VGBPS Using Prolog -- An Alternative Algorithm for Constraint Automata Product -- A Review on Specifying SoftwareArchitectures Using Extended Automata-Based Models -- ArchC#: A New Architecture Description Language for Distributed Systems -- Relationships Meet Their Roles in Object Oriented Programming.

The present volume contains the post-proceedings of the second IPM Inter- tional Symposium on Fundamentals of Software Engineering (FSEN), Tehran, Iran, April 17-19, 2007. This event, FSEN 2007, was organized by the School of Computer Science at the Institute for Studies in Fundamental Sciences (IPM) in Iran, in cooperation with the ACM SIGSOFT and IFIP WG 2.2, and was additionally supported by the University of Tehran, Sharif University of Te- nology,andtheInternationalScienti?cMeetingsO?ce(ISMO).Thissymposium brought together researchers and practitioners working on di?erent aspects of formal methods in software engineering. FSEN 2007 covered many aspects of formal methods, especially those related to advancing the application of formal methods in the software industry and promoting their integrationwith practical engineering techniques. A truly international programcommittee of top researchersfrom 23 di?erent academic institutes in 9 countries selected the technical content of this sym- sium. We received a total of 73 submissions, out of which the PC selected 22 as regular papers and 8 as short papers to be published in the post-proceedings, and 6 papers accepted for poster presentations at the symposium. Each subm- sion was reviewed by at least 3 independent referees, for its quality, originality, contribution, clarity of presentation, and its relevance to the symposium topics. We had 93 registered participants at the symposium from 12 countries.