|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1898 occurrences of 1118 keywords
|
|
|
Results
Found 4055 publication records. Showing 4055 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
24 | Salvatore Ruggieri |
Termination of Constraint Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 838-848, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Deepak Kapur, G. Sivakumar |
A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings, pp. 142-156, 1997, Springer, 3-540-62950-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Michael Leuschel, Bern Martens, Konstantinos Sagonas |
Preserving Termination of Tabled Logic Programs While Unfolding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic Programming Synthesis and Transformation, 7th International Workshop, LOPSTR'97, Leuven, Belgium, July 10-12, 1997, Proceedings, pp. 189-205, 1997, Springer, 3-540-65074-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
24 | M. R. K. Krishna Rao |
Modularity of Termination in Term Graph Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, Proceedings, pp. 230-244, 1996, Springer, 3-540-61464-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Thomas Arts, Jürgen Giesl |
Termination of Constructor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, Proceedings, pp. 63-77, 1996, Springer, 3-540-61464-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Ten-Hwang Lai, Li-Fen Wu |
An (N-1)-Resilient Algorithm for Distributed Termination Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 6(1), pp. 63-78, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Olav Lysne, Javier Piris |
A Termination Ordering for Higher Order Rewrite System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings, pp. 26-40, 1995, Springer, 3-540-59200-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Stefan Kahrs |
Towards a Domain Theory for Termination Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings, pp. 241-255, 1995, Springer, 3-540-59200-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Robert Gold |
A Fully Abstract Semantics for Termination in Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 373-382, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Aart Middeldorp, Hans Zantema |
Simple Termination Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26 - July 1, 1994, Proceedings, pp. 451-465, 1994, Springer, 3-540-58156-1. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Pierre Lescanne |
Termination of Rewrite Systems by Elementary Interpretations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, Third International Conference, Volterra, Italy, September 2-4, 1992, Proceedings, pp. 21-36, 1992, Springer, 3-540-55873-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Torben Amtoft |
Unfold/fold Transformations Preserving Termination Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLILP ![In: Programming Language Implementation and Logic Programming, 4th International Symposium, PLILP'92, Leuven, Belgium, August 26-28, 1992, Proceedings, pp. 187-201, 1992, Springer, 3-540-55844-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Gerard Tel, Friedemann Mattern |
The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARLE (1) ![In: PARLE '91: Parallel Architectures and Languages Europe, Volume I: Parallel Architectures and Algorithms, Eindhoven, The Netherlands, June 10-13, 1991, Proceedings, pp. 137-149, 1991, Springer, 3-540-54151-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Dieter Hofbauer |
Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 62-73, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Zbigniew M. Wójcik, Barbara E. Wójcik |
Termination condition for a parallel shape coding and a parallel shape coding algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, SPDP 1990, Dallas, Texas, USA, December 9-13, 1990., pp. 412-419, 1990, IEEE Computer Society, 0-8186-2087-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Deepak Kapur, G. Sivakumar, Hantao Zhang 0001 |
A New Method for Proving Termination of AC-Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings, pp. 133-148, 1990, Springer, 3-540-53487-3. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Sophie Tison |
Fair Termination is Decidable for Ground Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings, pp. 462-476, 1989, Springer, 3-540-51081-8. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Jeffrey D. Ullman, Allen Van Gelder |
Efficient tests for top-down termination of logical rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 35(2), pp. 345-373, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Prolog |
24 | Lutz Plümer |
Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings, pp. 254-271, 1988, Springer, 3-540-51659-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
24 | Gerard Tel, Richard B. Tan, Jan van Leeuwen |
The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings, pp. 445-455, 1987, Springer, 3-540-17219-X. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Brigitte Rozoy |
Model and Complexity of Termination for Distributed Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings, pp. 564-572, 1986, Springer, 3-540-16783-8. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
24 | David A. Plaisted |
A Simple Non-Termination Test for the Knuth-Bendix Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 79-88, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
24 | Isabelle Gnaedig, Pierre Lescanne |
Proving Termination of Associative Commutative Rewriting Systems by Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 52-61, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
24 | Nachum Dershowitz |
Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings, pp. 180-224, 1985, Springer, 3-540-15976-2. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
24 | Daniel Lehmann 0001, Amir Pnueli, Jonathan Stavi |
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings, pp. 264-277, 1981, Springer, 3-540-10843-2. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
24 | Alberto Pettorossi |
Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings, pp. 432-447, 1981, Springer, 3-540-10843-2. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
24 | Eberhard Bergmann |
On the Termination of Simple Computer Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1976, 5th Symposium, Gdansk, Poland, September 6-10, 1976, Proceedings, pp. 194-201, 1976, Springer, 0-387-07854-1. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
23 | Xinfang Liao, Yi Liu 0060, Changqing Xu, Chen Wang, Yintang Yang |
Comparison in radiation tolerance between FLR planar junction termination and positive bevel edge termination for power diodes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Microelectron. J. ![In: Microelectron. J. 128, pp. 105565, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Christopher Hampson |
On the termination and structural termination problems for counter machines with incrementing errors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 120, pp. 149-161, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Tsubasa Shoshi, Takuma Ishikawa, Naoki Kobayashi 0001, Ken Sakayori, Ryosuke Sato 0001, Takeshi Tsukada |
Termination Analysis for the π-Calculus by Reduction to Sequential Program Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.00311, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Tobias Reinhard, Bart Jacobs 0002 |
Ghost Signals: Verifying Termination of Busy Waiting - Verifying Termination of Busy Waiting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV (2) ![In: Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II, pp. 27-50, 2021, Springer, 978-3-030-81687-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Tsubasa Shoshi, Takuma Ishikawa, Naoki Kobayashi 0001, Ken Sakayori, Ryosuke Sato 0001, Takeshi Tsukada |
Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems - 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings, pp. 265-284, 2021, Springer, 978-3-030-89050-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | 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 |
|
23 | 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 |
|
23 | Phuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn |
Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, Phoenix, AZ, USA, June 22-26, 2019., pp. 845-859, 2019, ACM, 978-1-4503-6712-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Cristina Borralleras, Marc Brockschmidt, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio |
Proving Termination Through Conditional Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS (1) ![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 I, pp. 99-117, 2017, 978-3-662-54576-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | 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 |
|
23 | 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 |
|
23 | 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 |
|
23 | 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 |
|
23 | 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 |
|
23 | 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 |
|
23 | 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 |
|
23 | Alexander Krauss 0001, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl |
Termination of Isabelle Functions via Termination of Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: Interactive Theorem Proving - Second International Conference, ITP 2011, Berg en Dal, The Netherlands, August 22-25, 2011. Proceedings, pp. 152-167, 2011, Springer, 978-3-642-22862-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Naoki Nishida 0001, Germán Vidal |
Termination of narrowing via termination of rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 21(3), pp. 177-225, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe |
Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 93-D(5), pp. 953-962, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Aaron Stump, Vilhelm Sjöberg, Stephanie Weirich |
Termination Casts: A Flexible Approach to Termination with General Recursion ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAR ![In: Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers, PAR 2010, Edinburgh, UK, 15th July 2010., pp. 76-93, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Nobuhiro Kuga, Kohei Nemoto |
Low-PIM termination design using a resistive termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Electron. Express ![In: IEICE Electron. Express 7(3), pp. 222-227, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Aaron Stump, Vilhelm Sjöberg, Stephanie Weirich |
Termination Casts: A Flexible Approach to Termination with General Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAR@ITP ![In: Partiality and Recursion in Interactive Theorem Provers, PAR@ITP 2010, Edinburgh, UK, July 15, 2010, pp. 84-100, 2010, EasyChair. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Panagiotis Manolios, Daron Vroon 0001 |
Interactive Termination Proofs Using Termination Cores. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: Interactive Theorem Proving, First International Conference, ITP 2010, Edinburgh, UK, July 11-14, 2010. Proceedings, pp. 355-370, 2010, Springer, 978-3-642-14051-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe |
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WRS@RDP ![In: Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, WRS@RDP 2007, Paris, France, June 25, 2007, pp. 21-34, 2007, Elsevier. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Mirtha-Lina Fernández |
On proving CE-termination of rewriting by size-change termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 93(4), pp. 155-162, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | 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 |
|
23 | Salvador Lucas |
Termination of On-Demand Rewriting and Termination of OBJ Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, September 5-7, 2001, Florence, Italy, pp. 82-93, 2001, ACM, 1-58113-388-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Kees Doets |
Left Termination Turned into Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 124(1), pp. 180-187, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Michael L. Tiomkin |
Probabilistic Termination Versus Fair Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 66(3), pp. 333-340, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | John V. Guttag, Deepak Kapur, David R. Musser |
On Proving Uniform Termination and Restricted Termination of Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 12(1), pp. 189-214, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
19 | Harald Zankl, Nao Hirokawa, Aart Middeldorp |
KBO Orientability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 43(2), pp. 173-201, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Knuth-Bendix order, Termination, Term rewriting |
19 | Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv |
A combination framework for tracking partition sizes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 239-251, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
combining analyses, set analysis, termination, shape analysis, numerical analysis, memory safety, space bounds |
19 | Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilimbi |
SPEED: precise and efficient static estimation of program computational complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 127-139, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
counter instrumentation, quantitative functions, symbolic complexity bounds, termination analysis |
19 | Roberto M. Amadio |
On Stratified Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, 7th Asian Symposium, APLAS 2009, Seoul, Korea, December 14-16, 2009. Proceedings, pp. 210-225, 2009, Springer, 978-3-642-10671-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Types and effects, Reducibility candidates, Termination |
19 | Sumit Gulwani, Sagar Jain, Eric Koskinen |
Control-flow refinement and progress invariants for bound analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, June 15-21, 2009, pp. 375-385, 2009, ACM, 978-1-60558-392-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
control-flow refinement, progress invariants, formal verification, program verification, termination, bound analysis |
19 | Yu-Ming Lee, Yong-Fu Wang, Jia-Ren Wang, Yinyi Lin |
An Adaptive and Efficient Selective Multiple Reference Frames Motion Estimation for H.264 Video Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PSIVT ![In: Advances in Image and Video Technology, Third Pacific Rim Symposium, PSIVT 2009, Tokyo, Japan, January 13-16, 2009. Proceedings, pp. 509-518, 2009, Springer, 978-3-540-92956-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
multiple reference frames, selective multiple reference frames motion estimation (SMRFME), AZB, H.264, region based, early termination |
19 | 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 |
19 | Jonathan Billington, Bing Han |
Modelling and analysing the functional behaviour of TCP's connection management procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 9(3-4), pp. 269-304, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
TCP connection management, Termination property, Deadlocks, Coloured Petri Nets, State space analysis |
19 | Erich L. Kaltofen, Zhengfeng Yang |
On exact and approximate interpolation of sparse rational functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pp. 203-210, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hybrid symbolic-numeric computation, rational vector recovery, sparse rational function interpolation, lattice basis reduction, early termination |
19 | Raymond T. Boute |
Calculational semantics: Deriving programming theories from equations by functional predicate calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 28(4), pp. 747-793, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
calculational reasoning, functional predicate calculus, intuitive semantics, strongest postcondition, weakest antecondition, termination, formal semantics, programming theories, Assignment, generic functionals, loops, nondeterminacy, axiomatic semantics |
19 | Kaushik Chakrabarti, Venkatesh Ganti, Jiawei Han 0001, Dong Xin |
Ranking objects based on relationships. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 27-29, 2006, pp. 371-382, 2006, ACM, 1-59593-256-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
ranking, aggregation, keyword search, relationships, named entities, top-k queries, early termination |
19 | Ke Chen 0001 |
Adaptive Smoothing via Contextual and Local Discontinuities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 27(10), pp. 1552-1567, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
inhomogeneity, spatial gradient, local scale control, multiple scales, the termination problem, extraction of hydrographic objects, anisotropic diffusion, noise removal, feature preservation, Adaptive smoothing |
19 | Tatsuo Arai |
Epsilon substitution method for [Pi01, Pi01]-FIX. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(8), pp. 1009-1043, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Epsilon substitution, Ordinal interpretation, Termination proof |
19 | Lu Yang, Naijun Zhan, Bican Xia, Chaochen Zhou |
Program Verification by Using DISCOVERER. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VSTTE ![In: Verified Software: Theories, Tools, Experiments, First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions, pp. 528-538, 2005, Springer, 978-3-540-69147-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
semi-algebraic systems, DISCOVERER, reachability computation, program verification, termination, invariant generation |
19 | J. Guadalupe Ramos, Josep Silva, Germán Vidal |
Fast narrowing-driven partial evaluation for inductively sequential programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005, Tallinn, Estonia, September 26-28, 2005, pp. 228-239, 2005, ACM, 1-59593-064-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
offline partial evaluation, quasi-termination, narrowing |
19 | Ling Cheung |
Randomized Wait-Free Consensus Using an Atomicity Assumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Papers, pp. 47-60, 2005, Springer, 3-540-36321-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Asynchronous Consensus, Wait-Free Termination, Weak Adversary, Randomized Algorithms, Probabilistic Model Checking |
19 | David Garrett, Chris Nicol, Andrew J. Blanksby, Chris J. Howland |
A low power normalized-LMS decision feedback equalizer for a wireless packet modem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISLPED ![In: Proceedings of the 2002 International Symposium on Low Power Electronics and Design, 2002, Monterey, California, USA, August 12-14, 2002, pp. 290-294, 2002, ACM, 1-58113-475-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
NLMS, low power, equalization, early termination |
19 | Chengxian Xu, Jianzhong Zhang 0001 |
A Survey of Quasi-Newton Equations and Quasi-Newton Methods for Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 103(1-4), pp. 213-234, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
quasi-Newton equations, finite termination, quasi-Newton methods, convergence properties, positive definiteness |
19 | Jean Goubault-Larrecq |
Well-Founded Recursive Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 484-497, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
well-foundedness, path orderings, Knuth-Bendix orderings, higher-order path orderings, graphs, automata, Termination, calculus |
19 | Peter A. Buhr, W. Y. Russell Mok |
Advanced Exception Handling Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 26(9), pp. 820-836, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
resumption, concurrent, object-oriented, robustness, Exception handling, interrupts, termination |
19 | Jon Whittle 0001, Alan Bundy, Richard J. Boulton, Helen Lowe |
An ML Editor Based on Proofs-As-Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: The 14th IEEE International Conference on Automated Software Engineering, ASE 1999, Cocoa Beach, Florida, USA, 12-15 October 1999, pp. 166-173, 1999, IEEE Computer Society, 0-7695-0415-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
proofs-as-programs, termination proof, Functional programming |
19 | Helena Rodrigues, Richard E. Jones |
Cyclic Distributed Garbage Collection with Group Merger. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: ECOOP'98 - Object-Oriented Programming, 12th European Conference, Brussels, Belgium, July 20-24, 1998, Proceedings, pp. 260-284, 1998, Springer, 3-540-64737-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
distributed systems, garbage collection, termination detection |
19 | 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 |
19 | Kam Hong Shum |
Fault tolerant cluster computing through replication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 11-13 December 1997, Seoul, Korea, Proceedings, pp. 756-, 1997, IEEE Computer Society, 0-8186-8227-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
fault tolerant cluster computing, runtime overhead, fault tolerance schemes, checkpoint states, fault tolerant model, Fujitsu AP3000 multi-processor machine, performance evaluation, replication, workstation clusters, workstation cluster, fault recovery, resource consumption, program termination |
19 | Kim Guldstrand Larsen, Fredrik Larsson, Paul Pettersson, Wang Yi 0001 |
Efficient verification of real-time systems: compact data structure and state-space reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS '97), December 3-5, 1997, San Francisco, CA, USA, pp. 14-24, 1997, IEEE Computer Society, 0-8186-8268-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
real-time systems verification, clock values, clock constraints, real-valued variables, static analysis, timed automata, termination, reachability analysis, reachability analysis, state-space reduction, compact data structure |
19 | Andrea Clematis, Vittoria Gianuzzi |
CPVM - Extending PVM for Consistent Checkpointing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), January 24-26, 1996, Portugal, pp. 67-74, 1996, IEEE Computer Society, 0-8186-7376-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
CPVM, consistent checkpointing, global checkpoint-restart algorithms, job-swapping, parallel programming, software tools, concurrency control, migration, deadlocks, termination, software fault tolerance, software fault-tolerance, software libraries, software library, PVM, Parallel Virtual Machine, software portability, nonblocking |
19 | Pietro Camarda, G. Schiraldi, Fabrizio Talucci |
Mobility Modeling in Cellular Communication Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 21st Conference on Local Computer Networks, Minneapolis, Minnesota, USA, October 13-16, 1996, pp. 518-525, 1996, IEEE Computer Society, 0-8186-7617-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
cellular communication networks, finite population, fixed channel allocation, users distribution, new call blocking probability, hand-off blocking probability, forced termination probability, unsuccessful probability, performance evaluation, analytical model, mobility modeling, system performance, numerical simulation, cellular radio, load conditions |
19 | Soong Hee Lee |
A Reactive Access Control Scheme at UNI for Congestion Control in ATM-Based B-ISDN. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 21st Conference on Local Computer Networks, Minneapolis, Minnesota, USA, October 13-16, 1996, pp. 366-373, 1996, IEEE Computer Society, 0-8186-7617-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
reactive access control scheme, UNI, ATM-based B-ISDN, active traffic sources, feedback traffic, GFC field, B-NT system, network congestion state, probability of overflow, node output buffer, generic flow control, broadband network termination, user network interface, performance evaluation, asynchronous transfer mode, congestion control, computer simulation |
19 | Kazuaki Rokusawa, Akihiko Nakase, Takashi Chikayama |
Quiescence Detection in a Distributed KLIC Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '95 Parallel Processing, First International Euro-Par Conference, Stockholm, Sweden, August 29-31, 1995, Proceedings, pp. 539-551, 1995, Springer, 3-540-60247-X. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
quiescence detection, distributed implementation, weighted reference counting, termination detection, concurrent logic programming |
19 | J. Roger Mitchell, Vijay K. Garg |
Deriving distributed algorithms from a general predicate detector. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: 19th International Computer Software and Applications Conference (COMPSAC'95), August 9-11, 1995, Dallas, Texas, USA, pp. 268-273, 1995, IEEE Computer Society, 0-8186-7119-X. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
generalized conjunctive predicate detector, distributed system debugging, condition detection, application status monitoring, periodic global virtual time calculation, optimized base algorithm, software engineering, computational complexity, distributed algorithms, distributed algorithms, program debugging, system monitoring, termination detection, virtual time, distributed system design, detection algorithms |
19 | Jay J. Lee, Kwi-Yung Jung |
An algorithm for determining the feasibility of SONET/ATM rings in broadband networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN '95), September 20-23, 1995, Las Vegas, Nevada, USA, pp. 356, 1995, IEEE Computer Society, 0-8186-7180-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
SONET/ATM rings, synchronous optical network, self-healing ring architecture, economical broadband networks, survivable broadband networks, nonhierarchical path multiplexing, diverse protection architecture, ATM/add-drop multiplexer, VP-based ATM rings, SONET ADM, ATM STS-3c line cards, STS-3 termination cards, reference network databases, demand routing, algorithm, asynchronous transfer mode, simulation results, traffic, network connectivity, broadband networks, network size, virtual path, SONET, cost savings |
19 | Vijay K. Garg, Craig M. Chase, J. Roger Mitchell, Richard B. Kilgore |
Detecting conjunctive channel predicates in a distributed programming environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 232-241, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
conjunctive channel predicates detection, efficient global predicate detection, local predicates, global virtual time computation, distributed processing, message passing, Boolean functions, programming environments, communication complexity, programming theory, monotonicity, message complexity, Boolean formula, termination detection, telecommunication channels, distributed programming environment |
19 | Annalisa Bossi, Sandro Etalle |
Transforming Acyclic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 16(4), pp. 1081-1096, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
acyclic programs, terminating programs, termination |
18 | Fan Zhang 0092, Shuming Shi 0001, Hao Yan, Ji-Rong Wen |
Revisiting globally sorted indexes for efficient document retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSDM ![In: Proceedings of the Third International Conference on Web Search and Web Data Mining, WSDM 2010, New York, NY, USA, February 4-6, 2010, pp. 371-380, 2010, ACM, 978-1-60558-889-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dynamic index pruning, globally-sorted index, top-k |
18 | Georg Moser |
The Hydra battle and Cichon's principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 20(2), pp. 133-158, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Kousha Etessami, Mihalis Yannakakis |
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(1), pp. 1:1-1:66, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Recursive Markov chains, monotone nonlinear systems, multi-type branching processes, Newton's method, stochastic context-free grammars |
18 | 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 |
|
18 | Takahito Aoto 0001, Toshiyuki Yamada |
Argument Filterings and Usable Rules for Simply Typed Dependency Pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 7th International Symposium, FroCoS 2009, Trento, Italy, September 16-18, 2009. Proceedings, pp. 117-132, 2009, Springer, 978-3-642-04221-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Amir Pnueli |
Using Abstraction to Verify Arbitrary Temporal Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 15th Asia-Pacific Software Engineering Conference (APSEC 2008), 3-5 December 2008, Beijing, China, pp. 3, 2008, IEEE Computer Society, 978-0-7695-3446-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Stephan Falke 0001, Deepak Kapur |
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 94-109, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Ralph Matthes |
Recursion on Nested Datatypes in Dependent Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings, pp. 431-446, 2008, Springer, 978-3-540-69405-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Harald Zankl, Aart Middeldorp |
Increasing Interpretations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC/MKM/Calculemus ![In: Intelligent Computer Mathematics, 9th International Conference, AISC 2008, 15th Symposium, Calculemus 2008, 7th International Conference, MKM 2008, Birmingham, UK, July 28 - August 1, 2008. Proceedings, pp. 191-205, 2008, Springer, 978-3-540-85109-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Related Topics implementations of symbolic computation systems, logic and symbolic computing |
18 | Stephen D. Patek |
Partially Observed Stochastic Shortest Path Problems With Approximate Solution by Neurodynamic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part A ![In: IEEE Trans. Syst. Man Cybern. Part A 37(5), pp. 710-720, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #401 - #500 of 4055 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|