Sciweavers

58 search results - page 5 / 12
» Inductive Synthesis of Equational Programs
Sort
View
ICFP
2008
ACM
15 years 11 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
ESOP
2011
Springer
14 years 3 months ago
General Bindings and Alpha-Equivalence in Nominal Isabelle
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
Christian Urban, Cezary Kaliszyk
MCMASTER
1993
15 years 3 months ago
A Systolizing Compilation Scheme for Nested Loops with Linear Bounds
With the recent advances in massively parallel programmable processor networks, methods for the infusion of massive MIMD parallelism into programs have become increasingly relevant...
Michael Barnett, Christian Lengauer
ACSD
2010
IEEE
251views Hardware» more  ACSD 2010»
14 years 9 months ago
Modular Interpretation of Heterogeneous Modeling Diagrams into Synchronous Equations Using Static Single Assignment
Abstract--The ANR project SPaCIFY develops a domainspecific programming environment, Synoptic, to engineer embedded software for space applications. Synoptic is an Eclipse-based mo...
Jean-Pierre Talpin, Julien Ouy, Thierry Gautier, L...
KCAP
2003
ACM
15 years 4 months ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld