Results 51 to 60 of about 2,358,795 (346)
Verification of Programs via Intermediate Interpretation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We explore an approach to verification of programs via program transformation applied to an interpreter of a programming language. A specialization technique known as Turchin's supercompilation is used to specialize some interpreters with respect to the ...
Alexei P. Lisitsa, Andrei P. Nemytykh
doaj +1 more source
Ordered Navigation on Multi-attributed Data Words [PDF]
, 2014 We study temporal logics and automata on multi-attributed data words. Recently, BD-LTL was introduced as a temporal logic on data words extending LTL by navigation along positions of single data values. As allowing for navigation wrt.
Decker, Normann +3 more
core +1 more source
Languages of Dot-depth One over Infinite Words [PDF]
, 2011 Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential first-order logic.
Kufleitner, Manfred, Lauser, Alexander
core +1 more source
Analysis of the intermediate quantifier "Many" in fuzzy natural logic
Conference of International Fuzzy Systems Association and European Society for Fuzzy Logic and Technology, 2015 In the previous papers, we introduced a general principle for an introduction of new intermediate quantifiers and proved that generalized square of opposition works with them accordingly.
Petra Murinová, V. Novák
semanticscholar +1 more source
Flexible coinductive logic programming [PDF]
Theory and Practice of Logic Programming, 2020 Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations, necessary in some ...
Francesco Dagnino, D. Ancona, E. Zucca
semanticscholar +1 more source
Horn Clauses as an Intermediate Representation for Program Analysis and Transformation [PDF]
, 2015 Many recent analyses for conventional imperative programs begin by transforming programs into logic programs, capitalising on existing LP analyses and simple LP semantics.
Gange, Graeme +4 more
core +1 more source
FPGA-Based Implementation of Ship Detection for Satellite On-Board Processing
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2022 At present, the raw echo data captured by spaceborne synthetic aperture radar is usually downlinked to the ground stations for imaging and analysis. If the SAR data can be processed on-board, the processing results could be transmitted to users directly ...
Ming Xu +5 more
doaj +1 more source
Neighbourhood Structures: Bisimilarity and Basic Model Theory [PDF]
Logical Methods in Computer Science, 2009 Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic.
Helle Hvid Hansen +2 more
doaj +1 more source
Verifying Relational Properties using Trace Logic [PDF]
Formal Methods in Computer-Aided Design, 2019 We present a logical framework for the verification of relational properties in imperative programs. Our frame-work reduces verification of relational properties of imperative programs to a validity problem in trace logic, an expressive instance of first-
G. Barthe +5 more
semanticscholar +1 more source
Neutrosophic routes in multiverse of communication [PDF]
Neutrosophic Sets and Systems, 2014 Florentin Smarandache and Ştefan Vlăduţescu the authors and coordinators of the book “Communication Neutrosophic Routes”, published by Education Publishing, Ohio, USA, on 2014, are two remarcable professors, with many researches in neutrosophical ...
Daniela Gîfu, Mirela Teodorescu
doaj