Sciweavers

632 search results - page 33 / 127
» Combining programming with theorem proving
Sort
View
JLP
2007
114views more  JLP 2007»
13 years 7 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
POPL
2007
ACM
14 years 8 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
GCC
2003
Springer
14 years 1 months ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 8 months ago
Checking the Quality of Clinical Guidelines using Automated Reasoning Tools
Requirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-orient...
Arjen Hommersom, Peter J. F. Lucas, Patrick van Bo...
JSC
2008
73views more  JSC 2008»
13 years 7 months ago
Standard bases in K
In this paper we study standard bases for submodules of K[[t1, . . . , tm]][x1, . . . , xn]s respectively of their localisation with respect to a t-local monomial ordering. The mai...
Thomas Markwig