Journal of Applied Logic最新文献

Formal analysis of SEU mitigation for early dependability and performability analysis of FPGA-based space applications 基于fpga的空间应用的早期可靠性和性能分析中SEU缓解的形式化分析

Journal of Applied Logic Pub Date : 2017-12-01 Epub Date: 2017-03-04 DOI: 10.1016/j.jal.2017.03.001

Khaza Anuarul Hoque , Otmane Ait Mohamed , Yvon Savaria

{"title":"Formal analysis of SEU mitigation for early dependability and performability analysis of FPGA-based space applications","authors":"Khaza Anuarul Hoque , Otmane Ait Mohamed , Yvon Savaria","doi":"10.1016/j.jal.2017.03.001","DOIUrl":"10.1016/j.jal.2017.03.001","url":null,"abstract":"<div>SRAM-based FPGAs are increasingly popular in the aerospace industry due to their field programmability and low cost. However, they suffer from cosmic radiation induced Single Event Upsets (SEUs). In safety-critical applications, the dependability of the design is a prime concern since failures may have catastrophic consequences. An early analysis of the relationship between dependability metrics, performability-area trade-off, and different mitigation techniques for such applications can reduce the design effort while increasing the design confidence. This paper introduces a novel methodology based on probabilistic model checking, for the analysis of the reliability, availability, safety and performance-area tradeoffs of safety-critical systems for early design decisions. Starting from the high-level description of a system, a Markov reward model is constructed from the Control Data Flow Graph (CDFG) and a component characterization library targeting FPGAs. The proposed model and exhaustive analysis capture all the failure states (based on the fault detection coverage) and repairs possible in the system. We present quantitative results based on an FIR filter circuit to illustrate the applicability of the proposed approach and to demonstrate that a wide range of useful dependability and performability properties can be analyzed using the proposed methodology. The modeling results show the relationship between different mitigation techniques and fault detection coverage, exposing their direct impact on the design for early decisions.</div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"25 ","pages":"Pages 47-68"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2017.03.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81814296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Natural deduction for bi-intuitionistic logic 双直觉逻辑的自然演绎

Journal of Applied Logic Pub Date : 2017-12-01 Epub Date: 2017-12-14 DOI: 10.1016/j.jal.2017.12.001

Luca Tranchini

引用次数: 5

The never-ending recursion 永无止境的递归

Journal of Applied Logic Pub Date : 2017-12-01 Epub Date: 2017-03-14 DOI: 10.1016/j.jal.2017.03.003

Sergio Mota

{"title":"The never-ending recursion","authors":"Sergio Mota","doi":"10.1016/j.jal.2017.03.003","DOIUrl":"10.1016/j.jal.2017.03.003","url":null,"abstract":"<div>This paper is devoted to three main aims: (I) to present the conceptual relations between recursion, on the one hand, and inductive definitions and mathematical induction, on the other; as well as among recursion and self-involvement. In order to receive the original and primary use of recursion in cognitive science, it is important to bear in mind the conceptual relations and distinctions between them. (II) To analyze the interpretation of recursion from two different approaches. The first one, mainly represented by Chomsky, emphasizes the origin of recursion in the formal sciences, and applies it to characterize the mechanical procedure which underlies the language faculty. On this view, recursion is a property of the mind/brain. The second one disregards this conception of recursion and redefines it in terms of either the processing of self-embedded structures (e.g. [20]) or the ability to represent multiple hierarchical levels using the same rule (e.g. [45]); or as follows: recursion refers to the ability to embed structures within structures of the same kind (e.g. [48]). (III) To discuss whether or not this change in the meaning of recursion is more suitable than the original one for empirical research.</div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"25 ","pages":"Pages 89-108"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2017.03.003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125654230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reprint of: A more general general proof theory 转载:一个更一般的一般证明理论

Journal of Applied Logic Pub Date : 2017-12-01 Epub Date: 2017-12-05 DOI: 10.1016/j.jal.2017.12.003

Heinrich Wansing

引用次数: 2

Assertion and denial: A contribution from logical notations 断言和否认:逻辑符号的贡献

Journal of Applied Logic Pub Date : 2017-12-01 Epub Date: 2017-11-13 DOI: 10.1016/j.jal.2017.01.001

Ahti-Veikko Pietarinen , Francesco Bellucci

引用次数: 0

Bilateralism does not provide a proof theoretic treatment of classical logic (for technical reasons) 双边主义没有提供经典逻辑的证明理论处理(出于技术原因)

Journal of Applied Logic Pub Date : 2017-12-01 Epub Date: 2017-12-02 DOI: 10.1016/j.jal.2017.11.001

Michael Gabbay

引用次数: 11

Logical Investigations on Assertion and Denial 断言与否认的逻辑研究

Journal of Applied Logic Pub Date : 2017-12-01 Epub Date: 2017-12-05 DOI: 10.1016/j.jal.2017.11.003

Massimiliano Carrara, Daniele Chiffi, Ciro De Florio

引用次数: 1

Iterated privation and positive predication 反复的贫困和积极的预测

Journal of Applied Logic Pub Date : 2017-12-01 Epub Date: 2017-12-02 DOI: 10.1016/j.jal.2017.12.004

Bjørn Jespersen , Massimiliano Carrara , Marie Duží

{"title":"Iterated privation and positive predication","authors":"Bjørn Jespersen , Massimiliano Carrara , Marie Duží","doi":"10.1016/j.jal.2017.12.004","DOIUrl":"10.1016/j.jal.2017.12.004","url":null,"abstract":"<div>The standard rule of single privative modification replaces privative modifiers by Boolean negation. This rule is valid, for sure, but also simplistic. If an individual a instantiates the privatively modified property (MF) then it is true that a instantiates the property of not being an F, but the rule fails to express the fact that the properties (MF) and F have something in common. We replace Boolean negation by property negation, enabling us to operate on contrary rather than contradictory properties. To this end, we apply our theory of intensional essentialism, which operates on properties (intensions) rather than their extensions. We argue that each property F is necessarily associated with an essence, which is the set of the so-called requisites of F that jointly define F. Privation deprives F of some but not all of its requisites, replacing them by their contradictories. We show that properties formed from iterated privatives, such as being an imaginary fake banknote, give rise to a trifurcation of cases between returning to the original root property or to a property contrary to it or being semantically undecidable for want of further information. In order to determine which of the three forks the bearers of particular instances of multiply modified properties land upon we must examine the requisites, both of unmodified and modified properties. Requisites underpin our presuppositional theory of positive predication. Whereas privation is about being deprived of certain properties, the assignment of requisites to properties makes positive predication possible, which is the predication of properties the bearers must have because they have a certain property formed by means of privation.</div>","PeriodicalId":54881,"journal":{"name":"Journal of Applied Logic","volume":"25 ","pages":"Pages S48-S71"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jal.2017.12.004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131487281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

A more general general proof theory 一个更普遍的证明理论

Journal of Applied Logic Pub Date : 2017-12-01 Epub Date: 2017-11-13 DOI: 10.1016/j.jal.2017.01.002

Heinrich Wansing

引用次数: 26

On assertion and denial in the logic for pragmatics 论语用学逻辑中的断言与否定

Journal of Applied Logic Pub Date : 2017-12-01 Epub Date: 2017-12-05 DOI: 10.1016/j.jal.2017.11.002

Massimiliano Carrara , Daniele Chiffi , Ciro De Florio

引用次数: 0