Search results for "Non-termination"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
87	Dean Voets, Danny De Schreye	A New Approach to Non-termination Analysis of Logic Programs.	ICLP	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.	Inscrypt	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.	RTA	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.	SAS	2004	DBLP DOI BibTeX RDF
46	Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel	Detecting Optimal Termination Conditions of Logic Programs.	SAS	2002	DBLP DOI BibTeX RDF
45	Jürgen Giesl, René Thiemann, Peter Schneider-Kamp	Proving and Disproving Termination of Higher-Order Functions.	FroCoS	2005	DBLP DOI BibTeX RDF
42	Helga Velroyen, Philipp Rümmer	Non-termination Checking for Imperative Programs.	TAP	2008	DBLP DOI BibTeX RDF
39	Marieke Huisman, Bart Jacobs 0001	Java Program Verification via a Hoare Logic with Abrupt Termination.	FASE	2000	DBLP DOI BibTeX RDF
37	Indrakshi Ray, Indrajit Ray	Detecting Termination of Active Database Rules Using Symbolic Model Checking.	ADBIS	2001	DBLP DOI BibTeX RDF
36	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
32	Alexander Serebrenik, Danny De Schreye	Proving Termination with Adornments.	LOPSTR	2003	DBLP DOI BibTeX RDF
30	Dean Voets	Termination and Non-Termination in Logic Programming (Terminatie en Non-terminatie van Logische Programmeertalen). (PDF / PS)		2013	RDF
30	Étienne Payet	Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator.	LOPSTR	2006	DBLP DOI BibTeX RDF
28	Otmane Aït Mohamed, Eduard Cerny, Xiaoyu Song	MDG-based Verification by Retiming and Combinational Transformations.	Great Lakes Symposium on VLSI	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.	Proc. ACM Program. Lang.	2020	DBLP DOI BibTeX RDF
27	Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen	DynamiTe: Dynamic Termination and Non-termination Proofs.	CoRR	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).	TACAS (2)	2017	DBLP DOI BibTeX RDF
27	Cristina David, Daniel Kroening, Matt Lewis	Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs.	ESOP	2015	DBLP DOI BibTeX RDF
27	Ton Chanh Le, Shengchao Qin, Wei-Ngan Chin	Termination and non-termination specification inference.	PLDI	2015	DBLP DOI BibTeX RDF
27	Cristina David, Daniel Kroening, Matt Lewis	Unrestricted Termination and Non-Termination Arguments for Bit-Vector Programs.	CoRR	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.	ICFEM	2014	DBLP DOI BibTeX RDF
27	Ton Chanh Le	Preliminary Notes on Termination and Non-Termination Reasoning.	CoRR	2013	DBLP BibTeX RDF
27	Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel	Non-Termination Inference for Optimal Termination Conditions of Logic Programs.	JFPLC	2002	DBLP BibTeX RDF
26	Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp	Tyrolean Termination Tool 2.	RTA	2009	DBLP DOI BibTeX RDF	automation, termination, term rewriting
23	Peter Höfner, Georg Struth	Non-termination in Idempotent Semirings.	RelMiCS	2008	DBLP DOI BibTeX RDF
21	Johannes Waldmann	Matchbox: A Tool for Match-Bounded String Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
20	Sumit Gulwani, Saurabh Srivastava 0001, Ramarathnam Venkatesan	Program analysis as constraint solving.	PLDI	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.	RTA	2009	DBLP DOI BibTeX RDF
20	Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik	Proving Termination for Logic Programs by the Query-Mapping Pairs Approach.	Program Development in Computational Logic	2004	DBLP DOI BibTeX RDF
19	Jörg Endrullis, Hans Zantema	Proving Looping and Non-Looping Non-Termination by Finite Automata.	CoRR	2015	DBLP BibTeX RDF
19	Federico Aschieri, Margherita Zorzi	Non-determinism, Non-termination and the Strong Normalization of System T.	TLCA	2013	DBLP DOI BibTeX RDF
19	Fabian Emmes, Tim Enger, Jürgen Giesl	Proving Non-looping Non-termination Automatically.	IJCAR	2012	DBLP DOI BibTeX RDF
16	Arie Gurfinkel, Ou Wei, Marsha Chechik	Model Checking Recursive Programs with Exact Predicate Abstraction.	ATVA	2008	DBLP DOI BibTeX RDF
16	Patrick Cousot, Radhia Cousot	Galois Connection Based Abstract Interpretations for Strictness Analysis (Invited Paper).	Formal Methods in Programming and Their Applications	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.	CAAP	1992	DBLP DOI BibTeX RDF
15	Étienne Payet	Non-termination in Term Rewriting and Logic Programming.	J. Autom. Reason.	2024	DBLP DOI BibTeX RDF
15	Étienne Payet	Binary Non-Termination in Term Rewriting and Logic Programming.	CoRR	2023	DBLP DOI BibTeX RDF
15	Étienne Payet	Non-Termination in Term Rewriting and Logic Programming.	CoRR	2023	DBLP DOI BibTeX RDF
15	Lukas Gerlach 0002, David Carral	Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination.	CoRR	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.	CoRR	2023	DBLP DOI BibTeX RDF
15	Florian Frohn, Jürgen Giesl	Proving Non-Termination by Acceleration Driven Clause Learning with LoAT.	CoRR	2023	DBLP DOI BibTeX RDF
15	Florian Frohn, Jürgen Giesl	Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version).	CoRR	2023	DBLP DOI BibTeX RDF
15	Ievgen Ivanov	On Newman's Lemma and Non-termination.	IT&I	2023	DBLP BibTeX RDF
15	Florian Frohn, Jürgen Giesl	Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper).	CADE	2023	DBLP DOI BibTeX RDF
15	Ravindra Metta, Prasanth Yeduru, Hrishikesh Karmarkar, Raveendra Kumar Medicherla	VeriFuzz 1.4: Checking for (Non-)termination (Competition Contribution).	TACAS (2)	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.	ASE	2023	DBLP DOI BibTeX RDF
15	Lukas Gerlach 0002, David Carral	Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination.	KR	2023	DBLP DOI BibTeX RDF
15	Zhilei Han, Fei He 0001	Data-driven Recurrent Set Learning For Non-termination Analysis.	ICSE	2023	DBLP DOI BibTeX RDF
15	Florian Frohn, Carsten Fuhs	A calculus for modular loop acceleration and non-termination proofs.	Int. J. Softw. Tools Technol. Transf.	2022	DBLP DOI BibTeX RDF
15	Florian Frohn, Jürgen Giesl	Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description).	CoRR	2022	DBLP BibTeX RDF
15	Jaymon Furniss	Proving False in Object-Oriented Verification Programs by Exploiting Non-Termination.	CoRR	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.	ESEC/SIGSOFT FSE	2022	DBLP DOI BibTeX RDF
15	Florian Frohn, Jürgen Giesl	Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description).	IJCAR	2022	DBLP DOI BibTeX RDF
15	Jera Hensel, Constantin Mensendiek, Jürgen Giesl	AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution).	TACAS (2)	2022	DBLP DOI BibTeX RDF
15	Hrishikesh Karmarkar, Raveendra Kumar Medicherla, Ravindra Metta, Prasanth Yeduru	FuzzNT : Checking for Program Non-termination.	ICSME	2022	DBLP DOI BibTeX RDF
15	Florian Frohn, Carsten Fuhs	A Calculus for Modular Loop Acceleration and Non-Termination Proofs.	CoRR	2021	DBLP BibTeX RDF
15	Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný 0001, Dorde Zikelic	Proving Non-termination by Program Reversal.	CoRR	2021	DBLP BibTeX RDF
15	Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný 0001, Dorde Zikelic	Proving non-termination by program reversal.	PLDI	2021	DBLP DOI BibTeX RDF
15	Florian Frohn, Jürgen Giesl	Proving Non-Termination via Loop Acceleration.	CoRR	2019	DBLP BibTeX RDF
15	Florian Frohn, Jürgen Giesl	Proving Non-Termination via Loop Acceleration.	FMCAD	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).	TACAS (2)	2018	DBLP DOI BibTeX RDF
15	Bai Xue 0001, Naijun Zhan, Yangjia Li, Qiuye Wang	Robust Non-termination Analysis of Numerical Software.	SETTA	2018	DBLP DOI BibTeX RDF
15	Yi Li	Witness to non-termination of linear programs.	Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
15	Thom W. Frühwirth	Why Can't You Behave? Non-termination Analysis of Direct Recursive Rules with Constraints.	CoRR	2017	DBLP BibTeX RDF
15	David Carral, Irina Dragoste, Markus Krötzsch	Restricted Chase (Non)Termination for Existential Rules with Disjunctions.	IJCAI	2017	DBLP DOI BibTeX RDF
15	Thom W. Frühwirth	Why Can't You Behave? Non-termination Analysis of Direct Recursive Rules with Constraints.	RuleML	2016	DBLP DOI BibTeX RDF
15	Alexey Bakhirkin	Recurrent sets for non-termination and safety of programs.		2016	RDF
15	Fred Mesnard, Étienne Payet	A second-order formulation of non-termination.	Inf. Process. Lett.	2015	DBLP DOI BibTeX RDF
15	Jörg Endrullis, Hans Zantema	Proving non-termination by finite automata.	RTA	2015	DBLP DOI BibTeX RDF
15	K. N. Nimkar	Methods for proving non-termination of programs.		2015	RDF
15	Jörg Endrullis, Hans Zantema	Non-termination using Regular Languages.	CoRR	2014	DBLP BibTeX RDF
15	Étienne Payet, Fred Mesnard, Fausto Spoto	Non-Termination Analysis of Java Bytecode.	CoRR	2014	DBLP BibTeX RDF
15	Fred Mesnard, Étienne Payet	A Second-Order Formulation of Non-Termination.	CoRR	2014	DBLP BibTeX RDF
15	Étienne Payet, Frédéric Mesnard	Non-termination of Dalvik bytecode via compilation to CLP.	CoRR	2014	DBLP BibTeX RDF
15	Daniel Larraz, Kaustubh Nimkar, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio	Proving Non-termination Using Max-SMT.	CAV	2014	DBLP DOI BibTeX RDF
15	Senlin Liang, Michael Kifer	A practical analysis of non-termination in large logic programs.	Theory Pract. Log. Program.	2013	DBLP DOI BibTeX RDF
15	Senlin Liang, Michael Kifer	Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs.	PADL	2013	DBLP DOI BibTeX RDF
15	Liyun Dai, Bican Xia	Non-Termination Sets of Simple Linear Loops	CoRR	2012	DBLP BibTeX RDF
15	Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi, Akash Lal	Detecting Fair Non-termination in Multithreaded Programs.	CAV	2012	DBLP DOI BibTeX RDF
15	Liyun Dai, Bican Xia	Non-termination Sets of Simple Linear Loops.	ICTAC	2012	DBLP DOI BibTeX RDF
15	Senlin Liang	Non-termination Analysis and Cost-Based Query Optimization of Logic Programs.	RR	2012	DBLP DOI BibTeX RDF
15	Geoffrey Smith 0001, Rafael Alpízar	Non-termination and secure information flow.	Math. Struct. Comput. Sci.	2011	DBLP DOI BibTeX RDF
15	Antonio Bucciarelli	Extensional Collapse Situations I: non-termination and unrecoverable errors	CoRR	2011	DBLP BibTeX RDF
15	Dean Voets, Danny De Schreye	Non-termination Analysis of Logic Programs with Integer arithmetics	CoRR	2011	DBLP BibTeX RDF
15	Alexander Rand	Improved Examples of Non-Termination for Ruppert's Algorithm	CoRR	2011	DBLP BibTeX RDF
15	Alexander Rand	On the Non-Termination of Ruppert's Algorithm	CoRR	2011	DBLP BibTeX RDF
15	Dean Voets, Danny De Schreye	Non-termination analysis of logic programs with integer arithmetics.	Theory Pract. Log. Program.	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.	FoVeOOS	2011	DBLP DOI BibTeX RDF
15	Matthias Kuntz, Stefan Leue, Christoph Scheben	Extending Non-Termination Proof Techniques to Asynchronously Communicating Concurrent Programs.	WING@ETAPS/IJCAR	2010	DBLP DOI BibTeX RDF
15	Dean Voets, Danny De Schreye	Non-termination Analysis of Logic Programs Using Types.	LOPSTR	2010	DBLP DOI BibTeX RDF
15	Étienne Payet, Fausto Spoto	Experiments with Non-Termination Analysis for Java Bytecode.	BYTECODE@ETAPS	2009	DBLP DOI BibTeX RDF
15	Étienne Payet, Frédéric Mesnard	A non-termination criterion for binary constraint logic programs.	Theory Pract. Log. Program.	2009	DBLP DOI BibTeX RDF
15	Dean Voets	Research Summary: Non-termination Analysis of Logic Programs.	ICLP	2009	DBLP DOI BibTeX RDF
15	Étienne Payet, Frédéric Mesnard	A Non-Termination Criterion for Binary Constraint Logic Programs	CoRR	2008	DBLP BibTeX RDF
15	Étienne Payet, Frédéric Mesnard	An Improved Non-Termination Criterion for Binary Constraint Logic Programs	CoRR	2005	DBLP BibTeX RDF
15	Walter Guttmann	Non-termination in Unifying Theories of Programming.	RelMiCS	2005	DBLP DOI BibTeX RDF
15	Étienne Payet, Frédéric Mesnard	An Improved Non-Termination Criterion for Binary Constraint Logic Programs.	WLPE	2005	DBLP BibTeX RDF
15	Étienne Payet, Frédéric Mesnard	Non-Termination Inference of Logic Programs	CoRR	2004	DBLP BibTeX RDF
15	Otmane Aït Mohamed, Xiaoyu Song, Eduard Cerny	On the non-termination of M-based abstract state enumeration.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
15	Reinhard Kahle, Thomas Studer	Formalizing non-termination of recursive programs.	J. Log. Algebraic Methods Program.	2001	DBLP DOI BibTeX RDF