Sciweavers

1205 search results - page 28 / 241
» Program Extraction from Large Proof Developments
Sort
View
DALT
2008
Springer
14 years 22 days ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
BMCBI
2005
98views more  BMCBI 2005»
13 years 10 months ago
DCD - a novel plant specific domain in proteins involved in development and programmed cell death
Background: Recognition of microbial pathogens by plants triggers the hypersensitive reaction, a common form of programmed cell death in plants. These dying cells generate signals...
Raimund Tenhaken, Tobias Doerks, Peer Bork
CSL
2005
Springer
14 years 4 months ago
Light Functional Interpretation
We give a Natural Deduction formulation of an adaptation of G¨odel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proof...
Mircea-Dan Hernest
CMMR
2003
Springer
121views Music» more  CMMR 2003»
14 years 4 months ago
Evolving Automatically High-Level Music Descriptors from Acoustic Signals
High-Level music descriptors are key ingredients for music information retrieval systems. Although there is a long tradition in extracting information from acoustic signals, the fi...
François Pachet, Aymeric Zils
CAV
2001
Springer
119views Hardware» more  CAV 2001»
14 years 3 months ago
Certifying Model Checkers
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
Kedar S. Namjoshi