|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 29 occurrences of 28 keywords
|
|
|
Results
Found 39 publication records. Showing 39 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
121 | Étienne Payet, Frédéric Mesnard |
Nontermination inference of logic programs. |
ACM Trans. Program. Lang. Syst. |
2006 |
DBLP DOI BibTeX RDF |
nontermination analysis, optimal termination condition, Logic programming, static analysis |
88 | Miki Hermann, Igor Prívara |
On Nontermination of Knuth-Bendix Algorithm. |
ICALP |
1986 |
DBLP DOI BibTeX RDF |
|
57 | Dennis M. Volpano, Geoffrey Smith 0001 |
Eliminating Covert Flows with Minimum Typings. |
CSFW |
1997 |
DBLP DOI BibTeX RDF |
|
50 | Geoffrey Smith 0001, Rafael Alpízar |
Fast probabilistic simulation, nontermination, and secure information flow. |
PLAS |
2007 |
DBLP DOI BibTeX RDF |
probabilistic noninterference, type systems |
38 | Guillem Godoy, Eduard Huntingford, Ashish Tiwari 0001 |
Termination of Rewriting with Right-Flat Rules. |
RTA |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Moon-Chuen Lee |
An Augmented Prolog Programming Environment for Tutoring Applications. |
IEA/AIE (Vol. 2) |
1990 |
DBLP DOI BibTeX RDF |
Prolog |
38 | Rodney R. Howell, Louis E. Rosier |
On Questions of Fairness and Temporal Logic for Conflict- Free Petri Nets. |
European Workshop on Applications and Theory of Petri Nets |
1987 |
DBLP DOI BibTeX RDF |
|
33 | Venkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee 0001, John Hatcliff, Matthew B. Dwyer |
A new foundation for control dependence and slicing for modern program structures. |
ACM Trans. Program. Lang. Syst. |
2007 |
DBLP DOI BibTeX RDF |
Indus, Nontermination, order dependence, program slicing, bisimulation, control dependence |
31 | Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Søndergaard, Peter J. Stuckey |
Lightweight Nontermination Inference with CHCs. |
SEFM |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Vladimír Still, Jiri Barnat |
Local Nontermination Detection for Parallel C++ Programs. |
SEFM |
2019 |
DBLP DOI BibTeX RDF |
|
31 | Jan Leike, Matthias Heizmann |
Geometric Nontermination Arguments. |
TACAS (2) |
2018 |
DBLP DOI BibTeX RDF |
|
31 | Jan Leike, Matthias Heizmann |
Geometric Nontermination Arguments. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
31 | Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn |
Embracing Overapproximation for Proving Nontermination. |
Tiny Trans. Comput. Sci. |
2015 |
DBLP BibTeX RDF |
|
31 | Jan Leike, Matthias Heizmann |
Geometric Series as Nontermination Arguments for Linear Lasso Programs. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
31 | Julian Nagele, René Thiemann, Sarah Winkler |
Certification of Nontermination Proofs Using Strategies and Nonlooping Derivations. |
VSTTE |
2014 |
DBLP DOI BibTeX RDF |
|
31 | Hong Yi Chen, Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn |
Proving Nontermination via Safety. |
TACAS |
2014 |
DBLP DOI BibTeX RDF |
|
31 | Christian Sternagel, René Thiemann |
Certification of Nontermination Proofs. |
ITP |
2012 |
DBLP DOI BibTeX RDF |
|
31 | Peter Höfner, Georg Struth |
Algebraic notions of nontermination: Omega and divergence in idempotent semirings. |
J. Log. Algebraic Methods Program. |
2010 |
DBLP DOI BibTeX RDF |
|
31 | Ian J. Hayes, Steve Dunne, Larissa Meinicke |
Unifying Theories of Programming That Distinguish Nontermination and Abort. |
MPC |
2010 |
DBLP DOI BibTeX RDF |
|
31 | María-del-Mar Gallardo, José M. Troya |
Parlog Programs Nontermination Analysis. |
GULP |
1993 |
DBLP BibTeX RDF |
|
31 | Wolfgang Wechler |
A Note on Nondeterminism and Nontermination. |
J. Inf. Process. Cybern. |
1985 |
DBLP BibTeX RDF |
|
19 | Jean-Lou De Carufel, Jules Desharnais |
On the Structure of Demonic Refinement Algebras with Enabledness and Termination. |
RelMiCS |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Janis Voigtländer |
Proving correctness via free theorems: the case of the destroy/build-rule. |
PEPM |
2008 |
DBLP DOI BibTeX RDF |
intermediate data structures, rank-2 types, shortcut deforestation, theorems for free, program transformations, correctness proofs, relational parametricity |
19 | Ashutosh Gupta 0001, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko, Ru-Gang Xu |
Proving non-termination. |
POPL |
2008 |
DBLP DOI BibTeX RDF |
non-termination, recurrent sets, model checking, testing, program verification |
19 | Geoffrey Smith 0001 |
Adversaries and Information Leaks (Tutorial). |
TGC |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Saddek Bensalem, Doron A. Peled, Hongyang Qu 0001, Stavros Tripakis, Lenore D. Zuck |
Test Case Generation for Ultimately Periodic Paths. |
Haifa Verification Conference |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Jan Olaf Blech, Lars Gesellensetter, Sabine Glesner |
Formal Verification of Dead Code Elimination in Isabelle/HOL. |
SEFM |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Yifeng Chen, Jeff W. Sanders |
Logic of global synchrony. |
ACM Trans. Program. Lang. Syst. |
2004 |
DBLP DOI BibTeX RDF |
PRAM, reactive programming, Bulk-Synchronous Parallelism |
19 | Nobuko Yoshida, Kohei Honda 0001, Martin Berger 0001 |
Linearity and Bisimulation. |
FoSSaCS |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Clyde Ruby, Gary T. Leavens |
Safely creating correct subclasses without seeing superclass code. |
OOPSLA |
2000 |
DBLP DOI BibTeX RDF |
downcalls, method refinement, semantic fragile subclassing problem, specification inheritance, subclassing contract, Java, Java language, subclass, JML language |
19 | Michael Leuschel, Bern Martens, Danny De Schreye |
Controlling Generalization amd Polyvariance in Partial Deduction of Normal Logic Programs. |
ACM Trans. Program. Lang. Syst. |
1998 |
DBLP DOI BibTeX RDF |
program transformation, partial evaluation, flow analysis, partial deduction, supercompilation |
19 | Anna Formica, Hans Dietmar Gröger, Michele Missikoff |
An Efficient Method for Checking Object-Oriented Database Schema Correctness. |
ACM Trans. Database Syst. |
1998 |
DBLP DOI BibTeX RDF |
inheritance conflicts, inheritance process, object-oriented database schemas, databases, graph theory, recursive types |
19 | Yasunori Ishihara, Hiroyuki Seki, Minoru Ito |
Type-Consistency Problems for Queries in Object-Oriented Databases. |
ICDT |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Sten Agerholm |
LCF Examples in HOL. |
TPHOLs |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Werner Hans, Rita Loogen, Stephan Winkler |
On the Interaction of Lazy Evaluation and Backtracking. |
PLILP |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Antti Valmari |
Stubborn sets for reduced state space generation. |
Applications and Theory of Petri Nets |
1989 |
DBLP DOI BibTeX RDF |
analysis of behaviour of nets, system verification |
19 | David A. Plaisted |
A Simple Non-Termination Test for the Knuth-Bendix Method. |
CADE |
1986 |
DBLP DOI BibTeX RDF |
|
19 | Michael J. Fischer, Nancy A. Lynch, Mike Paterson |
Impossibility of Distributed Consensus with One Faulty Process |
J. ACM |
1985 |
DBLP DOI BibTeX RDF |
|
19 | Michael J. Fischer, Nancy A. Lynch, Mike Paterson |
Impossibility of Distributed Consensus with One Faulty Process. |
PODS |
1983 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #39 of 39 (100 per page; Change: )
|
|