Alireza Rouhi
Alireza received his B.Sc. degree in Software Engineering from Kharazmi University of Tehran in September, 2000. Then he continued the M.Sc. degree in Software Engineering at the Sharif University of Technology in Tehran and graduated in June, 2004. He accepted to University of Isfahan as a Software Engineering Ph.D. student in September 2011. And finally, under supervision of Dr. Bahman Zamani, he graduated in September 02, 2017.
Supervisors: Dr. Bahman Zamani
Supervisors: Dr. Bahman Zamani
less
Uploads
Objective: Based on the algebra of design patterns, we aimed at presenting a new formalism for patterns and PLs.
Method: We revised and extended the Graphic extension of EBNF (GEBNF) and applied it to model Unified Modeling Language (UML) class and sequence diagrams which are required to model the popular design patterns. Also, we presented the formal semantics of commonly used patterns’ inter-relationships which pave the way for presenting our PL formalism. To show the applicability of our presented formalism on patterns and PLs, we presented the formal model of the Broker PL as a case study.
Results: Use of the presented formalism to model patterns and PLs will make them more expressive, readable, and understandable as well.
Conclusion: We have proposed a formalism for defining a PL in a more accurate manner. This formalism facilitates formal verification of patterns and PLs, particularly when it is intended to build a tool for such verification.
Keywords:
Formal modeling
Revised and extended GEBNF
Design patterns
Patterns’ inter-relationships
Pattern languages
Objective: Based on the algebra of design patterns, we aimed at presenting a new formalism for patterns and PLs.
Method: We revised and extended the Graphic extension of EBNF (GEBNF) and applied it to model Unified Modeling Language (UML) class and sequence diagrams which are required to model the popular design patterns. Also, we presented the formal semantics of commonly used patterns’ inter-relationships which pave the way for presenting our PL formalism. To show the applicability of our presented formalism on patterns and PLs, we presented the formal model of the Broker PL as a case study.
Results: Use of the presented formalism to model patterns and PLs will make them more expressive, readable, and understandable as well.
Conclusion: We have proposed a formalism for defining a PL in a more accurate manner. This formalism facilitates formal verification of patterns and PLs, particularly when it is intended to build a tool for such verification.
Keywords:
Formal modeling
Revised and extended GEBNF
Design patterns
Patterns’ inter-relationships
Pattern languages