Chunxiao Lin, Andrew McCreight, Zhong Shao, Yiyun Chen, Yu Guo
{"title":"Foundational Typed Assembly Language with Certified Garbage Collection","authors":"Chunxiao Lin, Andrew McCreight, Zhong Shao, Yiyun Chen, Yu Guo","doi":"10.1109/TASE.2007.28","DOIUrl":"https://doi.org/10.1109/TASE.2007.28","url":null,"abstract":"Type-directed certifying compilation and typed assembly language (TAL) aim to minimize the trusted computing base of safe languages by directly type-checking low-level machine code. However, the safety of TAL still heavily relies on its safe interaction with the underlying garbage collector. Based on a variant of foundational proof-carrying code (FPCC), we introduce a general methodology for combining foundational TAL with a certified garbage collector. We demonstrate the practicality of this approach by linking a typical TAL with a conservative garbage collector. This includes proving the safety of the collector, the soundness of TAL, and the safe interaction between TAL programs and the garbage collector. Our work is fully mechanized in the Coq proof assistant and the certified programs can be shipped immediately as FPCC packages.","PeriodicalId":306980,"journal":{"name":"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116972509","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":"Symmetry in Process Algebra","authors":"Jianmin Jiang, Jinzhao Wu, Hongping Shu","doi":"10.1109/TASE.2007.49","DOIUrl":"https://doi.org/10.1109/TASE.2007.49","url":null,"abstract":"An original notion of symmetry for process algebra is defined, which is based on permutation groups. Given a process which is regarded as a structure and a permutation group on it, the quotient process (reduced process) is showed to be interleaving trace equivalent and interleaving bisimulation equivalent to the original process. Furthermore, an algorithm and two examples for this symmetric reduction are presented.","PeriodicalId":306980,"journal":{"name":"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121039893","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":"A Formal Derivation of Grover's Quantum Search Algorithm","authors":"P. Zuliani","doi":"10.1109/TASE.2007.3","DOIUrl":"https://doi.org/10.1109/TASE.2007.3","url":null,"abstract":"In this paper we aim at applying established formal methods techniques to a recent software area: quantum programming. In particular, we aim at providing a stepwise derivation of Grover's quantum search algorithm. Our work shows that, in principle, traditional software engineering techniques such as specification and refinement can be applied to quantum programs. We have chosen Grover's algorithm as an example because it is one of the two main quantum algorithms. The algorithm can find with high probability an element in an unordered array of length L in just O(radicL) steps (while any classical probabilistic algorithm needs Omega(L) steps). The derivation starts from a rigorous probabilistic specification of the search problem, then we stepwise refine that specification via standard refinement laws and quantum laws, until we arrive at a quantum program. The final program will thus be correct by construction.","PeriodicalId":306980,"journal":{"name":"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115583202","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":"Realizing Live Sequence Charts in SystemVerilog","authors":"Hai H. Wang, S. Qin, Jun Sun, J. Dong","doi":"10.1109/TASE.2007.41","DOIUrl":"https://doi.org/10.1109/TASE.2007.41","url":null,"abstract":"The design of an embedded control system starts with an investigation of properties and behaviors of the process evolving within its environment, and an analysis of the requirement for its safety performance. In early stages, system requirements are often specified as scenarios of behavior using sequence charts for different use cases. This specification must be precise, intuitive and expressive enough to capture different aspects of embedded control systems. As a rather rich and useful extension to the classical message sequence charts, live sequence charts (LSC), which provide a rich collection of constructs for specifying both possible and mandatory behaviors, are very suitable for designing an embedded control system. However, it is not a trivial task to realize a high-level design model in executable program codes effectively and correctly. This paper tackles the challenging task by providing a mapping algorithm to automatically synthesize SystemVerilog programs from given LSC specifications.","PeriodicalId":306980,"journal":{"name":"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122293294","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":"Foundational certification of data-flow analyses","authors":"M. J. Frade, Ando Saabas, Tarmo Uustalu","doi":"10.1109/TASE.2007.27","DOIUrl":"https://doi.org/10.1109/TASE.2007.27","url":null,"abstract":"Data-flow analyses, such as live variables analysis, available expressions analysis etc., are usefully specifiable as type systems. These are sound and, in the case of distributive analysis frameworks, complete wrt. appropriate natural semantics on abstract properties. Applications include certification of analyses and \"optimization\" of functional correctness proofs alongside programs. On the example of live variables analysis, we show that analysis type systems are applied versions of more foundational Hoare logics describing either the same abstract property semantics as the type system (liveness states) or a more concrete natural semantics on transition traces of a suitable kind (future defs and uses). The rules of the type system are derivable in the Hoare logic for the abstract property semantics and those in turn in the Hoare logic for the transition trace semantics. This reduction of the burden of trusting the certification vehicle can be compared to foundational proof-carrying code, where general-purpose program logics are preferred to special-purpose type systems and universal logic to program logics. We also look at conditional liveness analysis to see that the same foundational development is also possible for conditional data-flow analyses proceeding from type systems for combined \"standard state and abstract property\" semantics.","PeriodicalId":306980,"journal":{"name":"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116300456","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":"Generation of optimal finite test suites for timed systems","authors":"Mercedes G. Merayo, M. Núñez, Ismael Rodríguez","doi":"10.1109/TASE.2007.29","DOIUrl":"https://doi.org/10.1109/TASE.2007.29","url":null,"abstract":"One of the main problems to test timed systems is that the tester has to decide when to apply the next input to the system under test. Even though the tester could determine good sequences of inputs to find a big variety of errors, the quality of the test suite usually depends on the time when the different parts of the sequences are applied. In this paper we give a formal methodology to provide good time values to test timed systems. These values are computed by taking into account the time stability of the system, that is, if the system is more likely to remain in its current internal state during a given time interval then no input will be applied during that period. In other words, our method will (probabilistically) find those time values that are closer to a change of state in the system, being these values more suitable to apply the appropriate input to the system.","PeriodicalId":306980,"journal":{"name":"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133950653","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":"Model Checking Networked Programs in the Presence of Transmission Failures","authors":"Cyrille Artho, Christian Sommer, S. Honiden","doi":"10.1109/TASE.2007.33","DOIUrl":"https://doi.org/10.1109/TASE.2007.33","url":null,"abstract":"Software model checkers work directly on single-process programs, but not on multiple processes. Conversion of processes into threads, combined with a network model, allows for model checking distributed applications, but does not cover potential communication failures. This paper contributes a fault model for model checking networked programs. If a naive fault model is used, spurious deadlocks may appear, because certain processes are terminated before they can complete a necessary action. Such spurious deadlocks have to be suppressed, as implemented in our model checker extension. Our approach found several faults in existing applications, and scales well because exceptions generated by our tool can be checked individually.","PeriodicalId":306980,"journal":{"name":"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128937739","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":"Consistency and Minimality of UML Class Specifications with Multiplicities and Uniqueness Constraints","authors":"Ingo Feinerer, G. Salzer","doi":"10.1109/TASE.2007.17","DOIUrl":"https://doi.org/10.1109/TASE.2007.17","url":null,"abstract":"The Unified Modeling Language (UML) has become a universal tool for the formal object-oriented specification of hard- and software. In particular, UML class diagrams and so-called multiplicities, which restrict the number of links between objects, are essential when using UML for applications like the specification of admissible configurations of components. In this paper we give a formal definition of the semantics of UML class diagrams and multiplicities. We extend results obtained in the context of entity relationship diagrams to cover UML specific extensions like the (non-)uniqueness attribute of binary associations. We show that the consistency of such specifications can be checked in polynomial time, and give an algorithm for computing minimal configurations (models). The core of our approach is a translation of UML class diagrams to Diophantine inequations.","PeriodicalId":306980,"journal":{"name":"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124233751","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":"QoS-Driven Service Composition Modeling with Extended Hierarchical CPN","authors":"Wen J. Li, X. Liang, Hua-mei Song, Xiao-cong Zhou","doi":"10.1109/TASE.2007.39","DOIUrl":"https://doi.org/10.1109/TASE.2007.39","url":null,"abstract":"Quality of service (QoS) plays an important role in the composition of services. A colored Petri net (CPN) based approach is proposed to model and analyze QoS-driven service composition in a service-oriented architecture (SOA), where all services are considered as dynamic joining and quitting resources. Modeling with an extension of the hierarchical CPN, which is named QSC-net, the QoS-driven features are expressed in the service composition model explicitly, along with the dynamic change of service resources and the uncertain execution of composition processes at runtime. QSC-nets support not only the classical property analysis provided by CPN tools, but also new properties concerning the maximal concurrency of services in the composition model. Compared with existing Petri net based modeling approaches, QSCnets are specially suitable for the modeling and analysis of service composition in a dynamic environment, such as a virtual organization (VO) defined by grid computing.","PeriodicalId":306980,"journal":{"name":"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126323438","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}
E. Turner, M. Leuschel, Corinna Spermann, M. Butler
{"title":"Symmetry Reduced Model Checking for B","authors":"E. Turner, M. Leuschel, Corinna Spermann, M. Butler","doi":"10.1109/TASE.2007.50","DOIUrl":"https://doi.org/10.1109/TASE.2007.50","url":null,"abstract":"Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (orbit) of symmetric states. This paper presents a framework for symmetry reduced model checking of B machines, which verifies a unique representative from each orbit. Symmetries are induced by the deferred set; a key component of the B language. This contrasts with strategies that require the introduction of a special data type into a language, to indicate symmetry. An extended version of the graph isomorphism program, nauty, is used to detect symmetries, and the symmetry reduction package has been integrated into the PROB model checker. Relevant algorithms are presented, and experimental results illustrate the effectiveness of the method, where exponential speedups are sometimes possible.","PeriodicalId":306980,"journal":{"name":"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114154918","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}