|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 37 occurrences of 31 keywords
|
|
|
Results
Found 52 publication records. Showing 52 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
104 | Solange Coupet-Grimal, William Delobel |
An effective proof of the well-foundedness of the multiset path ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 17(6), pp. 453-469, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Well-foundedness, Multiset path order, Termination, Constructive logic |
77 | Miquel Bofill, Albert Rubio |
Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings, pp. 456-470, 2002, Springer, 3-540-43931-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
76 | Amir Pnueli, Andreas Podelski, Andrey Rybalchenko |
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, pp. 124-139, 2005, Springer, 3-540-25333-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
66 | 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 |
58 | Henk Doornbos, Roland Carl Backhouse |
Algebra of Program Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction ![In: Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised Lectures, pp. 203-236, 2000, Springer, 3-540-43613-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
56 | Jeremy Gow, Alan Bundy, Ian Green |
Extensions to the Estimation Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic Programming and Automated Reasoning, 6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999, Proceedings, pp. 258-272, 1999, Springer, 3-540-66492-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
47 | Thomas E. Forster, John Kenneth Truss |
Non-well-foundedness of well-orderable power sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 68(3), pp. 879-884, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
45 | Shilong Ma, Yuefei Sui, Ke Xu 0001 |
Well limit behaviors of term rewriting systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Comput. Sci. China ![In: Frontiers Comput. Sci. China 1(3), pp. 283-296, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Gröbner bases, well-foundedness, term rewriting systems, limits |
38 | Eitetsu Ken, Kenji Tojo, Kazuki Watanabe 0003, Masaki Natori |
On principal types and well-foundedness of terms in ECC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.03486, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
38 | Nicolai Kraus, Jakob von Raumer |
Coherence via Well-Foundedness: Taming Set-Quotients in Homotopy Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 662-675, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
38 | Stefano Bistarelli, Francesco Santini 0001 |
Well-Foundedness in Weighted Argumentation Frameworks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence - 16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019, Proceedings, pp. 69-84, 2019, Springer, 978-3-030-19569-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
38 | Stefano Bistarelli, Francesco Santini 0001 |
Some Thoughts On Well-Foundedness in Weighted Abstract Argumentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October - 2 November 2018., pp. 623-624, 2018, AAAI Press, 978-1-57735-803-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
38 | Stefano Berardi |
Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, pp. 343-358, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-90-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
38 | Dandolo Flumini, Kentaro Sato |
From hierarchies to well-foundedness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 53(7-8), pp. 855-863, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
38 | Ian J. Hayes |
Invariants and Well-Foundedness in Program Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2010, 7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010. Proceedings, pp. 1-14, 2010, Springer, 978-3-642-14807-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
38 | Thomas Chatain, Victor Khomenko |
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 104(4), pp. 129-136, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Mohammad Reza Mousavi 0001, Michel A. Reniers |
On Well-Foundedness and Expressiveness of Promoted Tyft: Being Promoted Makes a Difference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOS@CONCUR ![In: Proceedings of the Third Workshop on Structural Operational Semantics, SOS 2006, Bonn, Germany, August 26, 2006, pp. 45-56, 2006, Elsevier. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Martin Hofmann 0001, Jaap van Oosten, Thomas Streicher |
Well-foundedness in Realizability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 45(7), pp. 795-805, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Shuly Wintner, Nissim Francez |
Off-Line Parsability and the Well-Foundedness of Subsumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 8(1), pp. 1-16, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Piotr Rudnicki, Andrzej Trybulec |
On Equivalents of Well-Foundedness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 23(3-4), pp. 197-234, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Shuly Wintner, Nissim Francez |
Off-line Parsability and the Well-foundedness of Subsumption ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cmp-lg/9709011, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
38 | Maria C. F. Ferreira, Hans Zantema |
Well-foundedness of Term Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTRS ![In: Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings, pp. 106-123, 1994, Springer, 3-540-60381-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
38 | John R. Steel |
The Well-Foundedness of the Mitchell Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 58(3), pp. 931-940, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Ran Rinat, Nissim Francez, Orna Grumberg |
Infinite Trees, Markings and Well-Foundedness ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 79(2), pp. 131-154, November 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
38 | Ran Rinat, Nissim Francez, Orna Grumberg |
Infinite Trees, Markings and Well Foundedness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '86, 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986, Proceedings, pp. 238-253, 1986, Springer, 3-540-16443-X. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
38 | Robert Goldblatt |
An algebraic study of well-foundedness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 44(4), pp. 423-437, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
38 | Jeremy E. Dawson, Rajeev Goré |
A General Theorem on Termination of Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings, pp. 100-114, 2004, Springer, 3-540-23024-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
well-founded ordering, recursive path ordering, termination, rewriting |
21 | Arnold Beckmann |
A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 41(3), pp. 251-257, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Cédric Dégremont, Olivier Roy |
Agreement Theorems in Dynamic-Epistemic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LORI ![In: Logic, Rationality, and Interaction, Second International Workshop, LORI 2009, Chongqing, China, October 8-11, 2009. Proceedings, pp. 105-118, 2009, Springer, 978-3-642-04892-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Cédric Dégremont, Olivier Roy |
Agreement theorems in dynamic-epistemic logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TARK ![In: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), Stanford, CA, USA, July 6-8, 2009, pp. 91-98, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | José-Antonio Alonso, Joaquín Borrego-Díaz, María-José Hidalgo, Francisco-Jesús Martín-Mateos, José-Luis Ruiz-Reina |
A Formally Verified Prover for the ALC Description Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007, Proceedings, pp. 135-150, 2007, Springer, 978-3-540-74590-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio |
Higher-Order Termination: From Kruskal to Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings, pp. 1-14, 2006, Springer, 3-540-48281-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Shuvendu K. Lahiri, Shaz Qadeer |
Verifying properties of well-founded linked lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, January 11-13, 2006, pp. 115-126, 2006, ACM, 1-59593-027-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
first-order axiomatization, heap abstraction, well-founded linked lists, decision procedure, automated theorem proving |
19 | Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio |
Paramodulation with Non-Monotonic Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pp. 225-233, 1999, IEEE Computer Society, 0-7695-0158-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
term rewriting, automated deduction |
19 | Maria C. F. Ferreira, Hans Zantema |
Syntactical Analysis of Total Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, 4th International Conference, ALP'94, Madid, Spain, September 14-16, 1994, Proceedings, pp. 204-222, 1994, Springer, 3-540-58431-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Jeffrey Sarnat, Carsten Schürmann 0001 |
Lexicographic Path Induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings, pp. 279-293, 2009, Springer, 978-3-642-02272-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Nachum Dershowitz |
On Lazy Commutation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Languages: From Formal to Natural ![In: Languages: From Formal to Natural, Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday, pp. 59-82, 2009, Springer, 978-3-642-01747-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Roland Carl Backhouse, Henk Doornbos |
Datatype-Generic Termination Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 43(3-4), pp. 362-393, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Allegory, Generic programming, Relation algebra, Programming methodology, Datatype |
19 | Cynthia Kop, Femke van Raamsdonk |
A Higher-Order Iterative Path Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings, pp. 697-711, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Pierre Courtieu, Julien Forest, Xavier Urbain |
Certifying a Termination Criterion Based on Graphs, without Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings, pp. 183-198, 2008, Springer, 978-3-540-71065-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Umut A. Acar, Amal Ahmed 0001, Matthias Blume |
Imperative self-adjusting computation. ![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. 309-322, 2008, ACM, 978-1-59593-689-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
mutable state, incremental computation, memoization, change propagation, self-adjusting computation, imperative programming, step-indexed logical relations |
19 | Steven Obua |
Partizan Games in Isabelle/HOLZF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2006, Third International Colloquium, Tunis, Tunisia, November 20-24, 2006, Proceedings, pp. 272-286, 2006, Springer, 3-540-48815-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Enrico Franconi, Sergio Tessaris |
The logic of RDF and SPARQL: a tutorial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA, pp. 355, 2006, ACM, 1-59593-318-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
semantic web, query language, data model |
19 | Adam Koprowski |
Certified Higher-Order Recursive Path Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 227-241, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Roland Carl Backhouse |
Datatype-Generic Reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 21-34, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
allegory, generic programming, relation algebra, programming methodology, Datatype |
19 | Alexander Serebrenik, Danny De Schreye |
Termination of Floating-Point Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 34(2), pp. 141-177, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
floating point, numerical computation, termination analysis |
19 | James Brotherston |
Cyclic Proofs for First-Order Logic with Inductive Definitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2005, Koblenz, Germany, September 14-17, 2005, Proceedings, pp. 78-92, 2005, Springer, 3-540-28931-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti |
Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 9(4), pp. 293-332, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Semantic unification, Hypersets, NP-completeness, Bisimulations, Set theory |
19 | Yves Moinard, Raymond Rolland |
Around a Powerful Property of Circumscriptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, European Workshop, JELIA '94, York, UK, September 5-8, 1994, Proceedings, pp. 34-49, 1994, Springer, 3-540-58332-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Julian C. Bradfield |
A Proof Assistant for Symbolic Model-Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, Fourth International Workshop, CAV '92, Montreal, Canada, June 29 - July 1, 1992, Proceedings, pp. 316-329, 1992, Springer, 3-540-56496-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Françoise Bellegarde, Pierre Lescanne |
Transformation Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT, Vol.1 ![In: TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'87), pp. 69-80, 1987, Springer, 3-540-17660-8. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
19 | Nissim Francez, Dexter Kozen |
Generalized Fair Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, Salt Lake City, Utah, USA, January 1984, pp. 46-53, 1984, ACM Press, 0-89791-125-3. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #52 of 52 (100 per page; Change: )
|
|