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