Sciweavers

34 search results - page 1 / 7
» Algorithms for Generation in Lambek Theorem Proving
Sort
View
ACL
1990
13 years 6 months ago
Algorithms for Generation in Lambek Theorem Proving
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This stra...
Erik-Jan van der Linden, Guido Minnen
DIAGRAMS
2004
Springer
13 years 10 months ago
Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams
An important aim of diagrammatic reasoning is to make it easier for people to create and understand logical arguments. We have worked on spider diagrams, which visually express log...
Jean Flower, Judith Masthoff, Gem Stapleton
PTS
2010
175views Hardware» more  PTS 2010»
13 years 2 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
JSYML
2000
66views more  JSYML 2000»
13 years 4 months ago
A Finite Basis Theorem for Residually Finite, Congruence Meet-Semidistributive Varieties
We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a finite language is congruence meet-sem...
Ross Willard
SAC
2010
ACM
13 years 2 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...