The formal-CAFE methodology and model checking patterns in the specification of e-commerce systems

Electronic commerce is an important application that has evolved significantly recently. However, electronic commerce systems are complex and difficult to be correctly designed. Guaranteeing the correctness of an e-commerce system is not an easy task due to the great amount of scenarios where errors occur, many of them very subtle. In this work we presents a methodology that uses formal-method techniques, specifically symbolic model checking, to design electronic commerce applications and to automatically verify them. Also, a model checking pattern hierarchy has been developed—it specifies patterns to construct and verify the formal model of e-commerce systems. We consider this research the first step to the development of a framework, which will integrate the methodology, an e-commerce specification language based on business rules, and a model checker. Adriano Pereira received the B.S. and M.S. degrees in computer science in 2000 and 2002, respectively, and he is currently pursuing the Ph.D. degree in computer science from the Federal University of Minas Gerais, Belo Horizonte, Brazil. His current interests are on performance analysis and modeling of e-business and distributed systems, and formal methods. Mark Song received the B.S., M.S. and Ph.D. degrees in computer science from the Federal University of Minas Gerais, Belo Horizonte, Brazil. His current interests are on distributed systems and formal methods – especially BMC (Bounded Model Checking). Gustavo Franco received the B.S. and M.S. degrees in computer science in 2001 and 2004, respectively, from the Federal University of Minas Gerais, Belo Horizonte, Brazil. His research was on modeling the user behavior of e-business and distributed systems, and formal methods. Actually his current interests are on software engeneering and project management of IT projects.     

数值方法确定地基承载力特征值的探讨

介绍了目前地基承载力的确定方法，研究了数值计算的可行性，并对其数值计算地基承载力的可靠性进行验证，指出应进一步完善确定地基承载力的方法，更好地解决群桩基础承载力的确定问题。     

Using SPIN to Analyse the Tree Identification Phase of the IEEE 1394 High-Performance Serial Bus (FireWire) Protocol

We describe how the tree identification phase of the IEEE 1394 high-performance serial bus (FireWire) protocol is modelled in Promela and verified using SPIN. The verification of arbitrary system configurations is discussed. Received July 2001/Accepted in revised form November 2002 Correspondence and offprint requests to: Alice Miller, Department of Computing Science, University of Glasgow, 17 Lilybank Gardens, Glasgow G12 8QQ, UK. Email: alice@dcs.gla.ac.uk     

掺杂WRe3、WRe25合金的高温电阻－温度特性

本文报导了采用一种新型高温陶瓷发热体高温管状炉，通以氩气保护，测量ＷＲｅ合金丝的电阻－温度（１６００℃）特性试验方法，该方法较真空炉简便、实用且试验费用低而准确，测量数据与美国研究报导一致。     

Introductory Paper

In today’s competitive market designing of digital systems (hardware as well as software) faces tremendous challenges. In fact, notwithstanding an ever decreasing project budget, time to market and product lifetime, designers are faced with an ever increasing system complexity and customer expected quality. The above situation calls for better and better formal verification techniques at all steps of the design flow. This special issue is devoted to publishing revised versions of contributions first presented at the 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME) held 21–24 October 2003 in L’Aquila, Italy. Authors of well regarded papers from CHARME’03 were invited to submit to this special issue. All papers included here have been suitably extended and have undergone an independent round of reviewing.     

MetateM: An introduction

In this paper a methodology for the use of temporal logic as an executable imperative language is introduced. The approach, which provides a concrete framework, calledMetateM, for executing temporal formulae, is motivated and illustrated through examples. In addition, this introduction provides references to further, more detailed, work relating to theMetateM approach to executable logics.     

An improved BioHashing for human authentication

Given the recent explosion of interest in human authentication, verification based on tokenized pseudo-random numbers and the user specific biometric feature (BioHashing) has received much attention. These methods have significant functional advantages over sole biometrics i.e. zero equal error rate. The main drawback of the base BioHashing method proposed in the literature relies in exhibiting low performance when an “impostor” B steals the pseudo-random numbers of A and he tries to authenticate as A. In this paper, we introduce some ideas to improve the base BioHashing approach in order to maintain a very low equal error rate when nobody steals the Hash key, and to reach good performance also when an “impostor” steals the Hash key.     

Two-class fingerprint matcher

We present a system for fingerprint verification that approaches the problem as a two-class pattern recognition problem. The features extracted by “FingerCode” are used to capture the ridge strength. This feature vector is then classified as genuine or impostor according to a novel approach to handle the fingerprint verification as a two-class problem. Moreover, we show that extracting the features from sub-images around the core permits to better represent the local information.     

处理器验证激励在线筛选技术

如何生成高质量的验证激励是功能验证中的核心问题之一.随着功能验证的不断进行,验证激励的有效性也随之降低.为了提高验证激励的质量,提出一种在线筛选技术来处理验证激励.该技术采用单分类支持向量机来在线地构建分类器,以对新生成的验证激励是否冗余进行预测,如果是冗余的,则不进入仿真阶段进行仿真.在此基础上,进一步提出指令序列核函数来衡量不同指令序列的相似程度.实验结果表明,与约束随机生成技术相比,文中技术可以减少约83%的验证激励及79%的验证时间.