Sciweavers

3470 search results - page 428 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
LOPSTR
2004
Springer
16 years 18 days ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
PPDP
2004
Springer
16 years 18 days ago
A semantics for tracing declarative multi-paradigm programs
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
Bernd Brassel, Michael Hanus, Frank Huch, Germ&aac...
WCRE
2000
IEEE
15 years 11 months ago
Next Generation Data Interchange: Tool-to-Tool Application Program Interfaces
Data interchange in the form of a standard exchange format(SEF) is only a first step towards tool interoperability. Inter-tool communication using files is slow and cumbersome; a ...
Susan Elliott Sim
ATVA
2007
Springer
162views Hardware» more  ATVA 2007»
16 years 1 months ago
Verifying Heap-Manipulating Programs in an SMT Framework
Automated software verification has made great progress recently, and a key enabler of this progress has been the advances in efficient, automated decision procedures suitable fo...
Zvonimir Rakamaric, Roberto Bruttomesso, Alan J. H...
ICLP
2007
Springer
16 years 1 months ago
Universal Timed Concurrent Constraint Programming
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...
Carlos Olarte, Catuscia Palamidessi, Frank Valenci...