This paper discusses plans for joint work in order to gain early feedback from the community. Three lines of work pursued independently so far shall be joined: (1) narrowing the gap between declarative program spec-ification and program generation already working in Isabelle, (2) reusing work, which embedded an input-response-loop re-sembling Computer Algebra Systems (CAS) into HOL Light, and (3) reconstructing an experimental language for applied mathe-matics by exploiting established as well as emerging features of Isabelle/Isar. These plans have to be seen as part of a variety of highly ac-tive research areas — on “integration of the deduction and the computational power ” of Computer Theorem Proving (CTP) and CAS respectively (Calculemu...
The growing complexity and diversity of models used for engineering dependable systems implies that ...
Since 2004 we have been teaching a second-year programming course to all engineering students at UCL...
Interactive theorem proving is the modern way of formalizing mathematics using a computer as a proof...
Workshop Description This workshop intends to gather the research communities for Computer Theorem p...
Abstract: CSP-CASL is but one of the many languages for which Bernd Krieg-Brückner (BKB) had a grea...
Abstract. The use of computer algebra is usually considered beneficial for mechanised reasoning in m...
this paper is to investigate the impact on the design of a programming language of tight integration...
The Isabelle/PIDE platform addresses the question whether proof assistants of the LCF family are sui...
Isabelle/UTP is a mechanised theory engineering toolkit based on Hoare and He’s Unifying Theories of...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
The Isabelle/PIDE platform addresses the question whether proof assistants of the LCF family are sui...
Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interactio...
This paper discusses the relationship between transformational programming and theorem proving. It i...
The paper presents the use of computer programming to solving typical engineering problems. First of...
This paper presents an algorithm for translating concurrent procedural language programs into nonpro...
The growing complexity and diversity of models used for engineering dependable systems implies that ...
Since 2004 we have been teaching a second-year programming course to all engineering students at UCL...
Interactive theorem proving is the modern way of formalizing mathematics using a computer as a proof...
Workshop Description This workshop intends to gather the research communities for Computer Theorem p...
Abstract: CSP-CASL is but one of the many languages for which Bernd Krieg-Brückner (BKB) had a grea...
Abstract. The use of computer algebra is usually considered beneficial for mechanised reasoning in m...
this paper is to investigate the impact on the design of a programming language of tight integration...
The Isabelle/PIDE platform addresses the question whether proof assistants of the LCF family are sui...
Isabelle/UTP is a mechanised theory engineering toolkit based on Hoare and He’s Unifying Theories of...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
The Isabelle/PIDE platform addresses the question whether proof assistants of the LCF family are sui...
Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interactio...
This paper discusses the relationship between transformational programming and theorem proving. It i...
The paper presents the use of computer programming to solving typical engineering problems. First of...
This paper presents an algorithm for translating concurrent procedural language programs into nonpro...
The growing complexity and diversity of models used for engineering dependable systems implies that ...
Since 2004 we have been teaching a second-year programming course to all engineering students at UCL...
Interactive theorem proving is the modern way of formalizing mathematics using a computer as a proof...