termination - researchr tag

researchr

You are not signed in
Sign in
Sign up

2011

Ambiguity Detection for Programming Language GrammarsBas Basten. PhD thesis, Universiteit van Amsterdam, December 2011.

CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificatesFrédéric Blanqui, Adam Koprowski. mscs, 21(4):827-859, 2011. [doi]

Modular Termination Proofs of Recursive Java Bytecode Programs by Term RewritingMarc Brockschmidt, Carsten Otto, Jürgen Giesl. RTA 2011: 155-170 [doi]

Approximating the Termination Value of One-Counter MDPs and Stochastic GamesTomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera. icalp 2011: 332-343 [doi]

SAT-based termination analysis using monotonicity constraints over the integersMichael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl. tplp, 11(4-5):503-520, 2011. [doi]

Proving program terminationByron Cook, Andreas Podelski, Andrey Rybalchenko. CACM, 54(5):88-98, 2011. [doi]

Advances in Proving Program Termination and LivenessByron Cook. cade 2011: 4 [doi]

Termination without /checkmark/checkmark in CSPSteve Dunne. fm 2011: 278-292 [doi]

Lazy productivity via terminationJörg Endrullis, Dimitri Hendriks. TCS, 412(28):3203-3225, 2011. [doi]

Termination Analysis of C Programs Using Compiler Intermediate LanguagesStephan Falke, Deepak Kapur, Carsten Sinz. RTA 2011: 41-50 [doi]

Proving Termination by Dependency Pairs and Inductive Theorem ProvingCarsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski. JAR, 47(2):133-160, 2011. [doi]

Automated termination proofs for haskell by term rewritingJürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann. TOPLAS, 33(2):7, 2011. [doi]

On Conditional Chase TerminationGösta Grahne, Adrian Onet. amw 2011: [doi]

A Fast H.264 Intra Frame Encoder with Serialized Execution of 4 × 4 and 16 × 16 Predictions and Early TerminationJin-Su Jung, Young-Joon Jo, Hyuk-Jae Lee. vlsisp, 64(1):161-175, 2011. [doi]

Termination of Isabelle Functions via Termination of RewritingAlexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl. itp 2011: 152-167 [doi]

Memory efficient layered decoder design with early termination for LDPC codesJiangpeng Li, Guanghui He, Hexi Hou, Zhejun Zhang, Jun Ma. iscas 2011: 2697-2700 [doi]

Termination of Grounding Is Not Preserved by Strongly Equivalent TransformationsYuliya Lierler, Vladimir Lifschitz. lpnmr 2011: 205-210 [doi]

Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational ComplexityGeorg Moser, Andreas Schnabl. RTA 2011: 235-250 [doi]

Revisiting Matrix Interpretations for Proving Termination of Term RewritingFriedrich Neurauter, Aart Middeldorp. RTA 2011: 251-266 [doi]

Polytool: Polynomial interpretations as a basis for termination analysis of logic programsManh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp. tplp, 11(1):33-63, 2011. [doi]

Genetic algorithm with automatic termination and search space rotationBun Theang Ong, Masao Fukushima. memetic, 3(2):111-127, 2011. [doi]

Decision Procedures for Automating Termination ProofsRuzica Piskac, Thomas Wies. vmcai 2011: 371-386 [doi]

Transition Invariants and Transition Predicate Abstraction for Program TerminationAndreas Podelski, Andrey Rybalchenko. TACAS 2011: 3-10 [doi]

On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency GraphsTsubasa Sakata, Naoki Nishida, Toshiki Sakabe. wflp 2011: 138-155 [doi]

Hybrid partial evaluationShali, Amin, Cook, William R.. In Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications. 2011: 375-390 [doi]

Analysis of TSV-to-TSV coupling with high-impedance termination in 3D ICsTaigon Song, Chang Liu, Dae-Hyun Kim, Sung Kyu Lim, Jonghyun Cho, Joohee Kim, Junso Pak, Seungyoung Ahn, Joungho Kim, Kihyun Yoon. isqed 2011: 122-128 [doi]

Termination and Correctness Analysis of Cyclic ControlSiddharth Srivastava, Neil Immerman, Shlomo Zilberstein. AAAI 2011: [doi]

Loop Summarization and Termination AnalysisAliaksei Tsitovich, Natasha Sharygina, Christoph M. Wintersteiger, Daniel Kroening. TACAS 2011: 81-95 [doi]

Termination-Insensitive Computational Indistinguishability (and Applications to Computational Soundness)Dominique Unruh. csfw 2011: 251-265 [doi]

Refinement of Synchronizable Places with Multi-workflow Nets - Weak Termination Preserved!Kees M. van Hee, Natalia Sidorova, Jan Martijn E. M. van der Werf. apn 2011: 149-168 [doi]

Non-termination analysis of logic programs with integer arithmeticsDean Voets, Danny De Schreye. tplp, 11(4-5):521-536, 2011. [doi]

AC Completion with Termination ToolsSarah Winkler, Aart Middeldorp. cade 2011: 492-498 [doi]

Symbolic decision procedure for termination of linear programsBican Xia, Lu Yang, Naijun Zhan, Zhihai Zhang. fac, 23(2):171-190, 2011. [doi]

A Millimeter-Wave Resistance Error Tolerant Termination in Multi-Layered LTCC SubstrateTakeshi Yuasa, Yukihiro Tahara, Naofumi Yoneda, Hideyuki Oh-Hashi. ieicet, 94-C(3):321-326, 2011. [doi]

2010

Automated Termination Analysis for Programs with Second-Order RecursionMarkus Aderhold. TACAS 2010: 221-235 [doi]

Proving Termination Properties with mu-termBeatriz Alarcón, Raúl Gutiérrez, Salvador Lucas, Rafael Navarro-Marset. amast 2011: 201-208 [doi]

Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart ProgramsChristophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord. SAS 2010: 117-133 [doi]

Regular approximation and bounded domains for size-change terminationHugh Anderson, Siau-Cheng Khoo. PEPM 2010: 53-62 [doi]

Confluence and termination of fuzzy relationsRadim Belohlávek, Tomas Kuhr, Vilém Vychodil. isci, 180(17):3288-3303, 2010. [doi]

Combining Termination Criteria by Isolating DeletionDénes Bisztray, Reiko Heckel. gg 2010: 203-217 [doi]

A Termination Criterion for Graph Transformations with Negative Application ConditionsPaolo Bottoni, Francesco Parisi-Presicce. eceasst, 30, 2010. [doi]

Typing termination in a higher-order concurrent imperative languageGérard Boudol. iandc, 208(6):716-736, 2010. [doi]

Termination Graphs for Java BytecodeMarc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl. BIRTHDAY 2010: 17-37 [doi]

Metric Spaces and Termination AnalysesAziem Chawdhary, Hongseok Yang. aplas 2010: 156-171 [doi]

Functions as Processes: Termination and the lm[(m)/tilde]/lambda/mu/widetilde{/mu}-CalculusMatteo Cimini, Claudio Sacerdoti Coen, Davide Sangiorgi. tgc 2010: 73-86 [doi]

Lazy Abstraction for Size-Change TerminationMichael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp. lpar 2010: 217-232 [doi]

A3PAT, an approach for certified automated termination proofsEvelyne Contejean, Andrey Paskevich, Xavier Urbain, Pierre Courtieu, Olivier Pons, Julien Forest. PEPM 2010: 63-72 [doi]

Termination in higher-order concurrent calculiRomain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. jlp, 79(7):550-577, 2010. [doi]

Termination in Impure Concurrent LanguagesRomain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. concur 2010: 328-342 [doi]

A Compositional Method for Deciding Equivalence and Termination of Nondeterministic ProgramsAleksandar Dimovski. IFM 2010: 121-135 [doi]

Termination of linear bounded term rewriting systemsIrène Durand, Géraud Sénizergues, Marc Sylvestre. RTA 2010: 341-356 [doi]

A Demand Prediction Model for Replacement Parts Using a Markov renewal Process with TerminationYasushi Endow, Shin Tanimoto. cas, 41(4):287-306, 2010. [doi]

A Purely Logical Approach to the Termination of Imperative LoopsMadalina Erascu, Tudor Jebelean. synasc 2010: 142-149 [doi]

Folding Variant Narrowing and Optimal Variant TerminationSantiago Escobar, Ralf Sasse, José Meseguer. wrla 2010: 52-68 [doi]

On Strong Normalization of the Calculus of Constructions with Type-Based TerminationBenjamin Grégoire, Jorge Luis Sacchini. lpar 2010: 333-347 [doi]

Proving Termination in the Context-Sensitive Dependency Pair FrameworkRaúl Gutiérrez, Salvador Lucas. wrla 2010: 18-34 [doi]

Alternation for TerminationWilliam R. Harris, Akash Lal, Aditya V. Nori, Sriram K. Rajamani. SAS 2010: 304-319 [doi]

Size-Change Termination and Transition InvariantsMatthias Heizmann, Neil D. Jones, Andreas Podelski. SAS 2010: 22-50 [doi]

Decreasing Diagrams and Relative TerminationNao Hirokawa, Aart Middeldorp. cade 2010: 487-501 [doi]

A Swing Level Controlled Transmitter for Single-Ended Signaling with Center-Tapped TerminationYoung-Chan Jang. ieicet, 93-C(6):861-863, 2010. [doi]

Supercompiler HOSC 1.1: proof of terminationIlya Klyuchnikov. Preprint 21, 2010.

Termination Analysis with Compositional Transition InvariantsDaniel Kroening, Natasha Sharygina, Aliaksei Tsitovich, Christoph M. Wintersteiger. cav 2010: 89-103 [doi]

Initiation and termination of integration in a decision processTobias Larsen, Rafal Bogacz. NN, 23(3):322-333, 2010. [doi]

Termination of Multipartite Graph Series Arising from Complex Network ModellingMatthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen. cocoa 2010: 1-10 [doi]

Fast and Accurate Strong Termination Analysis with an Application to Partial EvaluationLeuschel, Michael, Tamarit, Salvador, Vidal, Germ?n. In Functional and Constraint Logic Programming. Volume 5979 of Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2010.

Interactive Termination Proofs Using Termination CoresPanagiotis Manolios, Daron Vroon. itp 2010: 355-370 [doi]

Static analysis of schema-mappings ensuring oblivious terminationBruno Marnette, Floris Geerts. icdt 2010: 183-195 [doi]

On the Termination of the Chase AlgorithmMichael Meier. rr 2010: 239-243 [doi]

PCN-based measured rate terminationMichael Menth, Frank Lehrieder. cn, 54(13):2099-2116, 2010. [doi]

Liveness Verification in TRSs Using Tree Automata and Termination AnalysisM. Mousazadeh, B. T. Ladani, Hans Zantema. cai, 29(3):407-426, 2010. [doi]

Termination of narrowing via termination of rewritingNaoki Nishida, Germán Vidal. aaecc, 21(3):177-225, 2010. [doi]

Automated Termination Analysis of Java Bytecode by Term RewritingCarsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl. RTA 2010: 259-276 [doi]

A New Method to Obtain Termination in Backward Proof Search For Modal Logic ::::S::::4Regimantas Pliuskevicius, Aida Pliuskeviciene. logcom, 20(1):353-379, 2010. [doi]

A New Method to Obtain Termination in Backward Proof Search for Modal Logic ::::S::::4Regimantas Pliuskevicius, Aida Pliuskeviciene. logcom, 20(1):381-387, 2010. [doi]

Proving Partial Correctness and Termination of Mutually Recursive ProgramsNikolaj Popov, Tudor Jebelean. synasc 2010: 153-156 [doi]

An Overview of the K Semantic FrameworkGrigore Rosu, Traian Serbanuta. jlp, 79(6):397-434, 2010. [doi]

Multi-Context Rewriting Induction with Termination CheckersHaruhiko Sato, Masahito Kurihara. ieicet, 93-D(5):942-952, 2010. [doi]

Cause and countermeasure of overtermination for PCN-based flow terminationDaisuke Satoh, Harutaka Ueno. ISCC 2010: 155-161 [doi]

Characterizing and proving operational termination of deterministic conditional term rewriting systemsFelix Schernhammer, Bernhard Gramlich. jlp, 79(7):659-688, 2010. [doi]

Automated termination analysis for logic programs with cutPeter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann. tplp, 10(4-6):365-381, 2010. [doi]

Static Termination Analysis for Prolog Using Term Rewriting and SAT SolvingPeter Schneider-Kamp. ki, 24(1):79-81, 2010. [doi]

An adaptive early termination of mode decision using inter-layer correlation in scalable video codingLiquan Shen, Zhi Liu, Ping An, Ran Ma, Zhaoyang Zhang. icip 2010: 4229-4232 [doi]

Verification, Induction, Termination Analysis - Festschrift for Christoph Walther on the Occasion of His 60th BirthdaySimon Siegler, Nathan Wasser, editors, Volume 6463 of Lecture Notes in Computer Science, Springer, 2010. [doi]

A termination analyzer for Java bytecode based on path-lengthFausto Spoto, Fred Mesnard, Ã‰tienne Payet. TOPLAS, 32(3), 2010. [doi]

Signature Extensions Preserve Termination - An Alternative Proof via Dependency PairsChristian Sternagel, René Thiemann. csl 2010: 514-528 [doi]

Dependency Triples for Improving Termination Analysis of Logic Programs with CutThomas Ströder, Peter Schneider-Kamp, Jürgen Giesl. LOPSTR 2011: 184-199 [doi]

Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency PairsKeita Uchiyama, Masahiko Sakai, Toshiki Sakabe. ieicet, 93-D(5):953-962, 2010. [doi]

Construction of Asynchronous Communicating Systems: Weak Termination Guaranteed!Kees M. van Hee, Natalia Sidorova, Jan Martijn E. M. van der Werf. SC 2010: 106-121 [doi]

A Partial Survey on Partial EvaluationAndre Vieira. SMP 2010:

Non-termination Analysis of Logic Programs Using TypesDean Voets, Danny De Schreye. LOPSTR 2011: 133-148 [doi]

Suppression of Guard-Trace Resonance by Matched Termination for Reducing Common-Mode RadiationTetsushi Watanabe, Tohlu Matsushima, Yoshitaka Toyota, Osami Wada, Ryuji Koga. ieicet, 93-B(7):1746-1753, 2010. [doi]

Termination analysis of business process workflowsMandy Weißbach, Wolf Zimmermann. ecows 2010: 18-25 [doi]

Termination Tools in Ordered CompletionSarah Winkler, Aart Middeldorp. cade 2010: 518-532 [doi]

Enhanced Termination Condition for Deterministic Broadcasting Protocols in Mobile Ad Hoc NetworksWilson Woon, Kwan L. Yeung. vtc 2010: 1-5 [doi]

Termination of Loop Programs with Polynomial GuardsBin Wu, Liyong Shen, Zhongqin Bi, Zhenbing Zeng. iccsa 2010: 482-496 [doi]

Termination Analysis of Linear LoopsMing Xu, Liangyu Chen, Zhenbing Zeng, Zhi-Bin Li. ijfcs, 21(6):1005-1019, 2010. [doi]

Fast Neighbor Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio NetworksYanyan Zeng, Neeraj Mittal, S. Venkatesan, R. Chandrasekaran. ispdc 2010: 149-156 [doi]

Mode-correlation-based early termination mode decision for multi-view video codingHuanqiang Zeng, Kai-Kuang Ma, Canhui Cai. icip 2010: 3405-3408 [doi]

Finite termination of a Newton-type algorithm for a class of affine variational inequality problemsNa Zhao, Zheng-Hai Huang. amc, 217(7):3368-3378, 2010. [doi]

Reducing task creation and termination overhead in explicitly parallel programsJisheng Zhao, Jun Shirako, V. Krishna Nandivada, Vivek Sarkar. IEEEpact 2010: 169-180 [doi]

PreviousNext