Artykuły w czasopismach: „Formal verification”

1

Meenakshi, B. "Formal verification". Resonance 10, nr 5 (maj 2005): 26–38. http://dx.doi.org/10.1007/bf02871329.

Style APA, Harvard, Vancouver, ISO itp.

2

Bjesse, Per. "What is formal verification?" ACM SIGDA Newsletter 35, nr 24 (15.12.2005): 1. http://dx.doi.org/10.1145/1113792.1113794.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Schlipf, T., T. Buechner, R. Fritz, M. Helms i J. Koehl. "Formal verification made easy". IBM Journal of Research and Development 41, nr 4.5 (lipiec 1997): 567–76. http://dx.doi.org/10.1147/rd.414.0567.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Sauvage, Laurent, Tarik Graba i Thibault Porteboeuf. "Multi-level formal verification". Journal of Cryptographic Engineering 7, nr 1 (22.11.2016): 87–95. http://dx.doi.org/10.1007/s13389-016-0144-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Niculaescu, Oana. "What's formal software verification?" XRDS: Crossroads, The ACM Magazine for Students 25, nr 4 (9.07.2019): 64–65. http://dx.doi.org/10.1145/3341815.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Flores, Sonia, Salvador Lucas i Alicia Villanueva. "Formal Verification of Websites". Electronic Notes in Theoretical Computer Science 200, nr 3 (maj 2008): 103–18. http://dx.doi.org/10.1016/j.entcs.2008.04.095.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Xie, Guojun, Huanhuan Yang, Hao Deng, Zhengpu Shi i Gang Chen. "Formal Verification of Robot Rotary Kinematics". Electronics 12, nr 2 (11.01.2023): 369. http://dx.doi.org/10.3390/electronics12020369.

Pełny tekst źródła

Streszczenie:

With the widespread application of robots in aerospace, medicine, automation, and other fields, their motion safety is essential for the well-being of humans and the accomplishment of vital socially beneficial programs. Conventional robot hardware and software designs mainly rely on experiential knowledge and manual testing to ensure safety, but this fails to cover all possible testing paths and adds risks. Alternatively, formal, mathematically rigorous verifications can provide predictable and reliable guarantees of robot motion safety. To demonstrate the feasibility of this approach, we formalize the mathematical coordinate transformation of a robot’s rigid-body kinematics using the Coq Proof Assistant to verify the correctness of its theoretical design. First, based on record-type matrix formalization, we define and verify a robot’s spatial geometry by constructing formal expressions of the matrix’ Frobenius norm, trace, and inner product. Second, we divide rotary motion into revolution and rotation construct and provide their formal definitions. Next, we formally verify the rotational matrices of angle conventions (e.g., roll–pitch–yaw and Euler), and we complete the formal verification of the Rodriguez formula to formally verify the correctness of the motion theory in specific rotating kinematics problems. The formal work of this paper has a variety of essential applications and provides a generalizable kinematics analysis framework for robot control system verification. Moreover, it paves the way for automatic programming capabilities.

Style APA, Harvard, Vancouver, ISO itp.

8

Greengard, Samuel. "Formal software verification measures up". Communications of the ACM 64, nr 7 (lipiec 2021): 13–15. http://dx.doi.org/10.1145/3464933.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Michael, James Bret, Doron Drusinsky i Duminda Wijesekera. "Formal Verification of Cyberphysical Systems". Computer 54, nr 9 (wrzesień 2021): 15–24. http://dx.doi.org/10.1109/mc.2021.3055883.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Qian, Junyan, i Baowen Xu. "Formal Verification for C Program". Informatica 18, nr 2 (1.01.2007): 289–304. http://dx.doi.org/10.15388/informatica.2007.178.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Tristan, Jean-Baptiste, i Xavier Leroy. "Formal verification of translation validators". ACM SIGPLAN Notices 43, nr 1 (14.01.2008): 17–27. http://dx.doi.org/10.1145/1328897.1328444.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Moghissi, Gholam Reza, i Ali Payandeh. "Formal Verification of NTRUEncrypt Scheme". International Journal of Computer Network and Information Security 8, nr 4 (8.04.2016): 44–55. http://dx.doi.org/10.5815/ijcnis.2016.04.06.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Geraldes, André A., Luca Geretti, Davide Bresolin, Riccardo Muradore, Paolo Fiorini, Leonardo S. Mattos i Tiziano Villa. "Formal Verification of Medical CPS". ACM Transactions on Cyber-Physical Systems 2, nr 4 (18.09.2018): 1–29. http://dx.doi.org/10.1145/3140237.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Alur, Rajeev. "Next steps in formal verification". ACM Computing Surveys 28, nr 4es (grudzień 1996): 115. http://dx.doi.org/10.1145/242224.242373.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Henzinger, Thomas A. "Some myths about formal verification". ACM Computing Surveys 28, nr 4es (grudzień 1996): 119. http://dx.doi.org/10.1145/242224.242378.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

BCS. "Hot topic: Formal program verification". Computer Bulletin 46, nr 6 (1.11.2004): 32. http://dx.doi.org/10.1093/combul/46.6.32-a.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Cortier, Véronique. "Formal verification of e-voting". ACM SIGLOG News 2, nr 1 (28.01.2015): 25–34. http://dx.doi.org/10.1145/2728816.2728823.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Guaspari, D., C. Marceau i W. Polak. "Formal verification of Ada programs". IEEE Transactions on Software Engineering 16, nr 9 (1990): 1058–75. http://dx.doi.org/10.1109/32.58790.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Kern, Christoph, i Mark R. Greenstreet. "Formal verification in hardware design". ACM Transactions on Design Automation of Electronic Systems 4, nr 2 (kwiecień 1999): 123–93. http://dx.doi.org/10.1145/307988.307989.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Park, Taeshin, i Paul I. Barton. "Formal verification of sequence controllers". Computers & Chemical Engineering 23, nr 11-12 (styczeń 2000): 1783–93. http://dx.doi.org/10.1016/s0098-1354(99)00327-0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Filkorn, Th, M. Hölzlein, P. Warkentin i M. Weiβ. "Formal verification of PLC-programs". IFAC Proceedings Volumes 32, nr 2 (lipiec 1999): 1513–18. http://dx.doi.org/10.1016/s1474-6670(17)56256-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Guang-hui, Li, i Li Xiao-wei. "Formal verification under unknown constraints". Wuhan University Journal of Natural Sciences 10, nr 1 (styczeń 2005): 43–46. http://dx.doi.org/10.1007/bf02828614.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Chockler, Hana, Orna Kupferman i Moshe Vardi. "Coverage metrics for formal verification". International Journal on Software Tools for Technology Transfer 8, nr 4-5 (7.04.2006): 373–86. http://dx.doi.org/10.1007/s10009-004-0175-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Huffman, Brian. "Formal verification of monad transformers". ACM SIGPLAN Notices 47, nr 9 (15.10.2012): 15–16. http://dx.doi.org/10.1145/2398856.2364532.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Taft, Tucker. "SPARK Formal Verification for Security". ACM SIGAda Ada Letters 39, nr 1 (10.01.2020): 83–99. http://dx.doi.org/10.1145/3379106.3379117.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Young, F. C. D., i J. A. Houston. "Formal verification and legacy redesign". IEEE Aerospace and Electronic Systems Magazine 14, nr 3 (marzec 1999): 31–36. http://dx.doi.org/10.1109/62.750426.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Abadir, Magdy S., Kenneth L. Albin, John Havlicek, Narayanan Krishnamurthy i Andrew K. Martin. "Formal Verification Successes at Motorola". Formal Methods in System Design 22, nr 2 (marzec 2003): 117–23. http://dx.doi.org/10.1023/a:1022917321255.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Dai, Guiping. "Formal Verification for KMB09 Protocol". International Journal of Theoretical Physics 58, nr 11 (5.08.2019): 3651–57. http://dx.doi.org/10.1007/s10773-019-04232-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Mittelmann, Munyque, Bastien Maubert, Aniello Murano i Laurent Perrussel. "Formal Verification of Bayesian Mechanisms". Proceedings of the AAAI Conference on Artificial Intelligence 37, nr 10 (26.06.2023): 11621–29. http://dx.doi.org/10.1609/aaai.v37i10.26373.

Pełny tekst źródła

Streszczenie:

In this paper, for the first time, we study the formal verification of Bayesian mechanisms through strategic reasoning. We rely on the framework of Probabilistic Strategy Logic (PSL), which is well-suited for representing and verifying multi-agent systems with incomplete information. We take advantage of the recent results on the decidability of PSL model checking under memoryless strategies, and reduce the problem of formally verifying Bayesian mechanisms to PSL model checking. We show how to encode Bayesian-Nash equilibrium and economical properties, and illustrate our approach with different kinds of mechanisms.

Style APA, Harvard, Vancouver, ISO itp.

30

Nallamalli, Ranjana, i Durg Singh Chauhan. "Rapid Formal Verification as Requirements Stage Verification and Validation Technique". International Review on Computers and Software (IRECOS) 14, nr 1 (30.06.2019): 27. http://dx.doi.org/10.15866/irecos.v14i1.17684.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

ASPERTI, ANDREA, HERMAN GEUVERS i RAJA NATARAJAN. "Social processes, program verification and all that". Mathematical Structures in Computer Science 19, nr 5 (7.09.2009): 877–96. http://dx.doi.org/10.1017/s0960129509990041.

Pełny tekst źródła

Streszczenie:

In a controversial paper (De Millo et al. 1979) at the end of the 1970's, R. A. De Millo, R. J. Lipton and A. J. Perlis argued against formal verifications of programs, mostly motivating their position by an analogy with proofs in mathematics, and, in particular, with the impracticality of a strictly formalist approach to this discipline. The recent, impressive achievements in the field of interactive theorem proving provide an interesting ground for a critical revisiting of their theses. We believe that the social nature of proof and program development is uncontroversial and ineluctable, but formal verification is not antithetical to it. Formal verification should strive not only to cope with, but to ease and enhance the collaborative, organic nature of this process, eventually helping us to master the growing complexity of scientific knowledge.

Style APA, Harvard, Vancouver, ISO itp.

32

Brewka, Lukasz, José Soler i Michael Berger. "The MODUS Approach to Formal Verification". Business Systems Research Journal 5, nr 1 (1.03.2014): 21–33. http://dx.doi.org/10.2478/bsrj-2014-0002.

Pełny tekst źródła

Streszczenie:

Abstract Background: Software reliability is of great importance for the development of embedded systems that are often used in applications that have requirements for safety. Since the life cycle of embedded products is becoming shorter, productivity and quality simultaneously required and closely in the process of providing competitive products Objectives: In relation to this, MODUS (Method and supporting toolset advancing embedded systems quality) project aims to provide small and medium-sized businesses ways to improve their position in the embedded market through a pragmatic and viable solution Methods/Approach: This paper will describe the MODUS project with focus on the technical methodologies that can assist formal verification and formal model checking. Results: Based on automated analysis of the characteristics of the system and by controlling the choice of the existing opensource model verification engines, model verification producing inputs to be fed into these engines. Conclusions: The MODUS approach is aligned with present market needs; the familiarity with tools, the ease of use and compatibility/interoperability remain among the most important criteria when selecting the development environment for a project

Style APA, Harvard, Vancouver, ISO itp.

33

Koch, Alexander, Michael Schrempp i Michael Kirsten. "Card-Based Cryptography Meets Formal Verification". New Generation Computing 39, nr 1 (kwiecień 2021): 115–58. http://dx.doi.org/10.1007/s00354-020-00120-0.

Pełny tekst źródła

Streszczenie:

AbstractCard-based cryptography provides simple and practicable protocols for performing secure multi-party computation with just a deck of cards. For the sake of simplicity, this is often done using cards with only two symbols, e.g., $$\clubsuit $$ ♣ and $$\heartsuit $$ ♡ . Within this paper, we also target the setting where all cards carry distinct symbols, catering for use-cases with commonly available standard decks and a weaker indistinguishability assumption. As of yet, the literature provides for only three protocols and no proofs for non-trivial lower bounds on the number of cards. As such complex proofs (handling very large combinatorial state spaces) tend to be involved and error-prone, we propose using formal verification for finding protocols and proving lower bounds. In this paper, we employ the technique of software bounded model checking (SBMC), which reduces the problem to a bounded state space, which is automatically searched exhaustively using a SAT solver as a backend. Our contribution is threefold: (a) we identify two protocols for converting between different bit encodings with overlapping bases, and then show them to be card-minimal. This completes the picture of tight lower bounds on the number of cards with respect to runtime behavior and shuffle properties of conversion protocols. For computing AND, we show that there is no protocol with finite runtime using four cards with distinguishable symbols and fixed output encoding, and give a four-card protocol with an expected finite runtime using only random cuts. (b) We provide a general translation of proofs for lower bounds to a bounded model checking framework for automatically finding card- and run-minimal (i.e., the protocol has a run of minimal length) protocols and to give additional confidence in lower bounds. We apply this to validate our method and, as an example, confirm our new AND protocol to have its shortest run for protocols using this number of cards. (c) We extend our method to also handle the case of decks on symbols $$\clubsuit $$ ♣ and $$\heartsuit $$ ♡ , where we show run-minimality for two AND protocols from the literature.

Style APA, Harvard, Vancouver, ISO itp.

34

Benabbou, Amel, Safia Nait Bahloul i Dhaussy Philippe. "Context-aware approach for formal verification". EAI Endorsed Transactions on Context-aware Systems and Applications 3, nr 7 (12.02.2016): 151085. http://dx.doi.org/10.4108/eai.12-2-2016.151085.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Herklotz, Yann, James D. Pollard, Nadesh Ramanathan i John Wickerson. "Formal verification of high-level synthesis". Proceedings of the ACM on Programming Languages 5, OOPSLA (20.10.2021): 1–30. http://dx.doi.org/10.1145/3485494.

Pełny tekst źródła

Streszczenie:

High-level synthesis (HLS), which refers to the automatic compilation of software into hardware, is rapidly gaining popularity. In a world increasingly reliant on application-specific hardware accelerators, HLS promises hardware designs of comparable performance and energy efficiency to those coded by hand in a hardware description language such as Verilog, while maintaining the convenience and the rich ecosystem of software development. However, current HLS tools cannot always guarantee that the hardware designs they produce are equivalent to the software they were given, thus undermining any reasoning conducted at the software level. Furthermore, there is mounting evidence that existing HLS tools are quite unreliable, sometimes generating wrong hardware or crashing when given valid inputs. To address this problem, we present the first HLS tool that is mechanically verified to preserve the behaviour of its input software. Our tool, called Vericert, extends the CompCert verified C compiler with a new hardware-oriented intermediate language and a Verilog back end, and has been proven correct in Coq. Vericert supports most C constructs, including all integer operations, function calls, local arrays, structs, unions, and general control-flow statements. An evaluation on the PolyBench/C benchmark suite indicates that Vericert generates hardware that is around an order of magnitude slower (only around 2× slower in the absence of division) and about the same size as hardware generated by an existing, optimising (but unverified) HLS tool.

Style APA, Harvard, Vancouver, ISO itp.

36

Huuck, Ralf. "Formal Verification, Engineering and Business Value". Electronic Proceedings in Theoretical Computer Science 105 (29.12.2012): 1–4. http://dx.doi.org/10.4204/eptcs.105.1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Lee, Tae-Hoon, i Gi-Hwon Kwon. "Formal Verification of Embedded Java Program". KIPS Transactions:PartD 12D, nr 7 (1.12.2005): 931–36. http://dx.doi.org/10.3745/kipstd.2005.12d.7.931.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Razali, Rozilawati, i Paul Garratt. "Usability Requirement of Formal Verification Tools". Asia-Pacific Journal of Information Technology and Multimedia 01, nr 02 (30.12.2012): 37–52. http://dx.doi.org/10.17576/apjitm-2012-0102-04.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Kishi, Tomoji, i Natsuko Noda. "Formal verification and software product lines". Communications of the ACM 49, nr 12 (grudzień 2006): 73–77. http://dx.doi.org/10.1145/1183236.1183270.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Kumar, Jayanand Asok, i Shobha Vasudevan. "Formal Probabilistic Timing Verification in RTL". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 32, nr 5 (maj 2013): 788–801. http://dx.doi.org/10.1109/tcad.2012.2232706.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Pixley, C. "Formal verification of commercial integrated circuits". IEEE Design and Test of Computers 18, nr 4 (lipiec 2001): 4–5. http://dx.doi.org/10.1109/mdt.2001.936243.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Srivas, M., i M. Bickford. "Formal verification of a pipelined microprocessor". IEEE Software 7, nr 5 (wrzesień 1990): 52–64. http://dx.doi.org/10.1109/52.57892.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Jones, R. B., J. W. O'Leary, C. J. H. Seger, M. D. Aagaard i T. F. Melham. "Practical formal verification in microprocessor design". IEEE Design & Test of Computers 18, nr 4 (2001): 16–25. http://dx.doi.org/10.1109/54.936245.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Choppy, Christine, Kais Klai i Hacene Zidani. "Formal verification of UML state diagrams". ACM SIGSOFT Software Engineering Notes 36, nr 1 (24.01.2011): 1–8. http://dx.doi.org/10.1145/1921532.1921561.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Chen, Xi, Harry Hsieh, Felice Balarin i Yosinori Watanabe. "Formal Verification for Embedded System Designs". Design Automation for Embedded Systems 8, nr 2/3 (czerwiec 2003): 139–53. http://dx.doi.org/10.1023/b:daem.0000003959.60964.4d.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Lukyanov, Georgy, Andrey Mokhov i Jakob Lechner. "Formal Verification of Spacecraft Control Programs". ACM Transactions on Embedded Computing Systems 19, nr 5 (11.11.2020): 1–18. http://dx.doi.org/10.1145/3391900.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Vo, Anh, Sarvani Vakkalanka, Michael DeLisi, Ganesh Gopalakrishnan, Robert M. Kirby i Rajeev Thakur. "Formal verification of practical MPI programs". ACM SIGPLAN Notices 44, nr 4 (14.02.2009): 261–70. http://dx.doi.org/10.1145/1594835.1504214.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Kamali, Maryam, Louise A. Dennis, Owen McAree, Michael Fisher i Sandor M. Veres. "Formal verification of autonomous vehicle platooning". Science of Computer Programming 148 (listopad 2017): 88–106. http://dx.doi.org/10.1016/j.scico.2017.05.006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Avresky, D. R. "Formal verification and testing of protocols". Computer Communications 22, nr 7 (maj 1999): 681–90. http://dx.doi.org/10.1016/s0140-3664(99)00011-0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

FERRO, MANUEL VILARES, JORGE GRAÑA GIL i PILAR ALVARIÑO ALVARIÑO. "Finite state morphology and formal verification". Natural Language Engineering 2, nr 4 (grudzień 1996): 303–4. http://dx.doi.org/10.1017/s1351324997001551.

Pełny tekst źródła

Streszczenie:

The full paper describes an environment for the generation of non-deterministic taggers, currently used for the development of a Spanish lexicon. In relation to previous approaches, our system includes the use of verification tools in order to assure the robustness of the generated taggers. A wide variety of user defined criteria can be applied for checking the exact properties of the system.

Style APA, Harvard, Vancouver, ISO itp.

Artykuły w czasopismach na temat „Formal verification”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych