|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 54 occurrences of 48 keywords
|
|
|
Results
Found 136 publication records. Showing 136 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
87 | Dean Voets, Danny De Schreye |
A New Approach to Non-termination Analysis of Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009. Proceedings, pp. 220-234, 2009, Springer, 978-3-642-02845-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
non-termination analysis, program analysis |
57 | Mengjun Li, Ti Zhou, Zhoujun Li 0001 |
SPVT-II: An Efficient Security Protocol Verifier Based on Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inscrypt ![In: Information Security and Cryptology, 4th International Conference, Inscrypt 2008, Beijing, China, December 14-17, 2008, Revised Selected Papers, pp. 125-140, 2008, Springer, 978-3-642-01439-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
non-termination characterization and prediction, abstract and refinement, security protocol |
50 | Alfons Geser |
Loops of Superexponential Lengths in One-Rule String Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings, pp. 267-280, 2002, Springer, 3-540-43916-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
uniform termination, one-rule, single-rule Submission category: Regular research paper, termination, loop, string rewriting, semi-Thue system |
49 | Étienne Payet, Frédéric Mesnard |
Non-termination Inference for Constraint Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings, pp. 377-392, 2004, Springer, 3-540-22791-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
46 | Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel |
Detecting Optimal Termination Conditions of Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 9th International Symposium, SAS 2002, Madrid, Spain, September 17-20, 2002, Proceedings, pp. 509-526, 2002, Springer, 3-540-44235-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
45 | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp |
Proving and Disproving Termination of Higher-Order Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings, pp. 216-231, 2005, Springer, 3-540-29051-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
42 | Helga Velroyen, Philipp Rümmer |
Non-termination Checking for Imperative Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAP ![In: Tests and Proofs - 2nd International Conference, TAP 2008, Prato, Italy, April 9-11, 2008. Proceedings, pp. 154-170, 2008, Springer, 978-3-540-79123-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Marieke Huisman, Bart Jacobs 0001 |
Java Program Verification via a Hoare Logic with Abrupt Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FASE ![In: Fundamental Approaches to Software Engineering, Third Internationsl Conference, FASE 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings, pp. 284-303, 2000, Springer, 3-540-67261-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
37 | Indrakshi Ray, Indrajit Ray |
Detecting Termination of Active Database Rules Using Symbolic Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADBIS ![In: Advances in Databases and Information Systems, 5th East European Conference, ADBIS 2001, Vilnius, Lithuania, September 25-28, 2001, Proceedings, pp. 266-279, 2001, Springer, 3-540-42555-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Ashutosh Gupta 0001, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko, Ru-Gang Xu |
Proving non-termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008, pp. 147-158, 2008, ACM, 978-1-59593-689-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
non-termination, recurrent sets, model checking, testing, program verification |
32 | Alexander Serebrenik, Danny De Schreye |
Proving Termination with Adornments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic Based Program Synthesis and Transformation, 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers, pp. 108-109, 2003, Springer, 3-540-22174-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Dean Voets |
Termination and Non-Termination in Logic Programming (Terminatie en Non-terminatie van Logische Programmeertalen). (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
30 | Étienne Payet |
Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic-Based Program Synthesis and Transformation, 16th International Symposium, LOPSTR 2006, Venice, Italy, July 12-14, 2006, Revised Selected Papers, pp. 194-209, 2006, Springer, 978-3-540-71409-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Otmane Aït Mohamed, Eduard Cerny, Xiaoyu Song |
MDG-based Verification by Retiming and Combinational Transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Symposium on VLSI ![In: 8th Great Lakes Symposium on VLSI (GLS-VLSI '98), 19-21 February 1998, Lafayette, LA, USA, pp. 356-361, 1998, IEEE Computer Society, 0-8186-8409-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Circuit Transformations, Non-termination, Formal Verification, Retiming, Multiway Decision Graphs |
27 | Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen |
DynamiTe: dynamic termination and non-termination proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 4(OOPSLA), pp. 189:1-189:30, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
27 | Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen |
DynamiTe: Dynamic Termination and Non-termination Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.05747, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
27 | Ton Chanh Le, Quang-Trung Ta, Wei-Ngan Chin |
HipTNT+: A Termination and Non-termination Analyzer by Second-Order Abduction - (Competition Contribution). ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS (2) ![In: Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part II, pp. 370-374, 2017, 978-3-662-54579-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
27 | Cristina David, Daniel Kroening, Matt Lewis |
Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: Programming Languages and Systems - 24th European Symposium on Programming, ESOP 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings, pp. 183-204, 2015, Springer, 978-3-662-46668-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
27 | Ton Chanh Le, Shengchao Qin, Wei-Ngan Chin |
Termination and non-termination specification inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, June 15-17, 2015, pp. 489-498, 2015, ACM, 978-1-4503-3468-6. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
27 | Cristina David, Daniel Kroening, Matt Lewis |
Unrestricted Termination and Non-Termination Arguments for Bit-Vector Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.5089, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
27 | Ton Chanh Le, Cristian Gherghina, Aquinas Hobor, Wei-Ngan Chin |
A Resource-Based Logic for Termination and Non-termination Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings, pp. 267-283, 2014, Springer, 978-3-319-11736-2. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
27 | Ton Chanh Le |
Preliminary Notes on Termination and Non-Termination Reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1309.3128, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
27 | Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel |
Non-Termination Inference for Optimal Termination Conditions of Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JFPLC ![In: Programmation en logique avec contraintes, JFPLC 2002, 27-30 Mai 2002, Université de Nice Sophia-Antipolis, France, pp. 87-, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
26 | Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp |
Tyrolean Termination Tool 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, Proceedings, pp. 295-304, 2009, Springer, 978-3-642-02347-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
automation, termination, term rewriting |
23 | Peter Höfner, Georg Struth |
Non-termination in Idempotent Semirings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RelMiCS ![In: Relations and Kleene Algebra in Computer Science, 10th International Conference on Relational Methods in Computer Science, and 5th International Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008, Frauenwörth, Germany, April 7-11, 2008. Proceedings, pp. 206-220, 2008, Springer, 978-3-540-78912-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Johannes Waldmann |
Matchbox: A Tool for Match-Bounded String Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings, pp. 85-94, 2004, Springer, 3-540-22153-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Sumit Gulwani, Saurabh Srivastava 0001, Ramarathnam Venkatesan |
Program analysis as constraint solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, Tucson, AZ, USA, June 7-13, 2008, pp. 281-292, 2008, ACM, 978-1-59593-860-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
most-general counterexamples, non-termination analysis, strongest postcondition, program verification, constraint solving, weakest precondition, bounds analysis |
20 | René Thiemann, Christian Sternagel |
Loops under Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, Proceedings, pp. 17-31, 2009, Springer, 978-3-642-02347-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik |
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Program Development in Computational Logic ![In: Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, pp. 453-498, 2004, Springer, 3-540-22152-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Jörg Endrullis, Hans Zantema |
Proving Looping and Non-Looping Non-Termination by Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.00478, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
19 | Federico Aschieri, Margherita Zorzi |
Non-determinism, Non-termination and the Strong Normalization of System T. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 11th International Conference, TLCA 2013, Eindhoven, The Netherlands, June 26-28, 2013. Proceedings, pp. 31-47, 2013, Springer, 978-3-642-38945-0. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Fabian Emmes, Tim Enger, Jürgen Giesl |
Proving Non-looping Non-termination Automatically. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings, pp. 225-240, 2012, Springer, 978-3-642-31364-6. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Arie Gurfinkel, Ou Wei, Marsha Chechik |
Model Checking Recursive Programs with Exact Predicate Abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 6th International Symposium, ATVA 2008, Seoul, Korea, October 20-23, 2008. Proceedings, pp. 95-110, 2008, Springer, 978-3-540-88386-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Patrick Cousot, Radhia Cousot |
Galois Connection Based Abstract Interpretations for Strictness Analysis (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods in Programming and Their Applications ![In: Formal Methods in Programming and Their Applications, International Conference, Akademgorodok, Novosibirsk, Russia, June 28 - July 2, 1993, Proceedings, pp. 98-127, 1993, Springer, 3-540-57316-X. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Relational semantics, Dependence-free and dependence-sensitive analysis, Widening, Abstract interpretation, Galois connection, Strictness analysis |
16 | Reinhold Heckmann |
Power Domains Supporting Recursion and Failure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '92, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, Proceedings, pp. 165-181, 1992, Springer, 3-540-55251-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Étienne Payet |
Non-termination in Term Rewriting and Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 68(1), pp. 4, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Étienne Payet |
Binary Non-Termination in Term Rewriting and Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.11549, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Étienne Payet |
Non-Termination in Term Rewriting and Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.13949, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Lukas Gerlach 0002, David Carral |
Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.12710, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Yao Zhang, Xiaofei Xie, Yi Li 0008, Sen Chen 0001, Cen Zhang, Xiaohong Li 0001 |
EndWatch: A Practical Method for Detecting Non-Termination in Real-World Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.03335, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Florian Frohn, Jürgen Giesl |
Proving Non-Termination by Acceleration Driven Clause Learning with LoAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.10166, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Florian Frohn, Jürgen Giesl |
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.09839, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Ievgen Ivanov |
On Newman's Lemma and Non-termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IT&I ![In: Selected Papers of the X International Scientific Conference `Information Technology and Implementation` (IT&I-2023). Conference Proceedings, Kyiv, Ukraine, November 20 - 21, 2023., pp. 14-24, 2023, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
15 | Florian Frohn, Jürgen Giesl |
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE 29 - 29th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023, Proceedings, pp. 220-233, 2023, Springer, 978-3-031-38498-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Ravindra Metta, Prasanth Yeduru, Hrishikesh Karmarkar, Raveendra Kumar Medicherla |
VeriFuzz 1.4: Checking for (Non-)termination (Competition Contribution). ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS (2) ![In: Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part II, pp. 594-599, 2023, Springer, 978-3-031-30819-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Yao Zhang, Xiaofei Xie, Yi Li 0008, Sen Chen 0001, Cen Zhang, Xiaohong Li 0001 |
EndWatch: A Practical Method for Detecting Non-Termination in Real-World Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: 38th IEEE/ACM International Conference on Automated Software Engineering, ASE 2023, Luxembourg, September 11-15, 2023, pp. 686-697, 2023, IEEE, 979-8-3503-2996-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Lukas Gerlach 0002, David Carral |
Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023, Rhodes, Greece, September 2-8, 2023., pp. 301-310, 2023, 978-1-956792-02-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Zhilei Han, Fei He 0001 |
Data-driven Recurrent Set Learning For Non-termination Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE ![In: 45th IEEE/ACM International Conference on Software Engineering, ICSE 2023, Melbourne, Australia, May 14-20, 2023, pp. 1303-1315, 2023, IEEE, 978-1-6654-5701-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Florian Frohn, Carsten Fuhs |
A calculus for modular loop acceleration and non-termination proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 24(5), pp. 691-715, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Florian Frohn, Jürgen Giesl |
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.04546, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Jaymon Furniss |
Proving False in Object-Oriented Verification Programs by Exploiting Non-Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.02605, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Xiuhan Shi, Xiaofei Xie, Yi Li 0008, Yao Zhang, Sen Chen 0001, Xiaohong Li 0001 |
Large-scale analysis of non-termination bugs in real-world OSS projects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESEC/SIGSOFT FSE ![In: Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC/FSE 2022, Singapore, Singapore, November 14-18, 2022, pp. 256-268, 2022, ACM, 978-1-4503-9413-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Florian Frohn, Jürgen Giesl |
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning - 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8-10, 2022, Proceedings, pp. 712-722, 2022, Springer, 978-3-031-10768-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Jera Hensel, Constantin Mensendiek, Jürgen Giesl |
AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution). ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS (2) ![In: Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part II, pp. 403-407, 2022, Springer, 978-3-030-99526-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Hrishikesh Karmarkar, Raveendra Kumar Medicherla, Ravindra Metta, Prasanth Yeduru |
FuzzNT : Checking for Program Non-termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSME ![In: IEEE International Conference on Software Maintenance and Evolution, ICSME 2022, Limassol, Cyprus, October 3-7, 2022, pp. 409-413, 2022, IEEE, 978-1-6654-7956-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Florian Frohn, Carsten Fuhs |
A Calculus for Modular Loop Acceleration and Non-Termination Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.13952, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný 0001, Dorde Zikelic |
Proving Non-termination by Program Reversal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.01189, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný 0001, Dorde Zikelic |
Proving non-termination by program reversal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Virtual Event, Canada, June 20-25, 2021., pp. 1033-1048, 2021, ACM, 978-1-4503-8391-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Florian Frohn, Jürgen Giesl |
Proving Non-Termination via Loop Acceleration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.11187, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Florian Frohn, Jürgen Giesl |
Proving Non-Termination via Loop Acceleration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: 2019 Formal Methods in Computer Aided Design, FMCAD 2019, San Jose, CA, USA, October 22-25, 2019, pp. 221-230, 2019, IEEE, 978-0-9835678-9-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Viktor Malík, Stefan Marticek, Peter Schrammel, Mandayam K. Srivas, Tomás Vojnar, Johanan Wahlang |
2LS: Memory Safety and Non-termination - (Competition Contribution). ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS (2) ![In: Tools and Algorithms for the Construction and Analysis of Systems - 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part II, pp. 417-421, 2018, Springer, 978-3-319-89962-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Bai Xue 0001, Naijun Zhan, Yangjia Li, Qiuye Wang |
Robust Non-termination Analysis of Numerical Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETTA ![In: Dependable Software Engineering. Theories, Tools, and Applications - 4th International Symposium, SETTA 2018, Beijing, China, September 4-6, 2018, Proceedings, pp. 69-88, 2018, Springer, 978-3-319-99932-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Yi Li |
Witness to non-termination of linear programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 681, pp. 75-100, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Thom W. Frühwirth |
Why Can't You Behave? Non-termination Analysis of Direct Recursive Rules with Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1701.02648, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | David Carral, Irina Dragoste, Markus Krötzsch |
Restricted Chase (Non)Termination for Existential Rules with Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pp. 922-928, 2017, ijcai.org, 978-0-9992411-0-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Thom W. Frühwirth |
Why Can't You Behave? Non-termination Analysis of Direct Recursive Rules with Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RuleML ![In: Rule Technologies. Research, Tools, and Applications - 10th International Symposium, RuleML 2016, Stony Brook, NY, USA, July 6-9, 2016. Proceedings, pp. 208-222, 2016, Springer, 978-3-319-42018-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Alexey Bakhirkin |
Recurrent sets for non-termination and safety of programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2016 |
RDF |
|
15 | Fred Mesnard, Étienne Payet |
A second-order formulation of non-termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 115(11), pp. 882-885, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Jörg Endrullis, Hans Zantema |
Proving non-termination by finite automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: 26th International Conference on Rewriting Techniques and Applications, RTA 2015, June 29 to July 1, 2015, Warsaw, Poland, pp. 160-176, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-85-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | K. N. Nimkar |
Methods for proving non-termination of programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2015 |
RDF |
|
15 | Jörg Endrullis, Hans Zantema |
Non-termination using Regular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1405.5662, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Étienne Payet, Fred Mesnard, Fausto Spoto |
Non-Termination Analysis of Java Bytecode. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1401.5292, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Fred Mesnard, Étienne Payet |
A Second-Order Formulation of Non-Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.3271, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Étienne Payet, Frédéric Mesnard |
Non-termination of Dalvik bytecode via compilation to CLP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.3729, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Daniel Larraz, Kaustubh Nimkar, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio |
Proving Non-termination Using Max-SMT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Proceedings, pp. 779-796, 2014, Springer, 978-3-319-08866-2. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Senlin Liang, Michael Kifer |
A practical analysis of non-termination in large logic programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Pract. Log. Program. ![In: Theory Pract. Log. Program. 13(4-5), pp. 705-719, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Senlin Liang, Michael Kifer |
Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages - 15th International Symposium, PADL 2013, Rome, Italy, January 21-22, 2013. Proceedings, pp. 173-189, 2013, Springer, 978-3-642-45283-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Liyun Dai, Bican Xia |
Non-Termination Sets of Simple Linear Loops ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1206.0232, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
15 | Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi, Akash Lal |
Detecting Fair Non-termination in Multithreaded Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification - 24th International Conference, CAV 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, pp. 210-226, 2012, Springer, 978-3-642-31423-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Liyun Dai, Bican Xia |
Non-termination Sets of Simple Linear Loops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2012 - 9th International Colloquium, Bangalore, India, September 24-27, 2012. Proceedings, pp. 61-73, 2012, Springer, 978-3-642-32942-5. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Senlin Liang |
Non-termination Analysis and Cost-Based Query Optimization of Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RR ![In: Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceedings, pp. 284-290, 2012, Springer, 978-3-642-33202-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Geoffrey Smith 0001, Rafael Alpízar |
Non-termination and secure information flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 21(6), pp. 1183-1205, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Antonio Bucciarelli |
Extensional Collapse Situations I: non-termination and unrecoverable errors ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1101.4465, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Dean Voets, Danny De Schreye |
Non-termination Analysis of Logic Programs with Integer arithmetics ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1109.3256, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Alexander Rand |
Improved Examples of Non-Termination for Ruppert's Algorithm ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1103.3903, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Alexander Rand |
On the Non-Termination of Ruppert's Algorithm ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1101.1071, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Dean Voets, Danny De Schreye |
Non-termination analysis of logic programs with integer arithmetics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Pract. Log. Program. ![In: Theory Pract. Log. Program. 11(4-5), pp. 521-536, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Marc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl |
Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoVeOOS ![In: Formal Verification of Object-Oriented Software - International Conference, FoVeOOS 2011, Turin, Italy, October 5-7, 2011, Revised Selected Papers, pp. 123-141, 2011, Springer, 978-3-642-31761-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Matthias Kuntz, Stefan Leue, Christoph Scheben |
Extending Non-Termination Proof Techniques to Asynchronously Communicating Concurrent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WING@ETAPS/IJCAR ![In: Second International Workshop on Invariant Generation, WING 2009, York, UK, March 29, 2009 and Third International Workshop on Invariant Generation, WING 2010, Edinburgh, UK, July 21, 2010, pp. 132-147, 2010, EasyChair. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Dean Voets, Danny De Schreye |
Non-termination Analysis of Logic Programs Using Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic-Based Program Synthesis and Transformation - 20th International Symposium, LOPSTR 2010, Hagenberg, Austria, July 23-25, 2010, Revised Selected Papers, pp. 133-148, 2010, Springer, 978-3-642-20550-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Étienne Payet, Fausto Spoto |
Experiments with Non-Termination Analysis for Java Bytecode. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BYTECODE@ETAPS ![In: Proceedings of the Fourth Workshop on Bytecode Semantics, Verification, Analysis and Transformation, BYTECODE@ETAPS 2009, York, UK, March 29, 2009, pp. 83-96, 2009, Elsevier. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Étienne Payet, Frédéric Mesnard |
A non-termination criterion for binary constraint logic programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Pract. Log. Program. ![In: Theory Pract. Log. Program. 9(2), pp. 145-164, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Dean Voets |
Research Summary: Non-termination Analysis of Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009. Proceedings, pp. 553-554, 2009, Springer, 978-3-642-02845-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Étienne Payet, Frédéric Mesnard |
A Non-Termination Criterion for Binary Constraint Logic Programs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0807.3451, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
15 | Étienne Payet, Frédéric Mesnard |
An Improved Non-Termination Criterion for Binary Constraint Logic Programs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0508106, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
15 | Walter Guttmann |
Non-termination in Unifying Theories of Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RelMiCS ![In: Relational Methods in Computer Science, 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, and Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22-26, 2005, Selected Revised Papers, pp. 108-120, 2005, Springer, 3-540-33339-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Étienne Payet, Frédéric Mesnard |
An Improved Non-Termination Criterion for Binary Constraint Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WLPE ![In: Proceedings of the 15th International Workshop on Logic Programming Environments, Sitges (Barcelona), Spain, October 5, 2005, pp. 46-60, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
15 | Étienne Payet, Frédéric Mesnard |
Non-Termination Inference of Logic Programs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.PL/0406041, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
15 | Otmane Aït Mohamed, Xiaoyu Song, Eduard Cerny |
On the non-termination of M-based abstract state enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 300(1-3), pp. 161-179, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Reinhard Kahle, Thomas Studer |
Formalizing non-termination of recursive programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Algebraic Methods Program. ![In: J. Log. Algebraic Methods Program. 49(1-2), pp. 1-14, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 136 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|