349 Hits in 5.2 sec

Interactive proofs with competing teams of no-signaling provers [article]

Gus Gutoski
2011 arXiv   pre-print
Two-turn multi-prover interactive proofs with only one team of no-signaling provers. 2. Two-turn competing-prover interactive proofs with only one prover per team.  ...  We prove that the complexity class of decision problems that admit two-turn interactive proofs with competing teams of no-signaling provers is a subset of PSPACE.  ...  This research is supported by the Government of Canada through Industry Canada, the Province of Ontario through the Ministry of Research and Innovation, NSERC, DTO-ARO, CIFAR, and Quantum-Works.  ... 
arXiv:1012.0821v2 fatcat:j64w7mzqk5f57ppymplowwgnke

Automation for interactive proof: First prototype

Jia Meng, Claire Quigley, Lawrence C. Paulson
2006 Information and Computation  
Interactive theorem provers require too much effort from their users.  ...  An ATP is invoked at suitable points in the interactive session, and any proof found is given to the user in a window displaying an Isar proof script.  ...  The research was funded by the epsrc grant GR/S57198/01 Automation for Interactive Proof.  ... 
doi:10.1016/j.ic.2005.05.010 fatcat:j4ygxiujerfbbgq47cma7jkb5m

Industrial hardware and software verification with ACL2

Warren A. Hunt, Matt Kaufmann, J Strother Moore, Anna Slobodova
2017 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
Thanking the individuals who led important industrial proof projects and/or contributed books or improvements used by the community would require a recapitulation of the paper, so we just thank all the  ...  We also wish to thank Sol Swords for helpful feedback on a draft of this paper, and to thank the many sponsors of the ACL2 group at the University of Texas at Austin, including NSF and DARPA.  ...  That brings us to the deeper sense of the prover as an interactive proof assistant.  ... 
doi:10.1098/rsta.2015.0399 pmid:28871049 fatcat:7bdhr5s6srdrjm6aonktjsm7qq

Quantum Proofs

Thomas Vidick, John Watrous
2016 Foundations and Trends® in Theoretical Computer Science  
In particular, we discuss non-interactive proofs and the complexity class QMA, single-prover quantum interactive proof systems and the complexity class QIP, statistical zero-knowledge quantum interactive  ...  In the interactive proof system setting, one may consider a verifier and one or more provers that exchange and process quantum information rather than classical information during an interaction for a  ...  Thomas Vidick acknowledges support from the IQIM, an NSF Physics Frontiers Center (NFS Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028).  ... 
doi:10.1561/0400000068 fatcat:ogkaxvd2ubbrpev6n2kpyuc67y

History of Interactive Theorem Proving [chapter]

John Harrison, Josef Urban, Freek Wiedijk
2014 Handbook of the History of Logic  
The helpful review of the official reader Larry Paulson as well as useful comments from Mike Gordon, Tom Hales and J Moore, have significantly improved the eventual form of the chapter.  ...  ACKNOWLEDGEMENTS The authors are grateful to Jörg Siekmann for inviting them to prepare this chapter and for his patience in the face of our lengthy delays.  ...  Together with the limited interaction model of the prover, this effectively made it clumsy for users to provide any useful interactive guidance.  ... 
doi:10.1016/b978-0-444-51624-4.50004-6 fatcat:sngnxnl3ivectj5taj3dgsaa7m

Industrial-Strength Verification of Solid State Interlocking Programs [article]

Alexei Iliasov, Dominic Taylor, Linas Laibinis, Alexander Romanovsky
2022 arXiv   pre-print
It ensures fully-automated verification of safety properties using the state of the art techniques (automated theorem provers and solvers), and provides diagnostics in terms of the notations used by engineers  ...  The approach proposed verifies interlocking data developed by signalling engineers in the ways they are designed by industry.  ...  , and replaced all its solvers and provers with a dedicated inference-based symbolic prover that outperforms all known state-of-the-art provers when used on the railway models that our SSI-targeting tool  ... 
arXiv:2108.10091v2 fatcat:66aejovznbfjpachl4m54fasza

Automation of Mathematical Induction as part of the History of Logic [article]

J Strother Moore, Claus-Peter Wirth
2014 arXiv   pre-print
We review the history of the automation of mathematical induction  ...  Conf. on Automated Deduction (CADE), Trento (Italy), 1999 (the design of which is described in [Hutter & Bundy, 1999] ), where the following systems competed with each other (in interaction with the following  ...  is no m ′ < m with Q ′ (m ′ ).  ... 
arXiv:1309.6226v5 fatcat:i7nzngq47zfd7its4kfynlfpti

Multiple-Valued Logic Modelling for Agents Controlled via Optical Networks

Alexey Yu. Bykovsky
2022 Applied Sciences  
verification and breakdown restoration in mobile agents with the help of partner network nodes.  ...  In order to obtain flexible quantum and classical verification procedures, one should use the collective interaction of agents and network nodes, including some elements of the blockchain.  ...  Conflicts of Interest: The author declares no conflict of interests. Appl. Sci. 2022, 12, 1263  ... 
doi:10.3390/app12031263 fatcat:xrmvie2ptvg7faxsm3mlkpfh6q

Algorithms in Philosophy, Informatics and Logic. A Position Manifesto 2017

Dov M. Gabbay, Jörg H. Siekmann
2017 IfColog journal of logics and their applications (FLAP)  
We give more examples: • Consider a representation of an agent (irrespective of the exact theory used).  ...  Some of these features are declarative, others are algorithmic. The agent's nature is determined by both, i.e. these algorithms as well as the declarative content build the "personality" of the agent.  ...  research in Britain at a time when the promises of AI were seemingly just on the horizon.  ... 
dblp:journals/flap/GabbayS17 fatcat:wvtsqquk3vhm3ohgsxn6lzc22u

A Synchronous Language at Work: The Story of Lustre [chapter]

Nicolas Halbwachs
2012 Formal Methods for Industrial Critical Systems  
This double competence seems to have played an important role in the design of the languages.  ...  Fourier, CNRS and INPG associated with IMAG.  ...  memories (very often, there is no need of two memories to deal with x and pre(x)).  ... 
doi:10.1002/9781118459898.ch2 fatcat:girfw4j65fckfc5656qrsrrrxq

Proving the shalls

Steven P. Miller, Alan C. Tribble, Michael W. Whalen, Mats P. E. Heimdahl
2006 International Journal on Software Tools for Technology Transfer (STTT)  
A formal model of the mode logic was written in the RSML −e language and translated into the NuSMV model checker and the PVS theorem prover using translators developed as part of the project.  ...  The convergence of model-based development and formal methods offers developers of safetycritical systems a powerful new approach for the early validation of requirements.  ...  Acknowledgements The authors wish to acknowledge the ongoing support of this work by Ricky Butler, Kelly Hayhurst, and Celeste Bellcastro of the NASA Langley Research Center, and the efforts of Anjali  ... 
doi:10.1007/s10009-004-0173-6 fatcat:mfwiwerscfhetlkn4lokbfzvhy

Embedded and Real-time Systems [chapter]

Edward L. Lamie
2019 Real-Time Embedded Multithreading Using ThreadX  
video games with many interactions, physical simulations, etc.  ...  It turns out that this enables REACTIVEML to simulate millions of (logical) parallel processes and to compete with the best event-driven simulators [43] .  ... 
doi:10.1201/9780429187575-1 fatcat:ngrbtza47bhrdmlrbn2xdhg5de

Formal Methods and their Role in the Certification of Critical Systems [chapter]

John Rushby
1997 Safety and Reliability of Software Based Systems  
Its purpose is to outline the technical basis for formal methods in computer science, to explain the use of formal methods in the specification and verification of software and hardware requirements, designs  ...  benefits, weaknesses, and difficulties in applying these methods to digital systems used in critical applications, and to suggest factors for consideration when formal methods are offered in support of  ...  and argue their points of view with me.  ... 
doi:10.1007/978-1-4471-0921-1_1 fatcat:33n3af7ssbfkbiy6o6vj462idi

Medicine-by-wire: Practical considerations on formal techniques for dependable medical systems

Leo Freitas, William E. Scott, Patrick Degenaar
2020 Science of Computer Programming  
A key challenge is how to achieve a successful interaction between verification tasks using formal methods and system development tasks within engineering teams without prior knowledge of formal techniques  ...  In contrast, medical certification is clinical-trial driven, which we argue will become increasingly problematic with increasing medical device and software complexity.  ...  Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper  ... 
doi:10.1016/j.scico.2020.102545 fatcat:jq6j6umyafg7bk7simxmwmaxru

A Methodology for Large-Scale Hardware Verification [chapter]

Mark D. Aagaard, Robert B. Jones, Thomas F. Melham, John W. O'Leary, Carl-Johan H. Seger
2000 Lecture Notes in Computer Science  
We illustrate the methodology-which has has proved highly effective in large-scale industrial trials-with the verification of an IEEEcompliant, extended precision floating-point adder.  ...  This provides a systematic but flexible framework within which to organize the activities undertaken in large-scale verification efforts and to structure the associated code and proof-script artifacts.  ...  Acknowledgments Ching-Tsun Chou, Limor Fix, Brian Moore, and Eli Singerman made helpful comments on a draft of this paper. Thanks are also due to the anonymous referees for their comments.  ... 
doi:10.1007/3-540-40922-x_17 fatcat:rogl6mf6mfelvp3d3n3qlmihvm
« Previous Showing results 1 — 15 out of 349 results