Filters








129,175 Hits in 6.3 sec

A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes [chapter]

Naoki Kobayashi
2011 Lecture Notes in Computer Science  
To our knowledge, this is the first practical model checking algorithm for recursion schemes that runs in time linear in the size of the higher-order recursion scheme, under the assumption that the size  ...  The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification.  ...  Higher-Order Recursion Schemes. A higher-order recursion scheme [20] is a tree grammar for generating an infinite tree, where non-terminal symbols can take parameters.  ... 
doi:10.1007/978-3-642-19805-2_18 fatcat:skzu7mia4bc6lnbx2u7hefq2h4

Higher-Order Model Checking: From Theory to Practice

Naoki Kobayashi
2011 2011 IEEE 26th Annual Symposium on Logic in Computer Science  
The model checking of higher-order recursion schemes (higher-order model checking for short) has been actively studied in the last decade, and has seen significant progress in both theory and practice.  ...  This short article aims to provide an overview of the recent progress in higher-order model checking and discuss future directions.  ...  Furthermore, the recent fixed-parameter linear time algorithm [26] runs in time linear in the size of recursion schemes of arbitrary order, so that the model checking of well-structured higher-order  ... 
doi:10.1109/lics.2011.15 dblp:conf/lics/Kobayashi11 fatcat:uc23ml5ekbc23ojg3herppprdq

Relational semantics of linear logic and higher-order model-checking [article]

Charles Grellois, Paul-André Melliès
2015 arXiv   pre-print
Our starting point is the observation that once embedded in the relational semantics of linear logic, the Church encoding of any higher-order recursion scheme (HORS) comes together with a dual Church encoding  ...  recursion schemes.  ...  non-terminals F ∈ N of the higher-order recursion scheme G.  ... 
arXiv:1501.04789v3 fatcat:4yd3ryhkpzgzfhpy52fctlmglq

Indexed linear logic and higher-order model checking

Charles Grellois, Paul-André Melliès
2015 Electronic Proceedings in Theoretical Computer Science  
In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the  ...  recursion scheme G in an appropriate intersection type system associated to the automaton A.  ...  , and thus higher-order recursion schemes.  ... 
doi:10.4204/eptcs.177.4 fatcat:76shpi2nn5ckphb4myagjd54b4

Higher-order multi-parameter tree transducers and recursion schemes for program verification

Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
2010 Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '10  
HMTTs subsume higher-order recursion schemes and ordinary tree transducers, so that their verification has a number of potential applications to verification of functional programs using recursive data  ...  We propose a sound but incomplete verification algorithm for the HMTT verification problem: the algorithm reduces the verification problem to a model-checking problem for higher-order recursion schemes  ...  A higher-order recursion scheme (recursion scheme, for short) is a grammar for generating a (possibly infinite) tree.  ... 
doi:10.1145/1706299.1706355 dblp:conf/popl/KobayashiTU10 fatcat:imwgz6kyojfq3aai6medovbrce

Higher-order multi-parameter tree transducers and recursion schemes for program verification

Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
2010 SIGPLAN notices  
HMTTs subsume higher-order recursion schemes and ordinary tree transducers, so that their verification has a number of potential applications to verification of functional programs using recursive data  ...  We propose a sound but incomplete verification algorithm for the HMTT verification problem: the algorithm reduces the verification problem to a model-checking problem for higher-order recursion schemes  ...  A higher-order recursion scheme (recursion scheme, for short) is a grammar for generating a (possibly infinite) tree.  ... 
doi:10.1145/1707801.1706355 fatcat:tjh3wwo67zaz3hdwb6bh2ro7eu

Automated techniques for higher-order program verification

Naoki KOBAYASHI, Luke ONG, David Van HORN
2013 Progress in Informatics  
Studies of game semantics have yielded compositional model checkers and automated program equivalence checkers for Algol-like programming languages, and studies of higher-order recursion schemes and pushdown  ...  Recently, we have seen some good progress in automated techniques for verification of higher-order programs.  ...  This may sound like a crazy idea, as higher-order model checking is k-EXPTIME complete in general, for order-k recursion schemes.  ... 
doi:10.2201/niipi.2013.10.9 fatcat:xqfyvx6m25d4jcodwl373vlxlq

Higher-Order Model Checking: An Overview

Luke Ong
2015 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science  
Outline: In Section II, we introduce two families of generators of infinite structures: recursion schemes and higher-order  ...  Higher-order model checking is about the model checking of trees generated by recursion schemes. The past fifteen years or so have seen considerable progress in both theory and practice.  ...  Historical remark: The precursor of higher-order recursion schemes is program schemes.  ... 
doi:10.1109/lics.2015.9 dblp:conf/lics/Ong15 fatcat:55bfxqlkuzhbtgmzc32m46ooku

Finitary semantics of linear logic and higher-order model-checking [article]

Charles Grellois, Paul-André Melliès
2015 arXiv   pre-print
Given a higher-order recursion scheme G, the finiteness of its interpretation in the model enables us to associate to any MSO formula phi a new higher-order recursion scheme G_phi resolving the selection  ...  In this paper, we explain how the connection between higher-order model-checking and linear logic recently exhibited by the authors leads to a new and conceptually enlightening proof of the selection problem  ...  Higher-order recursion schemes and the λY -calculus Higher-order recursion schemes. The set of simple types of the λ-calculus is generated by the grammar σ, τ ::= o | σ → τ .  ... 
arXiv:1502.05147v2 fatcat:lseygm2skzcorilqj7s7o55n4m

Cost Automata, Safe Schemes, and Downward Closures [article]

David Barozzini, Lorenzo Clemente, Thomas Colcombet, Paweł Parys
2022 arXiv   pre-print
Higher-order recursion schemes are an expressive formalism used to define languages of finite and infinite ranked trees.  ...  In this work we prove, under a syntactical constraint called safety, decidability of the model-checking problem for recursion schemes against properties defined by alternating B-automata, an extension  ...  The proof uses the fact that higher-order recursion schemes with states (as introduced in that proof) are convertible to equivalent higher-order recursion schemes by increasing the arity of nonterminals  ... 
arXiv:2004.12187v3 fatcat:dgp2l6se7rdvfnvbtc2wehzg4q

A combination of spatial and recursive temporal filtering for noise reduction when using region of interest (ROI) fluoroscopy for patient dose reduction in image guided vascular interventions with significant anatomical motion

S. V. Setlur Nagesh, P. Khobragade, C. Ionita, D. R. Bednarek, S. Rudin, Christoph Hoeschen, Despina Kontos, Thomas G. Flohr
2015 Medical Imaging 2015: Physics of Medical Imaging  
In this work the effects of three noise-reduction schemes, including recursive temporal filtering, spatial mean filtering, and a combination of spatial and recursive temporal filtering, were investigated  ...  From these it can be concluded that with significant anatomical motion, a combination of spatial and recursive temporal filtering scheme is best suited for reducing the excess quantum noise in the periphery  ...  In order to reduce the excessive noise in the periphery, a recursive temporal filter with higher filter weight (α) in the periphery was applied using the following equation [6] [7] [8] .  ... 
doi:10.1117/12.2081465 pmid:26900203 pmcid:PMC4758522 fatcat:zwoapcargnawzawmq7a32qfiya

Non‐linear activation function approximation using a REMEZ algorithm

Samba Raju Chiluveru, Manoj Tripathy, Bibhudutta
2021 IET Circuits, Devices & Systems  
The PWA realized in three ways: using first-order functions, that is, piecewise linear model, second-order functions (piecewise non-linear model), and hybridorder model (a mixture of first-order and second-order  ...  The hybrid-order approximation employs the second-order derivative of non-linear activation function to decide the linear and non-linear sub-regions, correspondingly the first-order and second-order functions  ...  From the literature, it is observed that firstorder function piecewise linear (PWL) approximation implementation requires fewer hardware resources than higher order.  ... 
doi:10.1049/cds2.12058 fatcat:ludhz45pqnc35j6d6d3ny4rgjy

Model-checking higher-order functions

Naoki Kobayashi
2009 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming - PPDP '09  
We propose a novel type-based model checking algorithm for higher-order recursion schemes.  ...  As shown by Kobayashi, verification problems of higher-order functional programs can easily be translated into model checking problems of recursion schemes.  ...  Higher-Order Recursion Schemes A higher-order recursion scheme (recursion scheme, for short) is a grammar for generating a (possibly infinite) tree.  ... 
doi:10.1145/1599410.1599415 dblp:conf/ppdp/Kobayashi09 fatcat:5lvamxc2pjhyfelzwr6e4hzvoq

Low-complexity systolic V-BLAST architecture

Toshiaki Koike-Akino
2009 IEEE Transactions on Wireless Communications  
The proposed scheme, using a greedy ordering, can achieve a performance comparable to that of V-BLAST with optimum ordering, while its computational complexity is lower than a linear detector.  ...  V-BLAST yields higher diversity gains and improves bit-error-rate (BER) performance.  ...  We summarize the proposed scalar recursion scheme in Algorithm 1.  ... 
doi:10.1109/twc.2009.070498 fatcat:mx63his2sbb77pc6uy35osm5ye

Bandwidth-efficient recursive pth-order equalization for correcting baseband distortion in parametric loudspeakers

Kelvin Chee-Mun Lee, Woon-Seng Gan
2006 IEEE Transactions on Audio, Speech, and Language Processing  
A bandwidth-efficient recursive implementation of th-order equalization is developed in order to correct the inherent baseband distortion in parametric loudspeakers.  ...  The all-pass sections comprise of a delay block and an approximate linear-phase infinite impulse response (IIR) Hilbert transformer to give a Hilbert transform pair.  ...  One way of overcoming this problem is by using a recursive th-order distortion compensator developed by Spencer et al. [11] in a single-sideband (SSB) AM scheme.  ... 
doi:10.1109/tsa.2005.855830 fatcat:wvwblsrl2ze43gktnqjkghp5hi
« Previous Showing results 1 — 15 out of 129,175 results