Sciweavers

718 search results - page 62 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
CAV
2007
Springer
104views Hardware» more  CAV 2007»
14 years 2 months ago
Revamping TVLA: Making Parametric Shape Analysis Competitive
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly ...
ECAI
2010
Springer
13 years 10 months ago
On Testing Answer-Set Programs
Answer-set programming (ASP) is a well-acknowledged paradigm for declarative problem solving, yet comparably little effort has been spent on the investigation of methods to support...
Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch...
BMCBI
2005
126views more  BMCBI 2005»
13 years 8 months ago
GANN: Genetic algorithm neural networks for the detection of conserved combinations of features in DNA
Background: The multitude of motif detection algorithms developed to date have largely focused on the detection of patterns in primary sequence. Since sequence-dependent DNA struc...
Robert G. Beiko, Robert L. Charlebois
LOGCOM
1998
110views more  LOGCOM 1998»
13 years 8 months ago
leanTAP Revisited
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
Melvin Fitting
LREC
2010
145views Education» more  LREC 2010»
13 years 10 months ago
Generic Ontology Learners on Application Domains
In ontology learning from texts, we have ontology-rich domains where we have large structured domain knowledge repositories or we have large general corpora with large general str...
Francesca Fallucchi, Maria Teresa Pazienza, Fabio ...