Sciweavers

3736 search results - page 331 / 748
» Hand-Writing Program Generator Generators
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
ICALP
2009
Springer
16 years 7 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong
ICSE
2005
IEEE-ACM
16 years 6 months ago
What you always wanted to know about agile methods but did not dare to ask
A fleet of emerging agile methods is both gaining popularity and generating lots of controversy. Real-world examples argue for (e.g. [4]) and against (e.g. [6]) agile methods. Sev...
Frank Maurer, Grigori Melnik
160
Voted
ICFP
2003
ACM
16 years 6 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
POPL
2010
ACM
16 years 4 months ago
Verified just-in-time compiler on x86
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
Magnus O. Myreen