Results 1 
8 of
8
Noninterference Security in Communicating Sequential Processes
"... pasquale dot noce at arjowigginsit dot com pasquale dot noce dot lavoro at gmail dot com ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
pasquale dot noce at arjowigginsit dot com pasquale dot noce dot lavoro at gmail dot com
An Isabelle/HOL Formalization of the Textbook Proof of Huffman’s Algorithm
, 2009
"... Huffman’s algorithm is a procedure for constructing a binary tree with minimum weighted path length. This report presents a formal proof of the correctness of Huffman’s algorithm written using Isabelle/HOL. Our proof closely follows the sketches found in standard algorithms textbooks, uncovering a f ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Huffman’s algorithm is a procedure for constructing a binary tree with minimum weighted path length. This report presents a formal proof of the correctness of Huffman’s algorithm written using Isabelle/HOL. Our proof closely follows the sketches found in standard algorithms textbooks, uncovering a few snags in the process. Another distinguishing feature of our formalization is the use of custom induction rules to help Isabelle’s automatic tactics, leading to very short
Formal Verification of a Modern SAT Solver
, 2009
"... We present a formalization and a formal total correctness proof of a MiniSATlike SAT solver within the system Isabelle/HOL. The solver is based on the DPLL procedure and employs most stateofthe art SAT solving techniques, including the conflictguided backjumping, clause learning, and the twowatc ..."
Abstract
 Add to MetaCart
We present a formalization and a formal total correctness proof of a MiniSATlike SAT solver within the system Isabelle/HOL. The solver is based on the DPLL procedure and employs most stateofthe art SAT solving techniques, including the conflictguided backjumping, clause learning, and the twowatch unit propagation scheme. A shallow embedding into HOL is used and the solver is expressed as a set of recursive HOL functions. Based on this specification, the Isabelle’s builtin code generator can be used to generate executable code in several supported functional languages (Haskell, SML, and OCaml). The SAT solver implemented in this way is, to our knowledge, the first fully formally and mechanically verified modern SAT solver.
Computer Algebra implemented in Isabelle’s Function Package under LucasInterpretation — a Case Study
"... The relation of this paper to “TheoremProving (TP) components for educational software ” deserves explanation: TP technology is designed for mechanised justification of formalised facts — so educational software gains a prerequisite for being a “transparent system ” [12] which explains itself. Comp ..."
Abstract
 Add to MetaCart
(Show Context)
The relation of this paper to “TheoremProving (TP) components for educational software ” deserves explanation: TP technology is designed for mechanised justification of formalised facts — so educational software gains a prerequisite for being a “transparent system ” [12] which explains itself. Computer Algebra (CA), however, is not designed for justification (and thus leaves full responsibility
Submitted to: THedu’14 c©W. Neuper This work is licensed under the Creative Commons Attribution License. GCD — a Case Study on LucasInterpretation
"... LucasInterpretation [5] combines computation and deduction such that a learner has free choice in interaction while solving problems in applied mathematics: a next step can be requested from the system and/or can be input with feedback from the system. Thus interactive support in stepwise problem ..."
Abstract
 Add to MetaCart
(Show Context)
LucasInterpretation [5] combines computation and deduction such that a learner has free choice in interaction while solving problems in applied mathematics: a next step can be requested from the system and/or can be input with feedback from the system. Thus interactive support in stepwise problem solving comes close to traditional paper and pencil work. Next steps are computed by a program, while interpretation works stepwise like in a debugger and maintains an environment together with a logical context. The latter provides automated provers with data to check user input by establishing (or not establishing) deductions of input formulas from the context. The prototype of LucasInterpretation in the ISAC project1 raises several open research questions. One of them are the limits of “nextstepguidance”: Which kinds of input guarantee the interpreter to resume execution? So far, there is one positive answer [2], lemma 7 on p.182. Another open question is revealed in the proof of the above mentioned lemma, which involves reachability, not yet tackled in Isabelle [8]: How relates logical consistency of a calculation with the operational semantics of the respective program? Interest on clarification of theoretical foundations for LucasInterpretation is motivated by a case study [7]: this study revealed that ISAC’s programming language is too complicated to hand over authoring to the public.
A General Method for the Proof of Theorems on Tailrecursive Functions
, 2014
"... Pasquale Noce (pasquale dot noce at arjowigginsit dot com) ..."
(Show Context)
A General Method for the Proof of Theorems on Tailrecursive Functions
, 2014
"... Pasquale Noce (pasquale dot noce at arjowigginsit dot com) ..."
(Show Context)
Total Correctness of Recursive functions . . .
"... JML4 is a next generation tooling and research platform for JML. JML4, currently in development, aims to support the integrated capabilities of Runtime Assertion Checking (RAC), Extended Static Checking (ESC), and Full Static Program Verification (FSPV). In this paper, we present the JML4 FSPV Theor ..."
Abstract
 Add to MetaCart
JML4 is a next generation tooling and research platform for JML. JML4, currently in development, aims to support the integrated capabilities of Runtime Assertion Checking (RAC), Extended Static Checking (ESC), and Full Static Program Verification (FSPV). In this paper, we present the JML4 FSPV Theory Generator (TG) that aims to study the adequacy of Isabelle/Simpl as the underlying verification condition language. In particular we study Isabelle/Simpl with respect to proving total correctness of recursive programs. Simpl is a Hoarebased logic for a sequential imperative programming language along with a verification system. It is written in Isabelle/HOL and has been proven sound and relative complete.