this paper presents behavior contracts as a new assertion mechanism and a tool that uses such contracts to support the testing of object-oriented (OO) systems. A behavior contract models how the scenarios for performi...
详细信息
this paper presents behavior contracts as a new assertion mechanism and a tool that uses such contracts to support the testing of object-oriented (OO) systems. A behavior contract models how the scenarios for performing a designated task are expected to be implemented. Based on this contract, our tool can automatically monitor the program execution for checking important properties related to these scenarios. this capability can help testers to determine whether the scenarios have been implemented correctly. Our tool can also collect test coverage information w.r.t. the scenarios modeled by a behavior contract. Such information can be used to direct the testing efforts towards the less-covered scenarios, and to determine whether the implementation of these scenarios has been adequately tested. therefore, using this tool should improve boththe efficiency and effectiveness of testing OO systems
Parallel load counters are a specific category of counters that offer the flexibility of being loaded with any desired sequence. While counters are usually described as basic building blocks in textbooks, current rese...
Parallel load counters are a specific category of counters that offer the flexibility of being loaded with any desired sequence. While counters are usually described as basic building blocks in textbooks, current research efforts are focused on enhancing their efficiency in terms of power consumption, area utilization, and propagation delay. this study introduces three innovative implementations of parallel load counters that are optimized for power, delay, and area based on two well-established textbook approaches. the optimization methods employed in this work utilize logic minimization of the textbook counters and incorporate the use of True Single-Phase Clock-FlipFlops (TSPCFF) instead of conventional registers to further enhance efficiency. Post-layout simulations employing 180nm CMOS technology demonstrate that the proposed counters achieve $\sim 3.4 \times$ lower power consumption, $\sim 2 \times$ higher maximum frequency, $\sim 4.9 \times$ reduced latency and $\sim 2 \times$ smaller area footprint compared to the traditional methods. In addition, the proposed solutions are less susceptible to noise caused by the supply voltage and temperature fluctuations. We believe that this study serves as a valuable reference for circuit designers to further optimize design efficiency and meet specific requirements.
Software development is a highly collaborative activity that requires teams of developers to continually manage and coordinate their programming tasks. In this paper, we describe an empirical study that explored how t...
详细信息
Software development is a highly collaborative activity that requires teams of developers to continually manage and coordinate their programming tasks. In this paper, we describe an empirical study that explored how task annotations embedded within the source code play a role in how software developers manage personal and team tasks. We present findings gathered by combining results from a survey of professional software developers, an analysis of code from open source projects, and interviews with software developers. Our findings help us describe how task annotations can be used to support a variety of activities fundamental to articulation work within software development. We describe how task management is negotiated between the more formal issue tracking systems and the informal annotations that programmers write within their source code. We report that annotations have different meanings and are dependent on individual, team and community use. We also present a number of issues related to managing annotations, which may have negative implications for maintenance. We conclude with insights into how these findings could be used to improve tool support and software process.
Test-driven software development tackles the problem of operationally defining the features to be implemented by means of test cases. this approach was recently ported to the early development phase, when requirements...
详细信息
Test-driven software development tackles the problem of operationally defining the features to be implemented by means of test cases. this approach was recently ported to the early development phase, when requirements are gathered and clarified. Among the existing proposals, Fit (Framework for Integrated Testing) supports the precise specification of requirements by means of so called Fit tables, which express relevant usage scenarios in a tabular format, easily understood also by the customer. Fit tables can be turned into executable test cases through the creation of pieces of glue code, called fixtures. In this paper, we test the claimed benefits of Fit through a series of three controlled experiments in which Fit tables and related fixtures are used to clarify a set of change requirements, in a software evolution scenario. Results indicate improved correctness achieved with no significant impact on time, however benefits of Fit vary in a substantial way depending on the developers' experience. Preliminary results on the usage of Fit in combination with pair programming revealed another relevant source of variation.
[Context and motivation] Successful human-robot collaboration requires that humans can express their requirements and that they comprehend the decisions that robots make. Requirements in this context are often related...
详细信息
the proceedings contain 30 papers. the special focus in this conference is on Rigorous State-Based Methods. the topics include: Proof Construction and Checking on Evolving Abstract State Machines;Modelling a...
ISBN:
(纸本)9783031637896
the proceedings contain 30 papers. the special focus in this conference is on Rigorous State-Based Methods. the topics include: Proof Construction and Checking on Evolving Abstract State Machines;Modelling and Analysing a Mechanical Lung Ventilator in mCRL2;Real-Time CCSL: Application to the Mechanical Lung Ventilator;the Mechanical Lung Ventilator Case Study;designing Exception Handling Using Event-B;Verifying HyperLTL Properties in Event-B;thoR: An Alloy5-Like DSL for Interactive theorem Proving in Coq;Event-B as DSL in Isabelle and HOL Experiences from a Prototype;meta-programming Event-B: Advancing Tool Support and Language Extensions;multi-model Animation with JeB;using Symbolic Execution to Transform Turbo Abstract State Machines into Basic Abstract State Machines;semantics Formalisation – From Event-B Contexts to theories;Property Ownership Formal Modelling Using Event-B and iUML-B;an Analysis of the Impact of Field-Value Instance Navigation in Alloy’s Model Finding;modal Extensions of the logic of Abstract State Machines;loose Observation in Event-B;a Lean Reflective Abstract State Machine Definition;transpilation of Petri-nets into B: Shallow and Deep Embeddings;event-B Development of Modelling Human Intervention Request in Self-driving Vehicle Systems;formal Modeling and Analysis of Apache Kafka in Alloy 6;formal Methods and Tools Applied in the Railway Domain;preface;from Event-B to Lambdapi;FRETting and Formal Modelling: A Mechanical Lung Ventilator;Modelling a Mechanical Lung Ventilation System Using TASTD;an Event-B Model of a Mechanical Lung Ventilator;small Step Incremental Verification of Compilers;a Modeling and Verification Framework for Ethereum Smart Contracts.
We consider the 2-Catalog Segmentation problem (2-CatSP) introduced by Kleinberg et al. [J. Kleinberg, C. Papadimitriou and P. Raghavan (1998). Segmentation problems. In Proceedings of the 30th Symposium on theory of ...
详细信息
We consider the 2-Catalog Segmentation problem (2-CatSP) introduced by Kleinberg et al. [J. Kleinberg, C. Papadimitriou and P. Raghavan (1998). Segmentation problems. In Proceedings of the 30th Symposium on theory of Computation , pp. 473-482.], where we are given a ground set I of n items, a family {S-1, S-2,...,S-m } of subsets of I and an integer 1 less than or equal to k less than or equal to n . the objective is to find subsets A(1), A(2) subset of I such that \A(1)\ = \A(2)\ = k and Sigma(i=1)(m) max {\S-i boolean AND A(1)\, \S-i boolean AND A(2)\} is maximized. It is known that a simple and elegant greedy algorithm has a performance guarantee 1/2. Furthermore, using a semidefinite programming (SDP) relaxation Doids et al. [Y. Doids, V. Guruswami and S. Khanna (1999). the 2-catalog segmentation problem. In Proceedings of SODA , pp. 378-380.] showed that 2-CatSP can be approximated by a factor of 0.56 when k = n/2. Motivated by these results, we develop improved approximation algorithms for 2-CatSP on a range of k in this paper. the performance guarantee of our algorithm is 1/2 for general k , and is strictly greater than 1/2 when k greater than or equal to n /3. In particular, we obtain a ratio of 0.67 for 2-CatSP when k = n/2. Unlike the relaxation used by Doids et al. , our extended and direct SDP relaxation deals with general k , which enables us to obtain better approximation for 2-CatSP. Another contribution of this paper is a new variation of the random hyperplane rounding technique, which allows us to explore the structure of 2-CatSP. this rounding technique might be of independent interest. It can be also used to obtain improved approximation for several other graph partitioning problems considered in Feige and Langberg [U. Fiege and M. Langberg (2002). Approximation algorithms for maximization problems arising in graph partitioning. Journal of Algorithm .], Ye and Zhang [Y. Ye and J. Zhang (2003). Approximation for dense-n/2-subgraph and the complemen
Mobile Ad Hoc Networks (MANET) are characterized by a highly dynamic topology as a consequence of the frequent and unpredictable changes in the link states. Routing protocols must cope withthis eventuality so when ro...
详细信息
Mobile Ad Hoc Networks (MANET) are characterized by a highly dynamic topology as a consequence of the frequent and unpredictable changes in the link states. Routing protocols must cope withthis eventuality so when routes in use break, they should discover alternative paths to keep the on-going communications active. the procedures to discover new routes commonly provoke a significant amount of control packets which may induce losses and delay to the data packets. therefore, the network performance could benefit from the techniques that avoid these route discovery procedures. In this sense, a practical strategy is the use of the links that are expected to endure longer. Basing on an analytical model, this paper presents a technique to identify the most stable links. the evaluation in an autonomous MANET connected to the Internet shows the goodness of the proposed criterion.
We present a new approach for real-time, specific and sensitive detection of insulin using a graphene aptameric nanosensor. the nanosensor is configured as a graphene field effect transistor, where the graphene conduc...
详细信息
ISBN:
(纸本)9781509050796
We present a new approach for real-time, specific and sensitive detection of insulin using a graphene aptameric nanosensor. the nanosensor is configured as a graphene field effect transistor, where the graphene conducting channel was functionalized with a guanine-rich aptamer IGA3 that would form an anti-parallel G-quadruplex upon insulin binding. the aptamer conformational changes altered the electrical conductance of graphene by varying the carrier density of the graphene. the nanosensor allowed us to perform real-time, label-free and specific detection of insulin concentrations as low as 1 nM.
暂无评论