Sciweavers

34 search results - page 4 / 7
» System Description: LEO - A Higher-Order Theorem Prover
Sort
View
ICFEM
2005
Springer
14 years 27 days ago
Using Three-Valued Logic to Specify and Verify Algorithms of Computational Geometry
Many safety-critical systems deal with geometric objects. Reasoning about the correctness of such systems is mandatory and requires the use of basic definitions of geometry for th...
Jens Brandt, Klaus Schneider
FBT
2000
167views Formal Methods» more  FBT 2000»
13 years 8 months ago
Diagrams for Dataflow
The behavior of reactive systems can be described by their black box properties as a relation between input and output streams. More operational is the behavior's description...
Max Breitling, Jan Philipps
CORR
2012
Springer
212views Education» more  CORR 2012»
12 years 3 months ago
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdot...
CADE
2009
Springer
14 years 2 months ago
SPASS Version 3.5
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent deve...
Christoph Weidenbach, Dilyana Dimova, Arnaud Fietz...
ICWS
2004
IEEE
13 years 8 months ago
Logic-based Web Services Composition: From Service Description to Process Model
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...
Jinghai Rao, Peep Küngas, Mihhail Matskin