the proceedings contain 16 papers. the special focus in this conference is on Frontiers of Combining Systems. the topics include: Vampire with a Brain Is a Good ITP Hammer;optimization Modulo Non-linear Arithmetic via...
ISBN:
(纸本)9783030862046
the proceedings contain 16 papers. the special focus in this conference is on Frontiers of Combining Systems. the topics include: Vampire with a Brain Is a Good ITP Hammer;optimization Modulo Non-linear Arithmetic via Incremental Linearization;Quantifier Simplification by Unification in SMT;algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems;formal Analysis of Symbolic Authenticity;Formal Verification of a Java Component Using the RESOLVE Framework;non-disjoint Combined Unification and Closure by Equational Paramodulation;symbol Elimination and Applications to Parametric Entailment Problems;on the Copy Complexity of Width 3 Horn Constraint Systems;Restricted Unification in the DL FL0;combining Event Calculus and Description logic Reasoning via logicprogramming;semantic Forgetting in Expressive Description logics;improving Automation for Higher-Order Proof Steps;JEFL: Joint Embedding of Formal Proof Libraries.
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.
this paper analyzes the sensitivity of live standard logic gates (AND, OR, INV, NAND and NOR) to Single Event Transients (SETS). All gates have been designed in IHP's 130 nm bulk CMOS technology. the analysis Was ...
详细信息
ISBN:
(纸本)9781538625637
this paper analyzes the sensitivity of live standard logic gates (AND, OR, INV, NAND and NOR) to Single Event Transients (SETS). All gates have been designed in IHP's 130 nm bulk CMOS technology. the analysis Was conducted with SPICE simulations, employing the current injection concept to model the SET effects. the SET sensitivity of the investigated logic gates was evaluated in terms of critical charge. For each logic gate, the dependence of the critical charge on the input logic levels, size of target gate and size of load gate was investigated. Obtained results have shown that it is possible to establish a simple linear model for estimating the critical charge as a function of the sizing factors of target and load gates, for all investigated logic gates and all combinations of input logic levels. the model provides very: good accuracy compared to the results obtained by SPICE simulations. Integrating the proposed model into a high-level SET evaluation tool would allow to reduce the number of required circuit-level simulations for evaluating the SET robustness of complex digital circuits composed of standard logic gates.
this paper presents the first automatic method for learning and revising dynamic temporal theories in the full-fledged Discrete Event Calculus (DEC), where fluents may be temporarily released from the law of inertia a...
详细信息
ISBN:
(数字)9783030974541
ISBN:
(纸本)9783030974541;9783030974534
this paper presents the first automatic method for learning and revising dynamic temporal theories in the full-fledged Discrete Event Calculus (DEC), where fluents may be temporarily released from the law of inertia and subject to qualitative or quantitative domain laws. this is done by proposing a reformulation of the DEC, called the eXploratory Event Calculus (XEC), which can be more efficiently handled by state-of-the-art answer set solvers, and which supports a range of different logical semantics and policy options for resolving conflicts relating to the truth value or release status of fluents. the paper shows how XEC outperforms DEC on standard reasoning benchmarks, and how it can be used with an ILP system XHAIL to provide the first proof-of-principle demonstration of theory learning and revision in the full-featured DEC.
there is a vital link between students' engagement and their performance. Despite this, a dearth of studies exploring student engagement (especially cognitive) in computer programming, where high failure rates are...
详细信息
ISBN:
(纸本)9789869721493
there is a vital link between students' engagement and their performance. Despite this, a dearth of studies exploring student engagement (especially cognitive) in computer programming, where high failure rates are a norm. Interestingly, online environments capture fine-grained interactions;this data has the potential to detect students' cognitive engagement. the contribution of this paper is two-fold. Firstly, it introduces an online learning environment to learn and practice python programming called PyGuru and the data logged in the system. Secondly, we provide a preliminary analysis of students' interaction withthe system to reveal their level of cognitive engagement in different system components. the results of this study conducted for two weeks and 21 students demonstrate that students perform more actions that correspond to passive engagement than other levels of engagement.
the online judge is an established method of automatic assessment for programming tasks. Recognizing the relative lack of problems and resources for introductory- level programming classes, we present the ABC Workbook...
详细信息
ISBN:
(纸本)9786269689002
the online judge is an established method of automatic assessment for programming tasks. Recognizing the relative lack of problems and resources for introductory- level programming classes, we present the ABC Workbook project, a workbook containing a comparatively large selection of basic programming exercises, accompanied by an application written to check the exercises in the workbook. the contents of the workbook, an overview of the app, and strategies for integration in a class are discussed. the accessibility of the app for use in remote and developing areas is emphasized. the project is expected to improve introductory-level programming instruction, by facilitating immediate feedback and providing access to a bank of curated problems. Future work involves application in classrooms, as well as implementation of problem creation features.
Misuse or loss of web application data can have catastrophic consequences in today's Internet oriented world. Hence, verification of web application data models is of paramount importance. We have developed a fram...
详细信息
ISBN:
(纸本)9781509000258
Misuse or loss of web application data can have catastrophic consequences in today's Internet oriented world. Hence, verification of web application data models is of paramount importance. We have developed a framework for verification of web application data models via translation to First Order logic (FOL), followed by automated theorem proving. Due to the undecidability of FOL, this automated approach does not always produce a conclusive answer. In this paper, we investigate the use of many-sorted logic in data model verification in order to improve the effectiveness of this approach. Many-sorted logic allows us to specify type information explicitly, thus lightening the burden of reasoning about type information during theorem proving. Our experiments demonstrate that using many-sorted logic improves the verification performance significantly, and completely eliminates inconclusive results in all cases over 7 real world web applications, down from an 17% inconclusive rate.
this paper introduces a new constraint domain for reasoning about data with uncertainty. It extends convex modeling withthe notion of p-box to gain additional quantifiable information on the data whereabouts. Unlike ...
详细信息
this paper introduces a new constraint domain for reasoning about data with uncertainty. It extends convex modeling withthe notion of p-box to gain additional quantifiable information on the data whereabouts. Unlike existing approaches, the p-box envelops an unknown probability instead of approximating its representation. the p-box bounds are uniform cumulative distribution functions (cdf)in order to employ linear computations in the probabilistic domain. the reasoning by means of p-box cdf-intervals is an interval computation which is exerted on the real domain then it is projected onto the cdf domain. this operation conveys additional knowledge represented by the obtained probabilistic bounds. the empirical evaluation of our implementation shows that, with minimal overhead, the output solution set realizes a full enclosure of the data along with tighter bounds on its probabilistic distributions.
Withthe globalization of markets and the creation of software to address these markets, educators face new curriculum challenges. they must expose students not only to core science skills, but also to a number of oth...
详细信息
ISBN:
(纸本)0769526551
Withthe globalization of markets and the creation of software to address these markets, educators face new curriculum challenges. they must expose students not only to core science skills, but also to a number of other skills that will enable them to innovate effectively on a global stage. this position paper discusses the evolution of business models and software requirements over the last decade, and the associated changes to CS curricula that will enable today's CS students to become tomorrow's innovators.
this paper introduces and investigates a configurable source coupled logic (cSCL) by configuring the bulk connection of the PMOS load transistor. In the low-power mode configuration, the circuit operates hi weak inver...
详细信息
ISBN:
(纸本)9781538681671
this paper introduces and investigates a configurable source coupled logic (cSCL) by configuring the bulk connection of the PMOS load transistor. In the low-power mode configuration, the circuit operates hi weak inversion (Le. subthreshold) regime, hence, its bulk connection of the PMOS load transistor is connected to its drain. However, in the highspeed mode configuration, the circuit operates in strong inversion (i.e. above threshold) regime, hence, its bulk connection of the PMOS load transistor is connected to its source. We have designed a 3-input XOR gate using the standard CMOS, STSCL, SCL, and cSC1 using a 65 run CMOS technology. Simulations demonstrated that, by configuring the eSCL in the low-power mode, it can operate up to 4X faster than standard CMOS and by configuring the cSCL in the high-speed, it can provide a power reduction of 62.46% compared to the standard CMOS.
暂无评论