{"title":"Verifying Semistructured Data Normalization Using PVS","authors":"S. Lee, Jing Sun, G. Dobbie, L. Groves","doi":"10.1109/ICECCS.2008.23","DOIUrl":"https://doi.org/10.1109/ICECCS.2008.23","url":null,"abstract":"The dramatic expansion of semistructured data has led to the development of database systems for manipulating the data. Despite its huge potential, there is still a lack of formality and verification support in the design of good semistructured databases. Like traditional database systems, developed semistructured database systems should contain minimal redundancies and update anomalies, in order to store and manage the data effectively. Several normalization algorithms have been proposed to satisfy these needs, by transforming the schema of the semistructured data into a better form. It is essential to ensure that the normalized schema remains semantically equivalent to its original form. In this paper, we present tool support for reasoning about the correctness of semistructured data normalization. The proposed approach uses the ORA-SS data modeling notation and defines its correctness criteria and rules in the PVS formal language. It further utilizes the PVS theorem prover to perform automated checking on the normalized schema, checking that functional dependencies are preserved, no data is lost and no spurious data is created. In summary, our approach not only investigates the characteristics of semistructured data normalization, but also provides a scalable and automated first step towards reasoning about the correctness of normalization algorithms on semistructured data.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116867960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Linking VDM and Z","authors":"J. Woodcock, Leo Freitas","doi":"10.1109/ICECCS.2008.36","DOIUrl":"https://doi.org/10.1109/ICECCS.2008.36","url":null,"abstract":"The International Grand Challenge in Verified Software is benchmarking current verification technology by conducting a series of experiments, and one such experiment is to build a verified POSIX-compliant flash filestore. An objective of this experiment is to combine different formal methods, and this raises issues about the different logics used. One significant area of difference is in the treatment of undefined expressions, and we show how this difference can be overcome using a unifying theory. This then allows us to use a theorem proverfor Z to verify theorems about a data type specified and refined in VDM.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128585582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Task Mapping in Heterogeneous MPSoCs for System Level Design","authors":"K. Vivekanandarajah, S. K. Pilakkat","doi":"10.1109/ICECCS.2008.18","DOIUrl":"https://doi.org/10.1109/ICECCS.2008.18","url":null,"abstract":"This paper investigates automatic mapping of application-to-architecture in heterogeneous Multi Processor System on a Chip (MPSoC), a key problem in system level design of embedded systems. An algorithm is proposed to optimally solve this application-to-architecture mapping problem. The proposed algorithm uses efficient branch-and-bound approach to partition the problem into sub problems and solves them. In addition, we also propose simple heuristics for generating good initial solution and bounds such that the convergence of branch and bound algorithm is fast. Our experiments with randomly generated benchmarks show that the proposed algorithm is efficient and able to map the application-to-architecture with less number of branching.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123956759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Revisiting Safe Realizability of Message Sequence Charts Specifications","authors":"A. Mousavi, B. Far","doi":"10.1109/ICECCS.2008.9","DOIUrl":"https://doi.org/10.1109/ICECCS.2008.9","url":null,"abstract":"Safe realizability of Message Sequence Charts (MSCs) specifications is a measure of whether or not there exists a distributed implementation of the specification such that it is deadlock free and shows exactly the behaviours specified in the specification. There are also some works that given a specification, can answer whether it is safely realizable or not. However, while these works are restricted by certain assumptions such as synchronous message passing in the system, they also cannot answer why given two specifications, one is safely realizable and the other is not. In this paper, we present a property of MSC specifications that explains implementation problems for them. Using this result, we show how we can effectively correct a specification to avoid implementation problems such as deadlocks and implied scenarios.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"520 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132195351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Semantic Web Services Challenge: Tackling Complexity at the Orchestration Level","authors":"T. Margaria","doi":"10.1109/ICECCS.2008.41","DOIUrl":"https://doi.org/10.1109/ICECCS.2008.41","url":null,"abstract":"The Semantic Web Services Challenge addresses since 2006 the issue of finding adequate domain modelling formalisms that help taming the complexity of service orchestration and service discovery. In this paper we examine the concrete settings, the dimensions of complexity that appear in the Challenge, and reflect on the essence of the observations so far.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123448121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"POSIX and the Verification Grand Challenge: A Roadmap","authors":"Leo Freitas, J. Woodcock, A. Butterfield","doi":"10.1109/ICECCS.2008.35","DOIUrl":"https://doi.org/10.1109/ICECCS.2008.35","url":null,"abstract":"We present a research roadmap for the second pilot project in the Verified Software Grand Challenge on formally verified POSIX file stores. The work is inspired by the requirements for NASA's forthcoming Mars Rover missions. The roadmap describes an integrated and comprehensive body of work, including current work, as well as further opportunities for collaboration.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128532371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dealing with AADL End-to-End Flow Latency with UML MARTE","authors":"Su-Young Lee, F. Mallet, R. Simone","doi":"10.1109/ICECCS.2008.14","DOIUrl":"https://doi.org/10.1109/ICECCS.2008.14","url":null,"abstract":"AADL and MARTE are both modeling formalisms supporting the analysis of real-time embedded systems. We investigate how MARTE, with its Time Model facilities, can be made to represent faithfully AADL periodic/aperiodic tasks communicating through event or data ports, in an approach to end-to-end flow latency analysis.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124958125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hai H. Wang, Nicholas Gibbins, T. Payne, Ahmed Saleh, Jun Sun
{"title":"A Formal Model of Semantic Web Service Ontology (WSMO) Execution","authors":"Hai H. Wang, Nicholas Gibbins, T. Payne, Ahmed Saleh, Jun Sun","doi":"10.1109/ICECCS.2008.25","DOIUrl":"https://doi.org/10.1109/ICECCS.2008.25","url":null,"abstract":"Semantic Web services have been one of the most significant research areas within the semantic Web vision, and have been recognized as a promising technology that exhibits huge commercial potential. Current semantic Web service research focuses on defining models and languages for the semantic markup of all relevant aspects of services, which are accessible through a Web service interface. The Web service modelling ontology (WSMO) is one of the most significant semantic Web service framework proposed to date. To support the standardization and tool support of WSMO, a formal semantics of the language is highly desirable. As there are a few variants of WSMO and it is still under development, the semantics of WSMO needs to be formally defined to facilitate easy reuse and future development. In this paper, we present a formal object-Z semantics of WSMO. Different aspects of the language have been precisely defined within one unified framework. This model provides a formal unambiguous specification, which can be used to develop tools and facilitate future development.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127649134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient Embedded Runtime Systems through Port Communication Optimization","authors":"P. Feiler","doi":"10.1109/ICECCS.2008.20","DOIUrl":"https://doi.org/10.1109/ICECCS.2008.20","url":null,"abstract":"Traditionally shared data areas have been used to efficiently communicate between embedded system tasks, such as periodically executing control system tasks. Such implementations are highly sensitive to the execution order of tasks, i.e., they depend on a static timeline. SAE AADL supports a port communication model that ensures deterministic processing of signal streams. In this paper we discuss an analytical framework that allows us to optimize such port-based communication by generating a runtime executive that utilizes shared data areas where appropriate, while ensuring the timing semantic assumed by the control application.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131794387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On Extracting Tests from a Testable Model in the Context of Domain Engineering","authors":"Soheila Bashardoust-Tajali, J. Corriveau","doi":"10.1109/ICECCS.2008.17","DOIUrl":"https://doi.org/10.1109/ICECCS.2008.17","url":null,"abstract":"Software testing is the traditional way to verify the functionality of a given software system against its requirements. In domain engineering, these requirements consist of variabilities and commonalities observed in a domain and captured in a domain model [5]. We remark that the latter may be used to obtain an elaborate design; however tests cannot be derived from it. This observation proceeds from the fact that testing techniques relevant to single-system engineering cannot deal with the variability intrinsic to a domain. Therefore, in the context of domain engineering, we claim that there is a need for a new modeling approach enabling domain testing. We have proposed elsewhere [1, 3, 4] a testable [2] domain model (based on the domain requirements) that takes the form of generative contracts. In this paper, we present a test extraction technique applicable to this testable model. This technique generates tests for validating behavioural aspects of an implemented member of the domain against that member's requirements. That is, upon selecting a specific member to test, the variability of domain tests is eliminated, resulting in member- specific tests, which are to be bound to artefacts of that member's corresponding implementation in order to obtain executable tests for this member. A case study on a domain-specific testable model will illustrate the steps of our proposed test extraction technique.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134429489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}