Serge Autexier, Dieter Hutter, Heiko Mantel, and Axel Schairer. System description: INKA 5.0 { a Logic Voyager. In H. Ganzinger, editor, Proceedings of the 16 International Conference on Automated Deduction (CADE), LNAI 1632, Trento, Italy, 1999. Springer.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... L A T E X pretty printer, facilities for printing signatures of specifications and structure graphs of Casl specifications, with an encoding of Casl specifications into second order logic [Mos03] providing links to various verification and development systems including Isabelle and INKA [AHMS99] The most focussed collaborative activity nowadays is on tool development, see http: www.tzi.de cofi Tools. There is also some further work on various topics in algebraic specification in the Casl context; for two recent examples see [MS02] and [BST02b] However, with the completion of the ....

S. Autexier, D. Hutter, H. Mantel and A. Schairer. System description: INKA 5.0 -- a logic voyager. Proc. 16th Intl. Conf. on Automated Deduction. Springer LNAI 1632, 207--211, 1999.

....solve the source problem. The result of the reformulation process is either a complete or partial proof in PDS format. 21 Induction Agent Ind. Trans Induction Reas. So far, we do not have any reasoning component specialised on induction integrated into the system. However, the INKA system [AHMS99] is currently being integrated into the Mathweb environment. Thus, we will be able to employ this system soon. Since INKA uses a sequent calculus and stores proofs in a PDS like structure, it will be straightforward to integrate the subproofs found by INKA with the help of an appropriate ....

S. Autexier, D. Hutter, H. Mantel, and A. Schairer. System Description: inka 5.0 - A Logic Voyager. In H. Ganzinger, editor, Proceedings of the 16th Conference on Automated Deduction (CADE{16), volume 1632 of LNAI, pages 207-211, Trento, Italy, 1999. Springer Verlag, Berlin, Germany.

....[38] Various verification tools have already been developed for algebraic specifications, and can be reused for specific subsets of Casl: equational, conditional, full first order logic with total functions, total functions with subsorts, partial functions, etc. The systems KIV [56] and INKA 5. 0 [6, 7] provide integrated specification and theorem proving environments for sublanguages of Casl that exclude partial functions. Another direction is to encode Casl in proof systems like Isabelle or PVS. This is the approach chosen in [8] for proving theorems about Casl specifications with PVS, and in ....

S. Autexier, D. Hutter, H. Mantel, and A. Schairer. System description: INKA 5.0 - a logical voyager. In H. Ganzinger, editor, Proceedings 16th International Conference on Automated Deduction, CADE-16, volume 1732 of Lecture Notes in Artificial Intelligence, Trento, 1999. Springer.

No context found.

Serge Autexier, Dieter Hutter, Heiko Mantel, and Axel Schairer. System description: INKA 5.0 { a Logic Voyager. In H. Ganzinger, editor, Proceedings of the 16 International Conference on Automated Deduction (CADE), LNAI 1632, Trento, Italy, 1999. Springer.

No context found.

Autexier, Serge, Hutter, Dieter, Mantel, Heiko and Schairer, Axel. (1999). System description: Inka 5.0 -- a logic voyager. In on Automated Deduction (CADE), LNAI 1632, Trento, Italy. Springer.

No context found.

S. Autexier, D. Hutter, H. Mantel, and A. Schairer. System description: Inka 5.0 - a logic voyager. In H. Ganzinger, editor, Proceedings of CADE-16, Trento, Italy, volume 1632 of LNAI. Springer-Verlag, 1999.

....can be carried out reliably as a matter of routine, rather than, after each change, requiring massive rework that could have been avoided. For the context of a support system for formal development like the Veri cation Support Environment (VSE) 1] or the combiniation of Maya [3] and Inka [2], we suggested a novel approach that works by transforming complete speci cations and associated proofs in [10] Basic transformations correspond to atomic Add type, add function, add predicate add a de nition to the signature Remove type, remove function, remove predicate remove a ....

S. Autexier, D. Hutter, H. Mantel, and A. Schairer. System description: INKA 5.0 - a logic voyager. In Proc. Int. Conf. Automated Deduction (CADE), 1999.

....l ) Then, Th (N) holds for all N 2 N . Proof. Directly from Def. 3 and the translation property (cf. Def. 1) ut To verify the proof obligations on local theorem links, which we call veri cation in the small, we make use of standard theorem provers like Isabelle [12] or Inka 5. 0 [1]. The reader is refered to [3] for a description how development graph and theorem provers are technically connected. See [11] for an extension of development graphs by hiding which translates proof obligations in theories based on hiding to proof obligations in theories without hiding. 3 ....

....the development graph supports evolutionary formal software development with respect to arbitrary speci cation languages, provided there exists an adequate mapping from the speci cation language into development graphs. Currently Maya integrates parsers for the speci cation languages Casl (cf. [1]) and VSE SL (cf. 6] With respect to the veri cation in the small, Maya supports the use of arbitrary theorem provers for higher order logic. To this end a generic interface to propagate the changes of theories to the theorem provers has been implemented. Currently, the HOL Casl instance of ....

[Article contains additional citation context not shown here]

S. Autexier, D. Hutter, H. Mantel, A. Schairer. System description: InKa 5.0 - a logic voyager. In H. Ganzinger (Ed.): 16th International Conference on Automated Deduction, Springer, LNAI 1632, 1999.

....procedures, abstractions and refinements can be defined in the framework, and how these techniques are linked together and subsequently can be applied for proof search. The framework serves as the basis for the ongoing implementation of the core reasoning mechanisms in the INKA 5. 0 system [1]. Future work consists of finishing the implementation of the framework, and to validate the adequacy of the framework by implementing reasoning levels and structuring mechanisms for specific domains and problems. Theoretical future work is concerned with the integration of further logics into the ....

Serge Autexier, Dieter Hutter, Heiko Mantel, and Axel Schairer. System description: INKA 5.0 -- a Logic Voyager. In H. Ganzinger, editor, Proceedings of the 16 International Conference on Automated Deduction (CADE), LNAI 1632, Trento, Italy, 1999. Springer.

....the usual proof rules for structured speci cations as in [Bor01] Moreover, we expect no diculty when extending the management of change developed in [AHMS00] to the case of development graphs with hiding in order to integrate the presented approach into the development graph system of INKA 5. 0 [AHMS99]. Then it will be possible to support the maintenance of changes in developments by machine also when hiding are present. In [AHMS00] we have described a translation from CASL structured speci cations to development graphs. It should be straightforward to extend this translation to structured ....

S. Autexier, D. Hutter, H. Mantel, A. Schairer. System Description: Inka 5.0 - A Logic Voyager. In H. Ganzinger, (Ed.), Proceedings of CADE-16, Trento, Italy, LNAI 1632, Springer-Verlag, 1999.

....code for free, in particular most calls to named tactics and success continuations are tail calls and so do not consume stack space. The tactic compiler is integrated with the underlying programming language by a common lisp macro. We plan to integrate the compiled version into the INKA system [2]. 12 Axel Schairer, Serge Autexier, and Dieter Hutter The advantage of the technique is that both the user and the machine can determine the overall structure of a proof, and both can ll in details of a proof that the other is working on without interrupting it. This is not possible in existing ....

S. Autexier, D. Hutter, H. Mantel, and A. Schairer. System description: INKA

....are largely independant of the term logic. However, rules like V Substitution de ne the link between annotation and term logic and thus the mightiness of the approach. The presented framework, i.e. a higher order version of the annotated logic, has been implemented in the INKA 5. 0 system [2]. In particular, an annotated higher order uni cation algorithm has been implemented. Using for instance square root computations based on Church numerals as a test set, it turned out that its ecency is compatible with standard non annotated versions (e.g. computing square root of 625 in less than ....

Serge Autexier, Dieter Hutter, Heiko Mantel, and Axel Schairer. System description: INKA 5.0 - a logical voyager. In H. Ganzinger, editor, Proceedings 16th International Conference on Automated Deduction, CADE-16, Trento, Italy, 1999. Springer-Verlag, LNAI 1632.

....of these changes to a minimum. In this paper we present a structured, logical data base for structured specifications. This data base, which we call a development graph, is independent of a specific specification language and serves as the underlying data base of the deduction system INKA 5. 0 [1]. Besides the already mentioned structured specification it contains information about speculated properties between different theories (or speculated properties of a particular theory) and in case they have been proven the related proofs. The development graph can only be changed by a ....

....morphisms we may trace which parts of the specification are affected by the changes and invalidate only those proofs which make use of the really changed parts. 6. Implementation The described approach of a management of change has been implemented into the theorem proving system INKA 5. 0 [1]. INKA offers various specification languages like CASL [6] or VSE SL [12] as possible input languages. In particular we developed translations from the structuring mechanisms of the various specification languages (like for instance translations, unions, named and parameterized specifications, ....

[Article contains additional citation context not shown here]

S. Autexier, D. Hutter, H. Mantel, and A. Schairer. System description: INKA 5.0 - a logical voyager. In H. Ganzinger, editor, Proceedings 16th International Conference on Automated Deduction, CADE-16, Trento, Italy, 1999. SpringerVerlag, LNAI 1632.

....the corresponding theorems explicitly. Changes of the underlying Casl speci cation are propagated to (minimal) changes of the development graph in order to preserve as much proof work as possible. The presented framework has been implemented and successfully tested in various examples in INKA 5. 0 [AHMS99]. Its database is organized into deductive units which are linked via morphisms. Proofs are always done within a speci c unit where the system has only access to those parts of the database which are accessible from this unit via de nition links. The view on these imported theories is controlled ....

S. Autexier, D. Hutter, H. Mantel, A. Schairer. System description: INKA 5.0 - a logic voyager. In H. Ganzinger (Ed.): 16th International Conference on Automated Deduction, Springer, LNAI 1632, 1999.

....whether they are really a ected by the changes. In this talk we propose such a management of change for a veri cation system which allows for changes of the speci cation resulting in non monotonic changes of the underlying logical representation. Our approach, implemented into the INKA system [1], is twofold. On one hand the notion of development graph [2] constitutes the representational logical framework to represent structured speci cations independent of a concrete speci cation language. On the other hand, the development graph is the starting point to compute the minimal changes of ....

S. Autexier, D. Hutter, H. Mantel, A. Schairer. System Description: INKA 5.0 - A Logic Voyager, In H. Ganzinger (Ed.), Proceedings of CADE-16, Trento, Italy, 1999.

....level and a generic replacement paradigm is available to modify the content of windows. The generic computation rules and the general replacement rules form the basis for the definition of generic tactics. The framework is currently under development a part of the theorem proving system INKA 5. 0 [2]. Within the system we implemented a first order logic sequent calculus and tested the framework in the way described in section 6.2. Future work will consist in extracting the framework as a module of its own, in order to have a full stand alone implementation of the presented framework. Further ....

Autexier, S., Hutter, D., Mantel, H., Schairer, A.: System Description: INKA 5.0 - A Logic Voyager, H. Ganzinger, editor, Proceedings of the 16 th International Conference on Automated Deduction (CADE-16), pp. 207-211, Trento, Italy, July 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC