Loading...
Search for:
specification-languages
0.005 seconds
A Z approach to formalization and validation of ORM models
, Article Communications in Computer and Information Science, 20 July 2011 through 22 July 2011 ; Volume 194 CCIS , July , 2011 , Pages 513-526 ; 18650929 (ISSN) ; 9783642226021 (ISBN) ; Mirian Hosseinabadi, S. H ; Springer ; Sharif University of Technology
2011
Abstract
In this paper we present a formal definition of the basic concepts and notations of Object Role Modeling (ORM) using the Z formal specification language. Most of ORM concepts such as object and relationship types, value types, objectification, reference schemes, sub-types, roles and constraints such as uniqueness, mandatory, cardinality, subset, equality, exclusive and ring constraints are specified formally. Population is specified as objects, relationships and roles instances. These are specified using Z axioms and diagram instances are specified using Z schemas. This would enable validation and reasoning on the formal properties of ORM diagrams such as detecting constraint contradictions...
Common Areas of Language Impairment in Persian-speaking Autistic Children
, M.Sc. Thesis Sharif University of Technology ; Khosravizadeh, Parvaneh (Supervisor)
Abstract
In qualitative content analysis research with the aim of identifying areas of language impairmenthigh-functioning Persian-speaking autistic children, ten subjects were observed during fifteen training sessions which were the cognitive block of a three-block training program. Each session lasted 90 minutes and was video recorded. Prior to this, focus group interviews with specialists and semi-structured interviews with mothers and parallel to that focus group interviews with mothers were handled all of which were audio recorded. After two levels of initial and second coding, a final list of areas of impairment in the language of high-functioning Persian-speaking autistic children, that...
Realizability of choreographies using Process algebra encodings
, Article IEEE Transactions on Services Computing ; Volume 5, Issue 3 , 2012 , Pages 290-304 ; 19391374 (ISSN) ; Bultan, T ; Roohi, N ; Sharif University of Technology
IEEE
2012
Abstract
Service-oriented computing has emerged as a new software development paradigm that enables implementation of Web accessible software systems that are composed of distributed services which interact with each other via exchanging messages. Modeling and analysis of interactions among services is a crucial problem in this domain. Interactions among a set of services that participate in a service composition can be described from a global point of view as a choreography. Choreographies can be specified using specification languages such as Web Services Choreography Description Language (WS-CDL) and visualized using graphical formalisms such as collaboration diagrams. In this paper, we present an...
Compositional failure-based semantic equivalences for Reo specifications
, Article ESEC/FSE 2007: 6th Joint Meeting - Sixth International Workshop on Specification and Verification of Component-Based Systems, SAVCBS 2007, Dubrovnik, 3 September 2007 through 4 September 2007 ; September , 2007 , Pages 99-100 ; 9781595937216 (ISBN) ; Movaghar, A ; Sharif University of Technology
2007
Abstract
Reo is a coordination language for modeling component connectors of component-based computing systems. We show that the failure-based equivalences NDFD and CFFD are congruences with respect to composition operators of Reo. Copyright 2007 ACM
A Tool For Generating Test Cases from Formal Specification of Programs
, M.Sc. Thesis Sharif University of Technology ; Mirian Hosseinabadi, Hassan (Supervisor)
Abstract
The use of formal methods in the software development process has many advantages. One of the benefits is extracting test cases from formal specification with test coverage criteia. In this study, we tried to extracting control flow graph form Z language. Using this graph and control flow graph coverage criteria, test cases are derived from Z. A tool to automate the generation of test cases from Z also produced. This tool uses the CZT, describing formal language Z receives and uses the standard graph covers, set of test cases stems. Using mutants, the proposed method was evaluated by this method was able to achieve a score of 92%
Nondeterminism in CZ Specification Language
, M.Sc. Thesis Sharif University of Technology ; Mirian Hossein Abadi, Hassan (Supervisor)
Abstract
Due to the high level abstraction inherent in most formal specifications and the need to formally specify and develop nondeterministic systems, such as concurrent, probabilistic, and game-like ones, nondeterminism comes into formal specifications inevitably. As it will be shown in this thesis, after developing programs constructively from implicitly nondeterministic specifications, which have been written in the CZ (constructive Z) specification language, only one of the allowable, specified behaviors will appear in final programs. In this way, the implementer will be provided with only one of the possible implementations that is not necessarily the best one. When the nondeterminism involved...
Component Based Translation of Z Specifications to Executable Code
, M.Sc. Thesis Sharif University of Technology ; Mirian-Hosseinabadi, Hassan (Supervisor)
Abstract
Automatic translation of a high-level specification language to an executable implementation would be highly useful in maximizing the benefits of formal methods. We will introduce a set of translation functions to fill the specification-implementation gap in the domain of database applications. We chose Z, SQL and Delphi languages to illustrate our methodology. We extend Delphi libraries to support mathematical objects exist in Z. Then, based on the extended libraries, we extract the translation functions from Z to Delphi. The translation functions from Z to SQL are more easily extracted, because the mathematical foundation of Z has many properties in common with SQL. Based on the extracted...
Generation of database schemas from Z specifications
, Article IEEE International Conference on Electro Information Technology, 15 May 2011 through 17 May 2011, Mankato, MN ; 2011 ; 21540357 (ISSN) ; Mirian Hosseinabadi, S. H ; IEEE Region 4 (R4) ; Sharif University of Technology
2011
Abstract
Automatic translation of a high-level specification language to an executable implementation would be highly useful in maximizing the benefits of formal methods. We will introduce a set of translation functions to fill the specification-implementation gap in the domain of database applications. Because the mathematical foundation of Z has many properties in common with SQL, a direct mapping from Z to SQL structures can be found. We derive a set of translation functions from Z to SQL for the generation of a database. The proposed methodology results in reducing the expenses and duration of the software development, and also, prevents the errors originated from the manual translation of...
A robust and efficient SIP authentication scheme
, Article Scientia Iranica ; Volume 17, Issue 1 D , June , 2010 , Pages 25-38 ; 10263098 (ISSN) ; Darmani, Y ; Jalili, R ; Nourani, M ; Sayad Haghighi, M ; Sharif University of Technology
2010
Abstract
The Session Initiation Protocol (SIP), which is becoming the de facto standard for the next-generation VoIP networks, is currently receiving much attention in many aspects. One aspect that was not deeply addressed in the original SIP is its authentication procedure. Apart from its security, an SIP authentication procedure should be efficient. This paper proposes a robust and efficient three-party SIP authentication protocol. In this protocol, the. end users are. authenticated with the proxy server in their domain using the. registrar server. Compared to previous works, our proposed protocol is more efficient and secure. To support our protocol with a formal security proof, its model is...
Rule-based translation of specifications to executable code
, Article ICIME 2010 - 2010 2nd IEEE International Conference on Information Management and Engineering, 16 April 2010 through 18 April 2010, Chengdu ; Volume 1 , 2010 , Pages 1-4 ; 9781424452644 (ISBN) ; Mirian Hosseinabadi, S. H ; Sharif University of Technology
2010
Abstract
It is well known that the use of formal methods in the software development process results in a high-quality software product. However, since formal approaches are just reasoning mechanisms, they do not offer defined ordered steps and guidance for moving between them. Refinement is a technique for moving between specifications but it bears very little resemblance to the real process of software design. An automatic translator from a specification language to an executable code would be highly useful in maximizing the benefits of formal methods. In the domain of database applications, we propose a rule-based algorithm to translate software requirements written in Z specifications to...
An approach for refining JML specification to object oriented code
, Article 2009 14th International CSI Computer Conference, 20 October 2009 through 21 October 2009 ; 2009 , Pages 1-9 ; 9781424442621 (ISBN) ; Mirian Hosseinabadi, S. H ; Sharif University of Technology
Abstract
JML is a behavioral interface specification language which has Java as its target implementation language. It combines the idea of using Java expressions from Eiffel language with the model-based approach to specify a program. Refinement calculus is a framework to produce executable code from a specification by preserving the correctness of programs. In this paper some constructs of JML concerning object creation, feature call, exceptional behavior and concurrency constructs are studied and some refinement rules are proposed to obtain an object oriented code in Java from a JML specification containig these constructs. The correctness of these rules is proved by weakest precondition predicate...
Model checking of component-based systems and coordination models
, Article 5th Doctoral Consortium on Enterprise Information Systems, DCEIS - In Conjunction with the 9th International Conference on Enterprise Information Systems, ICEIS 2007, Madeira, 12 June 2007 through 12 June 2007 ; 2007 , Pages 82-88 ; 9789898111043 (ISBN) ; Movaghar, A ; Sharif University of Technology
2007
Abstract
Reo is an exogenous coordination language for compositional construction of the coordinating subsystem of a component-based software. Constraint automaton is defined as the operational semantics of Reo. The main goal of this work is to prepare a model checking based verification environment for component-based systems, which their component connectors are modeled by Reo networks and Constraint Automata. We use compositional minimization and abstraction methods of model checking for verification of component-based systems and their component connectors modeled by Reo