Filters








22,738 Hits in 4.4 sec

Debugging Program Verification Proof Scripts (Tool Paper) [article]

Bernhard Beckert and Sarah Grebing and and Alexander Weigl
2018 arXiv   pre-print
This debugger adapts successful concepts from software debugging to the area of proof script debugging. The tool is built on top of KeY, a system for deductive verification of Java programs.  ...  Interactive program verification is characterized by iterations of unfinished proof attempts.  ...  Special thanks go to An Thuy Tien Luong who provided valuable comments concerning the usage of psdbg and the proof scripting language.  ... 
arXiv:1804.04402v1 fatcat:s5nwb5ne5zbfbieixkqwhm4hbq

The Isabelle Framework [chapter]

Makarius Wenzel, Lawrence C. Paulson, Tobias Nipkow
2008 Lecture Notes in Computer Science  
The Proof General Emacs interface [3] is still the de-facto standard for interaction with Isabelle.  ...  Isabelle/Isar provides sophisticated extra-logical infrastructure supporting structured proofs and specifications, including concepts for modular theory development.  ...  The Proof General Emacs interface [3] is still the de-facto standard for interaction with Isabelle.  ... 
doi:10.1007/978-3-540-71067-7_7 fatcat:y75g4zyzmjdgbkmosmujtq7yra

The KeY Platform for Verification and Analysis of Java Programs [chapter]

Wolfgang Ahrendt, Bernhard Beckert, Daniel Bruns, Richard Bubel, Christoph Gladisch, Sarah Grebing, Reiner Hähnle, Martin Hentschel, Mihai Herda, Vladimir Klebanov, Wojciech Mostowski, Christoph Scheben (+2 others)
2014 Lecture Notes in Computer Science  
We use the current release of the KeY system as an example to explain and prove this claim.  ...  The KeY system offers a platform of software analysis tools for sequential Java. Foremost, this includes full functional verification against contracts written in the Java Modeling Language.  ...  The problem is that after a failed automated verification attempt, the user may be confronted with an intermediate proof object that is difficult to understand, because the automatic proof strategy tends  ... 
doi:10.1007/978-3-319-12154-3_4 fatcat:3eunuqfaxzhdvg6xcr5muxx2sq

More Programming Than Programming: Teaching Formal Methods in a Software Engineering Programme [article]

James Noble, David Streader, Isaac Oscar Gariano, Miniruwani Samarakoon
2022 arXiv   pre-print
Formal methods for software correctness are critical to the future of software engineering - and so must be an essential part of software engineering education.  ...  Our redeveloped course increased student retention and resulted in the best evaluation for the course for at least ten years.  ...  Acknowledgements Thanks to Rustan Leino and James Wilcox for all their help with Dafny; to our colleagues Marco Servetto for the "marcotron" weekly question system, to Royce Brown, Christo Muller, and  ... 
arXiv:2205.00787v1 fatcat:opqtlvw22naajcvepgeaezyrse

Meta-Logical Frameworks and Formal Digital Libraries [chapter]

Carsten Schürmann
2008 Lecture Notes in Computer Science  
The central concepts in software verification are program code and formal proofs. Proofs vouch for the fact that software adheres to its specification.  ...  Programming morphisms involves programming with meanings and proof objects.  ... 
doi:10.1007/978-3-540-69149-5_51 fatcat:23jhr6jginasfbdz7fsox4jfim

R-Rio (poster session)

Alexandre Sztajnberg, Orlando Loques
2000 Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) - OOPSLA '00  
Meta-Level Programming approaches pave the way to separation of concerns by handling functional and non-functional aspects in different levels, but provide little help for software composition, verification  ...  Approaches based on Software Architecture Description Languages can overcome these deficiencies and additionally may discipline, and make explicit, the deployment of meta-level programming.  ...  SA/CP are described with Architecture Description Languages (ADL), which are suitable for property and architectural conformance checking due to the explicit module composition exposition.  ... 
doi:10.1145/367845.367960 dblp:conf/oopsla/SztajnbergL00 fatcat:hjlqjfd2lfcuhflnajxizoewbe

seL4

Gerwin Klein, Michael Norrish, Thomas Sewell, Harvey Tuch, Simon Winwood, June Andronick, Kevin Elphinstone, Gernot Heiser, David Cock, Philip Derrin, Dhammika Elkaduwe, Kai Engelhardt (+1 others)
2010 Communications of the ACM  
We report on the formal, machine-checked verification of the seL4 microkernel from an abstract specification down to its C implementation.  ...  This encompasses traditional design and implementation safety properties such as that the kernel will never crash, and it will never perform an unsafe operation.  ...  Acknowledgements We would like to acknowledge the contribution of the former team members on this verification project: Timothy Bourke, Jeremy Dawson, Jia Meng, Catherine Menon, and David Tsai.  ... 
doi:10.1145/1743546.1743574 fatcat:cuqv3av3ojfm3os7u2mv5cf2oi

Didactical Issues at the Interface of Mathematics and Computer Science [chapter]

Viviane Durand-Guerrier, Antoine Meyer, Simon Modeste
2019 The Mathematics Teacher in the Digital Era  
We will elaborate on the links between the concepts of algorithm, proof, and program, and will argue for their significance in a general reflection on didactical issues in mathematics and computer science  ...  their interactions is essential in order to tackle the challenges of mathematics and computer science education in the digital era.  ...  for a given programming language, or automatic or semi-automatic verification software.  ... 
doi:10.1007/978-3-030-28483-1_6 fatcat:cgtoxvtatfdipczdeyocpkav5y

Verifying Test-Hypotheses

Achim D. Brucker, Lukas Brügger, Burkhart Wolff
2008 Electronical Notes in Theoretical Computer Science  
Since HOL-TestGen generates explicit test hypotheses and makes them amenable to formal proof, the system is in a unique position to explore the relations between them at an example.  ...  Test data were used in an automatically generated test-driver running the program under test.  ...  The HOL-TestGen System: An Overview HOL-TestGen is an interactive (semi-automated) test tool for specification based tests.  ... 
doi:10.1016/j.entcs.2008.11.003 fatcat:jtu2w4d63fagxkjyp3y5b2ssnq

Full functional verification of linked data structures

Karen Zee, Viktor Kuncak, Martin Rinard
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
By appropriately applying multiple proof techniques to discharge different subformulas, this reasoning system can effectively prove the complex and challenging verification conditions that arise in this  ...  We present the first verification of full functional correctness for a range of linked data structure implementations, including mutable lists, trees, graphs, and hash tables.  ...  We thank Charles Bouillaguet for developing the interface to first-order provers [14] . We also thank the anonymous reviewers and our shepherd, Rajeev Alur, for their useful feedback on the paper.  ... 
doi:10.1145/1375581.1375624 dblp:conf/pldi/ZeeKR08 fatcat:xdwn3c6bdvgpvkzakt44gj7iu4

The Subject-Oriented Approach to Software Design and the Abstract State Machines Method [chapter]

Egon Börger
2012 Lecture Notes in Business Information Processing  
The construction of an ASM model for the basic S-BPM concepts revealed a strong relation between S-BPM and the ASM method for software design and analysis.  ...  We use the analysis to evaluate S-BPM as an approach to business process modeling and to suggest some challenging practical extension of the S-BPM system.  ...  Therefore it was natural to develop an orthogonal communication concept (inspired by CCS [47] and CSP [42] ) which is compatible with the principal (at the time prevailingly object-oriented) programming  ... 
doi:10.1007/978-3-642-29133-3_1 fatcat:7o3y4m62izg5tgsekoqdnrhzei

Full functional verification of linked data structures

Karen Zee, Viktor Kuncak, Martin Rinard
2008 SIGPLAN notices  
By appropriately applying multiple proof techniques to discharge different subformulas, this reasoning system can effectively prove the complex and challenging verification conditions that arise in this  ...  We present the first verification of full functional correctness for a range of linked data structure implementations, including mutable lists, trees, graphs, and hash tables.  ...  We thank Charles Bouillaguet for developing the interface to first-order provers [14] . We also thank the anonymous reviewers and our shepherd, Rajeev Alur, for their useful feedback on the paper.  ... 
doi:10.1145/1379022.1375624 fatcat:lblfpn5a5nh6jm276xlgbzxp24

The Subject-Oriented Approach to Software Design and the Abstract State Machines Method [chapter]

Egon Börger
2012 Lecture Notes in Computer Science  
The construction of an ASM model for the basic S-BPM concepts revealed a strong relation between S-BPM and the ASM method for software design and analysis.  ...  with.  ...  Therefore it was natural to develop an orthogonal communication concept (inspired by CCS [47] and CSP [42] ) which is compatible with the principal (at the time prevailingly object-oriented) programming  ... 
doi:10.1007/978-3-642-28279-9_6 fatcat:3qf6ohtwbzfa7nd4u5ntzzlesi

Towards Safer Smart Contracts: A Survey of Languages and Verification Methods [article]

Dominik Harz, William Knottenbelt
2018 arXiv   pre-print
To that end, we present an overview concerning paradigm, type, instruction set, semantics, and metering. Second, we examine verification tools and methods for smart contract and distributed ledgers.  ...  Significant efforts are taken to improve their security by introducing new programming languages and advance verification methods. We provide a survey of those efforts in two parts.  ...  This research is funded by the Outlier Ventures research grant for the Imperial Centre for Cryptocurrency Research and Engineering.  ... 
arXiv:1809.09805v4 fatcat:qgkoagaifvegjivy2vmu4tjfjy

HolPy: Interactive Theorem Proving in Python [article]

Bohua Zhan
2020 arXiv   pre-print
HolPy is an interactive theorem proving system implemented in Python. It uses higher-order logic as the logical foundation.  ...  Its main features include a pervasive use of macros in producing, checking, and storing proofs, a JSON-based format for theories, and an API for implementing proof automation and other extensions in Python  ...  Domain-specific user interfaces for interactive theorem proving can be applied to other areas. One particularly promising direction is program verification.  ... 
arXiv:1905.05970v2 fatcat:dwkzzm5orfh5ljxgxtpkjyi5qe
« Previous Showing results 1 — 15 out of 22,738 results