Results 1  10
of
14
Interpretation of locales in Isabelle: Theories and proof contexts
 MATHEMATICAL KNOWLEDGE MANAGEMENT (MKM 2006), LNAI 4108
, 2006
"... The generic proof assistant Isabelle provides a landscape of specification contexts that is considerably richer than that of most other provers. Theories are the level of specification where objectlogics are axiomatised. Isabelle’s proof language Isar enables local exploration in contexts generated ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
The generic proof assistant Isabelle provides a landscape of specification contexts that is considerably richer than that of most other provers. Theories are the level of specification where objectlogics are axiomatised. Isabelle’s proof language Isar enables local exploration in contexts generated in the course of natural deduction proofs. Finally, locales, which may be seen as detached proof contexts, offer an intermediate level of specification geared towards reuse. All three kinds of contexts are structured, to different extents. We analyse the “topology ” of Isabelle’s landscape of specification contexts, by means of development graphs, in order to establish what kinds of reuse are possible.
Towards collaborative content management and version control for structured mathematical knowledge
 Mathematical Knowledge Management, MKM’03, number 2594 in LNCS
, 2003
"... Abstract. We propose an infrastructure for collaborative content management and version control for structured mathematical knowledge. This will enable multiple users to work jointly on mathematical theories with minimal interference. We describe the API and the functionality needed to realize a cvs ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We propose an infrastructure for collaborative content management and version control for structured mathematical knowledge. This will enable multiple users to work jointly on mathematical theories with minimal interference. We describe the API and the functionality needed to realize a cvslike version control and distribution model. This architecture extends the cvs architecture in two ways, motivated by the specific needs of distributed management of structured mathematical knowledge on the Internet. On the one hand the onelevel client/server model of cvs is generalized to a multilevel graph of client/server relations, and on the other hand the underlying changedetection tools take the mathspecific structure of the data into account. 1
Verification of Software Product Lines with Deltaoriented Slicing
"... Abstract. Software product line (SPL) engineering is a wellknown approach to develop industrysize adaptable software systems. SPL are often used in domains where highquality software is desirable; the overwhelming product diversity, however, remains a challenge for assuring correctness. In this p ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Software product line (SPL) engineering is a wellknown approach to develop industrysize adaptable software systems. SPL are often used in domains where highquality software is desirable; the overwhelming product diversity, however, remains a challenge for assuring correctness. In this paper, we present deltaoriented slicing, an approach to reduce the deductive verification effort across an SPL where individual products are Java programs and their relations are described by deltas. On the specification side, we extend the delta language to deal with formal specifications. On the verification side, we combine proof slicing and similarityguided proof reuse to ease the verification process. 1
ΩMEGA: Computer supported mathematics
 IN: PROCEEDINGS OF THE 27TH GERMAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (KI 2004)
, 2004
"... The year 2004 marks the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number” (with Martin Davis’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated dedu ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
The year 2004 marks the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number” (with Martin Davis’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated deduction used machine oriented calculi to find the proof for a theorem by automatic means, the Automath project of N.G. de Bruijn – more modest in its aims with respect to automation – showed in the late 1960s and early 70s that a complete mathematical textbook could be coded and proofchecked by a computer. Classical theorem proving procedures of today are based on ingenious search techniques to find a proof for a given theorem in very large search spaces – often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited. The shift
Interpretation of locales in Isabelle: Managing dependencies between locales
, 2006
"... Locales are the theory development modules of the Isabelle proof assistant. Interpretation is a powerful technique of theorem reuse which facilitates their automatic transport to other contexts. This paper is concerned with the interpretation of locales in the context of other locales. Our main conc ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Locales are the theory development modules of the Isabelle proof assistant. Interpretation is a powerful technique of theorem reuse which facilitates their automatic transport to other contexts. This paper is concerned with the interpretation of locales in the context of other locales. Our main concern is to make interpretation an effective tool in an interactive proof environment. Interpretation dependencies between locales are maintained explicitly, by means of a development graph, so that theorems proved in one locale can be propagated to other locales that interpret it. Proof tools in Isabelle are controlled by sets of default theorems they use. These sets are required to be finite, but can become infinite in the presence of arbitrary interpretations. We show that finiteness can be maintained.
Engineering Mathematical Knowledge
 Mathematical Knowledge Management, number 3863 in LNAI
, 2005
"... Abstract. Due to their rapidly increasing amount, maintaining mathematical documents more and more becomes an engineering task. In this paper, we combine the projects MMiSS 3 and CDET. 4 That way, we achieve major benefits for mathematical knowledge management: (1) Semantic annotations relate mathem ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Due to their rapidly increasing amount, maintaining mathematical documents more and more becomes an engineering task. In this paper, we combine the projects MMiSS 3 and CDET. 4 That way, we achieve major benefits for mathematical knowledge management: (1) Semantic annotations relate mathematical constructs. This reaches beyond mathematics and thus fosters integration of mathematical content into a broader context. (2) Finegrained version control enables change management and configuration management. (3) Semiformal consistency management identifies violations of userdefined consistency requirements and proposes how they can be best resolved. 1
Computer Supported Formal Work: Towards a Digital Mathematical Assistant
 STUDIES IN LOGIC, GRAMMAR AND RHETORIC
, 2007
"... The year 2004 marked the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number ” (with Martin Davis ’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The year 2004 marked the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number ” (with Martin Davis ’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated deduction used machine oriented calculi to find the proof for a theorem by automatic means, the Automath project of N.G. de Bruijn – more modest in its aims with respect to automation – showed in the late 1960s and early 70s that a complete mathematical textbook could be coded and proofchecked by a computer. Roughly at the same time in 1973, the Mizar project started as an attempt to reconstruct mathematics based on computers. Since 1989, the most important activity in the Mizar project has been the development of a database for mathematics. International cooperation resulted in creating a database which includes more than 7000 definitions of mathematical concepts and more than 42000 theorems. The work by
Algebraic structures in Axiom and Isabelle: attempt at a comparison
, 2007
"... The hierarchic structures of abstract algebra pose challenges to the module systems of both programming and specification languages. We relate two existing module systems that are designed for this purpose: the type system of the computer algebra system Axiom, and the module system of the theorem p ..."
Abstract
 Add to MetaCart
The hierarchic structures of abstract algebra pose challenges to the module systems of both programming and specification languages. We relate two existing module systems that are designed for this purpose: the type system of the computer algebra system Axiom, and the module system of the theorem prover Isabelle.
SPECIAL SECTION ON THE INDUSTRIALIZATION OF FORMAL METHODS: A VIEW FROM FORMAL METHODS
, 2005
"... Software tools for safetycritical software development ..."
(Show Context)