logically constrained rewrite systems (LCTRSs) are a versatile and efficient rewriting formalism that can be used to model programs from various programming paradigms, as well as simplification systems in compilers an...
详细信息
ISBN:
(纸本)9783030684457;9783030684464
logically constrained rewrite systems (LCTRSs) are a versatile and efficient rewriting formalism that can be used to model programs from various programming paradigms, as well as simplification systems in compilers and SMT solvers. In this paper, we investigate techniques to analyse the worst-case runtime complexity of LCTRSs. For that, we exploit synergies between previously developed decomposition techniques for standard term rewriting by Avanzini et al. in conjunction with alternating time and size bound approximations for integer programs by Brockschmidt et al. and adapt these techniques suitably to LCTRSs. Furthermore, we provide novel modularization techniques to exploit loop bounds from recurrence equations which yield sublinear bounds. We have implemented the method in TCT to test the viability of our method.
the paper provides a brief review of open source development hardware, based on microcontrollers and programmable logic integrated circuits with Field-Programmable Gate Arrays (FPGA) architecture. their main features ...
详细信息
Recent studies have proved the feasibility of ultra-low-precision (≤ 8-bit) training. However, most of the existing operational circuits support only a few higher precisions (FP16, FP32, etc.) for multiplication, and...
详细信息
the equational unification problem, where the underlying equational theory may be given as the union of component equational theories, appears often in practice in many fields such as automated reasoning, logic progra...
详细信息
ISBN:
(纸本)9783030684457;9783030684464
the equational unification problem, where the underlying equational theory may be given as the union of component equational theories, appears often in practice in many fields such as automated reasoning, logicprogramming, declarative programming, and the formal analysis of security protocols. In this paper, we investigate the unification problem in the non-disjoint union of equational theories via the combination of hierarchical unification procedures. In this context, a unification algorithm known for a base theory is extended with some additional inference rules to take into account the rest of the theory. We present a simple form of hierarchical unification procedure. the approach is particularly well-suited for any theory where a unification procedure can be obtained in a syntactic way using transformation rules to process the axioms of the theory. Hierarchical unification procedures are exemplified with various theories used in protocol analysis. Next, we look at modularity methods for combining theories already using a hierarchical approach. In addition, we consider a new complexity measure that allows us to obtain terminating (combined) hierarchical unification procedures.
Process variation has proven to be one of the higher impacting factors in modern Application-Specific Integrated Circuit (ASIC) flows Quality of Results (QoR). On the one hand, the excessive MOSFET shrinking, in combi...
详细信息
ISBN:
(数字)9781665490054
ISBN:
(纸本)9781665490054
Process variation has proven to be one of the higher impacting factors in modern Application-Specific Integrated Circuit (ASIC) flows Quality of Results (QoR). On the one hand, the excessive MOSFET shrinking, in combination withthe less potent metallization layers shrinking ability at cutting edge technology nodes, has rendered process variation effects more and more pronounced. On the other hand, the ever-increasing market competition between hi-tech semiconductor companies has promoted the adoption of immature, emerging technology nodes, which are not adequately calibrated for high yield in mass production. To cope withthese issues, the industry has adopted a test-calibrate-produce strategy, meaning that design-specific golden silicon data are obtained by relatively inexpensive test chip fabrication runs and then are used to calibrate the ASIC flow for highest possible yield on expensive mass production, accordingly. these golden data are typically used at the ASIC flow Back-End, i. e. Place & Route, Clock Tree Synthesis, In-Place Optimization, Sign-Off. In this work, we present a deterministic and a Monte-Carlo based methodology, capable of providing an insight of inter-wafer and intra-die process variation impact, at the post-synthesis gate level, to provide a better initial solution to the ASIC Back-End. Both methodologies were tested using four open-source designs for 4 different technology libraries at 250, 130, 40, and 7 nm, and yield 9.74% improvement in total cell area and 22.14% improvement in leakage power, on average, over netlists synthesized at worst case, while meeting worst-case timing for all libraries. Also, our Monte-Carlo methodology provides a predictive view on the random variation impact on netlists synthesized at typical corner.
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.
Internet-of-things (IoT) aims to connect billions of low-date rate and energy-constrained end-devices in the near future. Although many IoT systems have been commercialized, most of them focus on home and body scale a...
详细信息
ISBN:
(纸本)9781665482349
Internet-of-things (IoT) aims to connect billions of low-date rate and energy-constrained end-devices in the near future. Although many IoT systems have been commercialized, most of them focus on home and body scale applications. To establish a low-cost IoT at the city scale, LoRa Wide Area Networks (LoRaWAN) have become attractive in recent years due to their desirable kilometer or even longer communication distance with low energy consumption. However, due to the expensive cost of densely deploying end-nodes, the understanding of LoRa link behavior is still coarse-grained, and hard to fully realize the link dynamics, networking coverage, and localization accuracy of LoRaWAN in an urban environment. this paper shows a fine-grained LoRa link-level measurement via mobile end-nodes. We deploy two gateways and six mobile end-nodes and collect data packets over four months at a \n$6\\times 6\\ km^{2}$\n urban area. the evaluation mainly focuses on answering three questions: 1) Does a LoRa link stably perform in both spatial and temporal dimensions? 2) How large area can be covered for reliable communication by each gateway in the urban environment? 3) What accuracy can be achieved to localize an end-node through LoRa links? According to our measurement, our key findings are 1) the spatial and temporal behavior of LoRa links is quite dynamic due to the different types of land covers and the frequent micro-environment changes in the urban areas; 2) Each gateway can cover about 11.3 km\n2\n area and marginal SNR gains (e.g., 2 dB) of LoRa links are efficient enough to enlarge 32.6% coverage area of a gateway; and 3). the median localization error is about 400 m. Without densely deployed LoRa gateways, the SOTA LoRa localization can support road-level localization, even when an end node is close to one of the gateways.
this work proposes a machine learning approach for cell characterization of logic gates. Traditional electrical simulation-based characterization faces challenges related to foundry secrecy and runtime. the proposed f...
this work proposes a machine learning approach for cell characterization of logic gates. Traditional electrical simulation-based characterization faces challenges related to foundry secrecy and runtime. the proposed framework addresses these challenges by using machine learning models to estimate power consumption and propagation times. the experiments demonstrate the potential of the framework to predict different logic gate functions in different technology models, showing the feature extraction differences for bulk complementary metal–oxide–semiconductor, CMOS, and fin field-effect transistor, FinFET, devices. the results demonstrate the effectiveness of the Decision Tree algorithm in fast and accurate prediction of cell behavior, with inference times almost a thousand times faster than the traditional electrical simulation and a higher coefficient of determination than 95%.
Building trust in robots through social interactions has a major impact on user experience and adoption of robot technologies. the role of trust in such interactions is associated withthe persuasive influence a robot...
详细信息
ISBN:
(纸本)9781665404921
Building trust in robots through social interactions has a major impact on user experience and adoption of robot technologies. the role of trust in such interactions is associated withthe persuasive influence a robot has on humans. A persuasive attempt may decrease trusting attitudes towards robots if it leads to persuasive backfiring, which refers to the creation of an attitude change in a direction opposite to the one intended by the intervention. In order to explore persuasive backfiring in the context of Human-Robot Interaction, this research study tests the interaction between emotion and logic as elements present both in the attitudes to be influenced, and in the persuasive appeal delivered by a robot. Results indicate a significant backfiring effect when emotions are used to influence attitudes that are based on logic. this observation has practical design implications for persuasive robots, especially in high-stakes fields such as Psychotherapy and Urban Search and Rescue.
the paper presents a method for improvement a robotized manufacturing process of electronic devices. It includes statistical Failure Mode and Effects Analysis (FMEA), fuzzy logic and visual technique for results inter...
详细信息
暂无评论