Sciweavers

134 search results - page 20 / 27
» Meronymy Extraction Using An Automated Theorem Prover
Sort
View
AISC
1998
Springer
15 years 2 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
AGP
1995
IEEE
15 years 1 months ago
A Prolog Implementation of Kem
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
Alberto Artosi, Paola Cattabriga, Guido Governator...
ENTCS
2006
122views more  ENTCS 2006»
14 years 9 months ago
Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
Damián Barsotti, Leonor Prensa Nieto, Alwen...
KBSE
1998
IEEE
15 years 2 months ago
Planning Equational Verification in CCS
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
Raul Monroy, Alan Bundy, Ian Green
TPHOL
1998
IEEE
15 years 2 months ago
Co-inductive Axiomatization of a Synchronous Language
Abstract. Over the last decade, the increasing demand for the validation of safety critical systems lead to the development of domain-specific programming languages (e.g. synchrono...
David Nowak, Jean-René Beauvais, Jean-Pierr...