Filters








60,046 Hits in 5.7 sec

A framework for probabilistic evaluation of interval management tolerence in the terminal radar control area

Heber Herencia-Zapana, G. Hagen, N. Neogi
2012 2012 IEEE/AIAA 31st Digital Avionics Systems Conference (DASC)  
The interval management (IM) concept in the TRACON area is designed to shift some of the operational burden from the control tower to the flight deck, placing the flight crew in charge of implementing  ...  The analytical basis for this framework may be used to formalize both correctness and probabilistic system safety claims in a modular fashion at the algorithmic level in a way compatible with several Formal  ...  Acknowledgements This work is supported in part by the National Aeronautics and Space Administration under NASA Cooperative Agreement NNL09AA00A, activity 2736.  ... 
doi:10.1109/dasc.2012.6382886 fatcat:yvpbvovtivdw5fy2t2zkh52o4u

Algorithm for Multi-Channel Robotic Device Control Based on Minimizing Bayesian Risk

Timofei I. Voznenko, Konstantin Y. Kudryavtsev
2021 Procedia Computer Science  
This paper gives a theoretical justification for the algorithm for choosing a control command for a multi-channel control system of a mobile robotic device.  ...  This paper gives a theoretical justification for the algorithm for choosing a control command for a multi-channel control system of a mobile robotic device.  ...  Acknowledgments This work was supported by the Competitiveness Growth Program of the National Research Nuclear University MEPhI (Moscow Engineering Physics Institute).  ... 
doi:10.1016/j.procs.2021.06.093 fatcat:p5x4opg2wrey3k7ubbff4m7dja

Optimization of Aircraft Pitch Trim Rate of Movement Using Model Based Approach and Improving the Software Algorithm

Rathinakumar V, Nanda M
2015 Journal of Aeronautics & Aerospace Engineering  
Law et al. [1] present a specific level model based approach to improve the performance of software algorithm. This approach/  ...  Efficient methods are required for improving the software algorithm to allow early performance evaluation of completeness and correctness.  ...  The model consists of electrical-mechanical components with the algorithm implemented in the model. The model is validated for its correct and complete implementation against the aircraft data.  ... 
doi:10.4172/2168-9792.1000151 fatcat:3mymxhtbarbyhc4ngs4i5k4fgu

Proof-carrying code from certified abstract interpretation and fixpoint compression

Frédéric Besson, Thomas Jensen, David Pichardie
2006 Theoretical Computer Science  
Proof checkers carry their own correctness proofs and accepting a new proof checker amounts to type checking the checker in Coq.  ...  Certificates take the form of strategies for reconstructing a fixpoint and are kept small due to a technique for fixpoint compression.  ...  Correctness of the reconstruction algorithm amounts to proving that if the reconstruction succeeds, it outputs a tagged abstract state that is a correct approximation of the program and for which all control  ... 
doi:10.1016/j.tcs.2006.08.012 fatcat:euvgvxbrcve6jkh5wzhuxahiyy

Formal Verification of an Executable LTL Model Checker with Partial Order Reduction [chapter]

Julian Brunner, Peter Lammich
2016 Lecture Notes in Computer Science  
This theorem is independent of the actual reduction algorithm. We then verify a reduction algorithm for a simple but expressive fragment of Promela.  ...  We use static partial order reduction, which allows separating the partial order reduction and the model checking algorithms regarding both the correctness proof and the implementation.  ...  In order to meet the very strict correctness requirements of model checking algorithms, we implement and formally verify a partial order reduction algorithm.  ... 
doi:10.1007/978-3-319-40648-0_23 fatcat:e4caxriogfdjpme3gwsbnrzwlq

Computational Depth Complexity of Measurement-Based Quantum Computation [chapter]

Dan Browne, Elham Kashefi, Simon Perdrix
2011 Lecture Notes in Computer Science  
It demonstrates that the one-way model is not only one of the most promising models of physical realisation, but also a very powerful model of quantum computation.  ...  can be done by a polytime probabilistic classical algorithm which has access to a constant-depth one-way quantum computer.  ...  Indeed, a correction of the form X sj i has to be applied after the measurement of the qubit j. The depth of a measurement pattern is longest path of dependant commands: Definition 1 (Quantum Depth).  ... 
doi:10.1007/978-3-642-18073-6_4 fatcat:uqyledk2o5c4voltzyfddkpok4

Computational depth complexity of measurement-based quantum computation [article]

Dan E. Browne, Elham Kashefi, Simon Perdrix
2009 arXiv   pre-print
It demonstrates that the one-way model is not only one of the most promising models of physical realisation, but also a very powerful model of quantum computation.  ...  can be done by a polytime probabilistic classical algorithm which has access to a constant-depth one-way quantum computer.  ...  Indeed, a correction of the form X sj i has to be applied after the measurement of the qubit j. The depth of a measurement pattern is longest path of dependant commands: Definition 1 (Quantum Depth).  ... 
arXiv:0909.4673v1 fatcat:k57w5ddj7vdovbny234bj2bbpm

Certifying an embedded remote method invocation protocol

June Andronick, Quang-Huy Nguyen
2008 Proceedings of the 2008 ACM symposium on Applied computing - SAC '08  
This paper describes an approach to formally prove that an implementation of the Java Card Remote Method Invocation protocol on smart cards fulfills its functional and security specification.  ...  We focus on certifying the Java code portion since the native portion has been handled in a previous work. The correctness is showed to be preserved while composing the native and Java codes.  ...  In our goal to prove that a given implementation is correct with respect to its specification, the FSP model represents the formalization of the specification.  ... 
doi:10.1145/1363686.1363777 dblp:conf/sac/AndronickN08 fatcat:fhp7elxrgzghfjec7sqkhnk5ly

Compile-time detection of information flow in sequential programs [chapter]

Jean-Pierre Banâtre, Ciarán Bryce, Daniel Métayer
1994 Lecture Notes in Computer Science  
We give a formal definition of the notion of information flow for a simple guarded command language.  ...  We propose an axiomatisation of security properties based on this notion of information flow and we prove its soundness with respect to the operational semantics of the language.  ...  The semantics of CSP introduces two main technical difficulties for a correct treatment of control flow: -Indirect control flow can occur even in the absence of rendez-vous (when such a rendez-vous would  ... 
doi:10.1007/3-540-58618-0_56 fatcat:ihg7xcau55dhjdv4plci5unqwi

HybridFluctuat: A Static Analyzer of Numerical Programs within a Continuous Environment [chapter]

Olivier Bouissou, Eric Goubault, Sylvie Putot, Karim Tekkal, Franck Vedrine
2009 Lecture Notes in Computer Science  
We demonstrate our approach on an industrial case study 3 , a part of the flight control software of ASTRIUM's Automated Transfer Vehicle (ATV).  ...  The evolution of the continuous environment is over-approximated using a guaranteed integrator that we developped, and special assertions are added to the program that simulate the action of sensors and  ...  We are thus able to prove the numerical stability of the implementation of a control-command algorithm. We next intend to extend this analysis in two natural directions described hereafter.  ... 
doi:10.1007/978-3-642-02658-4_46 fatcat:tcncydud2valhoffmmfslrsun4

Proving Quantum Programs Correct [article]

Kesha Hietala, Robert Rand, Shih-Han Hung, Liyi Li, Michael Hicks
2020 arXiv   pre-print
It verifies the correctness of a range of a quantum algorithms including Simon's algorithm, Grover's algorithm, and quantum phase estimation, a key component of Shor's algorithm.  ...  In doing so, it aims to highlight both the successes and challenges of formal verification in the quantum context and motivate the theorem proving community to target quantum computing as an application  ...  To date, we have proved the correctness of implementations of a half-dozen quantum algorithms, including quantum teleportation, Greenberger-Horne-Zeilinger (GHZ) state preparation [17] , the Deutsch-Jozsa  ... 
arXiv:2010.01240v2 fatcat:oud56xhf4jh3jkzbdohcabmulu

Design and Formal Verification of a Safe Stop Supervisor for an Automated Vehicle*

Jonas Krook, Lars Svensson, Yuchao Li, Lei Feng, Martin Fabian
2019 2019 International Conference on Robotics and Automation (ICRA)  
Autonomous vehicles apply pertinent planning and control algorithms under different driving conditions. The mode switch between these algorithms should also be autonomous.  ...  The supervisor is implemented and integrated with the Research Concept Vehicle, an experimental research and demonstration vehicle developed at the KTH Royal Institute of Technology.  ...  The implementation [22] is based on a Hybrid A * algorithm [23] .  ... 
doi:10.1109/icra.2019.8793636 dblp:conf/icra/KrookSLFF19 fatcat:u2r5tbv4krds5d25mswsz4xo4a

Visual servoing for autonomous landing of a multi-rotor UAS on a moving platform

Iryna Borshchova, Siu O'Young
2017 Journal of Unmanned Vehicle Systems  
When the onboard camera detects the object pattern, the flight control algorithm will send visual-based servo-commands to align the multi-rotor with the targets.  ...  The landing scheme is based on positioning visual markers on a landing platform in the form of a detectable pattern.  ...  Vincent Mike Contarino, Dilhan Balage, Carl Thibault, and RAVEN team for the help and guidance in this project.  ... 
doi:10.1139/juvs-2015-0044 fatcat:zqsjmjdf6faktke32ws4umdplq

The Boyer-Moore theorem prover and its interactive enhancement

R.S. Boyer, M. Kaufmann, J.S. Moore
1995 Computers and Mathematics with Applications  
We give an overview of both this system and an interactive enhancement of it, Pc-Nqthm, from a number of perspectives. First, we introduce the logic in which theorems are proved.  ...  Then, we briefly describe the two mechanized theorem proving systems.  ...  mutual exclusion and absence of starvation, using a mechanized implementation of Unity on the Boyer-Moore prover (Goldschlag [66] , "dmg/min. event s" ) the correctness of a distributed algorithm that  ... 
doi:10.1016/0898-1221(94)00215-7 fatcat:j53obxhps5hijl7yv66aeo5nny

Vulnerability to Flash Controller for Secure USB Drives

Jaein Kim, Youngjun Lee, Kyungroul Lee, Taeyoung Jung, Dmitry Volokhov, Kangbin Yim
2013 Journal of Internet Services and Information Security  
This controller divides a driver into several partitions, one of which is configured as a secure area to store secret information.  ...  This paper analyzes a vulnerability in the flash controller for secure USB drives, which is meant to enable secure USB drives to prevent unauthorized access to the data stored on them.  ...  This result means the USB flash drive controller is SM3254AE, as shown in the IC Version field. The result is from a special tool so we cannot prove that it is correct.  ... 
doi:10.22667/jisis.2013.11.31.136 dblp:journals/jisis/KimLLJVY13 fatcat:5j6ienq4qnarjeb27sd2vighja
« Previous Showing results 1 — 15 out of 60,046 results