Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase non-termination analysis (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2002 (1) 2008 (1) 2009 (3) 2010 (1) 2011 (2)
Publication types (Num. hits)
article(3) inproceedings(5)
Venues (Conferences, Journals, ...)
ICLP(2) CoRR(1) Electr. Notes Theor. Comput. S...(1) LOPSTR(1) PLDI(1) SAS(1) TPLP(1)
Authors
Dean Voets(5) Danny De Schreye(4) Étienne Payet(2) Fausto Spoto(1) Frédéric Mesnard(1) Ramarathnam Venkatesan(1) Saurabh Srivastava(1) Sumit Gulwani(1) Ulrich Neumerkel(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords
Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
3Dean Voets, Danny De Schreye A New Approach to Non-termination Analysis of Logic Programs. Search on Bibsonomy ICLP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF non-termination analysis, program analysis
1Dean Voets, Danny De Schreye Non-termination Analysis of Logic Programs with Integer arithmetics Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Dean Voets, Danny De Schreye Non-termination analysis of logic programs with integer arithmetics. Search on Bibsonomy TPLP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dean Voets, Danny De Schreye Non-termination Analysis of Logic Programs Using Types. Search on Bibsonomy LOPSTR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Étienne Payet, Fausto Spoto Experiments with Non-Termination Analysis for Java Bytecode. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dean Voets Research Summary: Non-termination Analysis of Logic Programs. Search on Bibsonomy ICLP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sumit Gulwani, Saurabh Srivastava, Ramarathnam Venkatesan Program analysis as constraint solving. Search on Bibsonomy PLDI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF most-general counterexamples, non-termination analysis, strongest postcondition, program verification, constraint solving, weakest precondition, bounds analysis
1Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel Detecting Optimal Termination Conditions of Logic Programs. Search on Bibsonomy SAS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #8 of 8 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.