Sciweavers

718 search results - page 17 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
JAR
2008
101views more  JAR 2008»
13 years 8 months ago
Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves
This article describes the formal verification of a compilation algorithm that transforms parallel moves (parallel assignments between variables) into a semanticallyequivalent sequ...
Laurence Rideau, Bernard P. Serpette, Xavier Leroy
APAL
2005
107views more  APAL 2005»
13 years 8 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
LPAR
2004
Springer
14 years 2 months ago
Knowledge-Based Synthesis of Distributed Systems Using Event Structures
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
Mark Bickford, Robert L. Constable, Joseph Y. Halp...
WWW
2004
ACM
14 years 9 months ago
OntoMiner: bootstrapping ontologies from overlapping domain specific web sites
In this paper, we present automated techniques for bootstrapping and populating specialized domain ontologies by organizing and mining a set of relevant overlapping Web sites prov...
Hasan Davulcu, Srinivas Vadrevu, Saravanakumar Nag...
ICDIM
2008
IEEE
14 years 3 months ago
Unsupervised key-phrases extraction from scientific papers using domain and linguistic knowledge
The domain of Digital Libraries presents specific challenges for unsupervised information extraction to support both the automatic classification of documents and the enhancement ...
Mikalai Krapivin, Maurizio Marchese, Andrei Yadran...