A positive supercompiler
We introduce a positive supercompiler, a version of Turchin's supercompiler maintaining
only positive information during transformation, and using folding without generalization …
only positive information during transformation, and using folding without generalization …
Automated termination proofs for Haskell by term rewriting
There are many powerful techniques for automated termination analysis of term rewriting.
However, up to now they have hardly been used for real programming languages. We …
However, up to now they have hardly been used for real programming languages. We …
Machine learning of syntactic parse trees for search and classification of text
B Galitsky - Engineering Applications of Artificial Intelligence, 2013 - Elsevier
We build an open-source toolkit which implements deterministic learning to support search
and text classification tasks. We extend the mechanism of logical generalization towards …
and text classification tasks. We extend the mechanism of logical generalization towards …
Automated termination analysis of Java Bytecode by term rewriting
We present an automated approach to prove termination of Java Bytecode (JBC) programs
by automatically transforming them to term rewrite systems (TRSs). In this way, the …
by automatically transforming them to term rewrite systems (TRSs). In this way, the …
Inferring the semantic properties of sentences by mining syntactic parse trees
We extend the mechanism of logical generalization toward syntactic parse trees and attempt
to detect semantic signals unobservable in the level of keywords. Generalization from a …
to detect semantic signals unobservable in the level of keywords. Generalization from a …
Conjunctive partial deduction: Foundations, control, algorithms, and experiments
Partial deduction in the Lloyd–Shepherdson framework cannot achieve certain optimisations
which are possible by unfold/fold transformations. We introduce conjunctive partial …
which are possible by unfold/fold transformations. We introduce conjunctive partial …
Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode
Recently, we developed an approach for automated termination proofs of Java Bytecode
(JBC), which is based on constructing and analyzing termination graphs. These graphs …
(JBC), which is based on constructing and analyzing termination graphs. These graphs …
Partial evaluation of functional logic programs
Languages that integrate functional and logic programming with a complete operational
semantics are based on narrowing, a unification-based goal-solving mechanism which …
semantics are based on narrowing, a unification-based goal-solving mechanism which …
Similar meltwater contributions to glacial sea level changes from Antarctic and northern ice sheets
Abstract The period between 75,000 and 20,000 years ago was characterized by high
variability in climate,,,,,,,,,,, and sea level,. Southern Ocean records of ice-rafted debris …
variability in climate,,,,,,,,,,, and sea level,. Southern Ocean records of ice-rafted debris …
Infinite state model checking by abstract interpretation and program specialisation
We illustrate the use of logic programming techniques for finite model checking of CTL
formulae. We present a technique for infinite state model checking of safety properties based …
formulae. We present a technique for infinite state model checking of safety properties based …