The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Disproving with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1986-2003 (20) 2004-2005 (21) 2006-2008 (17) 2009-2020 (16) 2021-2023 (7)
Publication types (Num. hits)
article(22) inproceedings(58) proceedings(1)
Venues (Conferences, Journals, ...)
D/PDPAR@IJCAR(13) CoRR(5) CADE(2) FroCos(2) GD(2) ICECCS(2) RTA(2) SODA(2) TABLEAUX(2) TAP(2) ACM Trans. Design Autom. Elect...(1) ADT(1) AMAST(1) Calculemus/MKM(1) CAV (2)(1) CIAC(1) More (+10 of total 57)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 21 occurrences of 21 keywords

Results
Found 81 publication records. Showing 81 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
46Martin Protzen Disproving Conjectures. Search on Bibsonomy CADE The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
36Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko Finer Is Better: Abstraction Refinement for Rewriting Approximations. Search on Bibsonomy RTA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
36Yohan Boichut, Thomas Genet Feasible Trace Reconstruction for Rewriting Approximations. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
36Philipp Rümmer, Muhammad Ali Shah Proving Programs Incorrect Using a Sequent Calculus for Java Dynamic Logic. Search on Bibsonomy TAP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Disproving, Testing, Program verification, Program logics
27Dragana Milovancevic, Viktor Kuncak Proving and Disproving Equivalence of Functional Programming Assignments. Search on Bibsonomy Proc. ACM Program. Lang. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27João Marques-Silva 0001 Disproving XAI Myths with Formal Methods - Initial Results. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27João Marques-Silva 0001 Disproving XAI Myths with Formal Methods - Initial Results. Search on Bibsonomy ICECCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27Salvador Lucas, Miguel Vítores, Raúl Gutiérrez Proving and disproving confluence of context-sensitive rewriting. Search on Bibsonomy J. Log. Algebraic Methods Program. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
27Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé Disproving the normal graph conjecture. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
27Georg Stefan Schmid, Viktor Kuncak Proving and Disproving Programs with Shared Mutable Data. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
27Sadmir Kudin, Enes Pasalic Proving the conjecture of O'Donnell in certain cases and disproving its general validity. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
27Siu-Wai Ho, Lin Ling, Chee Wei Tan 0001, Raymond W. Yeung Proving and Disproving Information Inequalities: Theory and Scalable Algorithms. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
27Raúl Gutiérrez, Salvador Lucas Automatically Proving and Disproving Feasibility Conditions. Search on Bibsonomy IJCAR (2) The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
27Daniel Malinowski, Karol Zebrowski Disproving the Conjectures from "On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model". Search on Bibsonomy ICITS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
27Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution). Search on Bibsonomy TACAS (2) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
27Keiichi Watanabe, Ryosuke Sato 0001, Takeshi Tsukada, Naoki Kobayashi 0001 Automatically disproving fair termination of higher-order functional programs. Search on Bibsonomy ICFP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
27Mengjun Li Automatic proving or disproving equality loop invariants based on finite difference techniques. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
27Holger Ingmar Meinhardt The Incorrect Usage of Propositional Logic in Game Theory: The Case of Disproving Oneself. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
27Takuya Kuwahara, Ryosuke Sato 0001, Hiroshi Unno 0001, Naoki Kobayashi 0001 Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs. Search on Bibsonomy CAV (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
27Taus Brock-Nannestad, Kaustuv Chaudhuri Disproving Using the Inverse Method by Iterative Refinement of Finite Approximations. Search on Bibsonomy TABLEAUX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
27James Brotherston, Nikos Gorogiannis Disproving Inductive Entailments in Separation Logic via Base Pair Approximation. Search on Bibsonomy TABLEAUX The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
27Siu-Wai Ho, Chee Wei Tan 0001, Raymond W. Yeung Proving and disproving information inequalities. Search on Bibsonomy ISIT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
27Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn Disproving termination with overapproximation. Search on Bibsonomy FMCAD The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
27Takahito Aoto 0001 Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering. Search on Bibsonomy FroCos The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
27Johannes Oetsch, Hans Tompits Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence. Search on Bibsonomy LPNMR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
27Michael Kaufmann 0001, Stephan Kottler Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles. Search on Bibsonomy GD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Heidi Gebauer Disproving the Neighborhood Conjecture Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
27Katell Morin-Allory, Marc Boule, Dominique Borrione, Zeljko Zilic Proving and disproving assertion rewrite rules with automated theorem provers. Search on Bibsonomy HLDVT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Stasys Jukna Disproving the Single Level Conjecture. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Stasys Jukna Disproving the single level conjecture Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2005 DBLP  BibTeX  RDF
27Tristan Denmat, Arnaud Gotlieb, Mireille Ducassé Proving or Disproving likely Invariants with Constraint Reasoning Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
27Jürgen Giesl, René Thiemann, Peter Schneider-Kamp Proving and Disproving Termination in the Dependency Pair Framework. Search on Bibsonomy Deduction and Applications The full citation details ... 2005 DBLP  BibTeX  RDF
27Tristan Denmat, Arnaud Gotlieb, Mireille Ducassé Proving or Disproving likely Invariants with Constraint Reasoning. Search on Bibsonomy WLPE The full citation details ... 2005 DBLP  BibTeX  RDF
27Jürgen Giesl, René Thiemann, Peter Schneider-Kamp Proving and Disproving Termination of Higher-Order Functions. Search on Bibsonomy FroCoS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Wolfgang Ahrendt, Peter Baumgartner 0001, Hans de Nivelle, Silvio Ranise, Cesare Tinelli (eds.) Selected Papers from the Workshops on Disproving, D@IJCAR 2004, and the Second International Workshop on Pragmatics of Decision Procedures, PDPAR@IJCAR 2004, Cork, Ireland, July 2004 Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2005 DBLP  BibTeX  RDF
27Wolfgang Ahrendt, Peter Baumgartner 0001, Hans de Nivelle, Silvio Ranise, Cesare Tinelli Preface. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Massimo Idini, Marco Maratea TSAT++: an Open Platform for Satisfiability Modulo Theories. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Jian Zhang, Zhuo Huang Reducing Symmetries to Generate Easier SAT Instances. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Robert Klapper, Aaron Stump Validated Proof-Producing Decision Procedures. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Dominique Larchey-Wendling Gödel-Dummett Counter-models through Matrix Computation. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Clark W. Barrett, Jacob Donham Combining SAT Methods with Non-Clausal Decision Heuristics. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Pascal Fontaine, E. Pascal Gribomont Combining Non-stably Infinite, Non-first Order Theories. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Didier Galmiche, Daniel Méry Resource Graphs and Countermodels in Resource Logics. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Tjark Weber Bounded Model Generation for Isabelle/HOL. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Simon Colton, Alison Pease The TM System for Repairing Non-Theorems. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Sergey Berezin, Clark W. Barrett, Igor Shikanian, Marsha Chechik, Arie Gurfinkel, David L. Dill A Practical Approach to Partial Functions in CVC Lite. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Leonardo Mendonça de Moura, Harald Rueß, Natarajan Shankar Justifying Equality. Search on Bibsonomy D/PDPAR@IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Frank Wolz, Reiner Kolla Disproving the Perfect-Rate Property of Data-Flow Graphs Unfolded by the Least Common Multiple of the Number of Loop Registers. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2003 DBLP  DOI  BibTeX  RDF data-flow programs, perfect-rate, Data-flow graphs
27Serge Autexier, Carsten Schürmann Disproving False Conjectures. Search on Bibsonomy LPAR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
27Steven M. Beitzel, Eric C. Jensen, Abdur Chowdhury, Ophir Frieder, David A. Grossman, Nazli Goharian Disproving the Fusion Hypothesis: An Analysis of Data Fusion via Effective Information Retrieval Strategies. Search on Bibsonomy SAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
27Chiuyuan Chen, Kaiping Wu Disproving a conjecture on planar visibility graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
27Gilles Défourneaux, Christophe Bourely, Nicolas Peltier Semantic Generalizations for Proving and Disproving Conjectures by Analogy. Search on Bibsonomy J. Autom. Reason. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
27Peter Padawitz The Use of Terminal Semantics for Disproving Inductive Theorems. Search on Bibsonomy ADT The full citation details ... 1986 DBLP  BibTeX  RDF
18Aiman Hanna, Hai Zhou Ling, Xiaochun Yang, Mourad Debbabi A Synergy between Static and Dynamic Analysis for the Detection of Software Security Vulnerabilities. Search on Bibsonomy OTM Conferences (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Static Analysis, Dynamic Analysis, Test-Data Generation, Security Testing, Security Automata
18Gianpiero Cabodi, Marco Murciano, Sergio Nocco, Stefano Quer Boosting interpolation with dynamic localized abstraction and redundancy removal. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Interpolant, abstraction, redundancy removal
18Timothy M. Chan On the bichromatic k-set problem. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
18Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau Towards an Efficient Implementation of Tree Automata Completion. Search on Bibsonomy AMAST The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Helga Velroyen, Philipp Rümmer Non-termination Checking for Imperative Programs. Search on Bibsonomy TAP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Sergey Bereg, Adrian Dumitrescu, Minghui Jiang 0001 On Covering Problems of Rado. Search on Bibsonomy SWAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai Cryptography with constant computational overhead. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF constant computational overhead, cryptography, universal hashing
18Jacques Carette, William M. Farmer, Volker Sorge A Rational Reconstruction of a System for Experimental Mathematics. Search on Bibsonomy Calculemus/MKM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Gianni Franceschini, J. Ian Munro Implicit dictionaries with O(1) modifications per update and fast search. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Gianpiero Cabodi, Marco Murciano, Sergio Nocco, Stefano Quer Stepping forward with interpolants in unbounded model checking. Search on Bibsonomy ICCAD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Stefan Felsner, Mareike Massow Thickness of Bar 1-Visibility Graphs. Search on Bibsonomy GD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Milos Besta, Frank A. Stomp An Assertional Correctness Proof of a Self-Stabilizing - Exclusion Algorithm. Search on Bibsonomy ICECCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Maurice Herlihy, Lucia Draque Penso Tight bounds for k-set agreement with limited-scope failure detectors. Search on Bibsonomy Distributed Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
18Donald Chai, Andreas Kuehlmann A fast pseudo-Boolean constraint solver. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
18Michael Backes 0001, Dennis Hofheinz How to Break and Repair a Universally Composable Signature Functionality. Search on Bibsonomy ISC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
18Vida Dujmovic, David R. Wood Tree-Partitions of k-Trees with Applications in Graph Layout. Search on Bibsonomy WG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
18Jana Z. Sukkarieh An Expressive Efficient Representation: Bridging a Gap between NLP and KR. Search on Bibsonomy KES The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
18Dennis Hofheinz, Jörn Müller-Quade, Rainer Steinwandt Initiator-Resilient Universally Composable Key Exchange. Search on Bibsonomy ESORICS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF formal cryptography, universalcomposition, cryptographic protocols, key exchange
18Donald Chai, Andreas Kuehlmann A fast pseudo-boolean constraint solver. Search on Bibsonomy DAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF 0-1 ILP, pseudo-boolean, satisfiability
18Marcelo Finger, Renata Wassermann Logics for Approximate Reasoning: Approximating Classical Logic "From Above". Search on Bibsonomy SBIA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
18Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang Triangulations without Minimum-Weight Drawing. Search on Bibsonomy CIAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Graph drawing, Minimum-weight triangulation
18Klaus Reinhardt A Parallel Context-Free Derivation Hierarchy. Search on Bibsonomy FCT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
18Arne Borälv Case Study: Formal Verification of a Computerized Railway Interlocking. Search on Bibsonomy Formal Aspects Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Stålmarck's method, Formal verification, Railway interlocking
18Hans-Jürgen Bandelt, Victor Chepoi Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
18Thomas R. Hancock, Tao Jiang 0001, Ming Li 0001, John Tromp Lower Bounds on Learning Decision Lists and Trees (Extended Abstract). Search on Bibsonomy STACS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
18Tie-Cheng Wang, Allen Goldberg KITP-93: An Automated Inference System for Program Analysis. Search on Bibsonomy CADE The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
18Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. Westbrook Page Migration Algorithms Using Work Functions. Search on Bibsonomy ISAAC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
18Lenwood S. Heath, Sorin Istrail The Pagenumber of Genus g Graphs is O(g). Search on Bibsonomy J. ACM The full citation details ... 1992 DBLP  DOI  BibTeX  RDF book embeddings, graph genus, homotopy classes, planar-nonplanar decomposition, surface embeddings
Displaying result #1 - #81 of 81 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license