The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1970-1978 (15) 1979-1987 (18) 1988-1991 (15) 1992-1993 (15) 1994-1996 (23) 1997-1998 (16) 1999-2000 (23) 2001 (21) 2002 (22) 2003 (32) 2004 (39) 2005 (35) 2006 (50) 2007 (60) 2008 (56) 2009 (37) 2010 (19) 2011 (19) 2012 (24) 2013 (17) 2014 (15) 2015 (20) 2016 (16) 2017-2018 (32) 2019 (21) 2020 (27) 2021 (20) 2022-2023 (27) 2024 (4)
Publication types (Num. hits)
article(325) incollection(2) inproceedings(408) phdthesis(3)
Venues (Conferences, Journals, ...)
CoRR(48) CAV(18) TACAS(16) Discret. Math.(14) SPIN(12) COLT(11) FMCAD(10) Int. J. Softw. Tools Technol. ...(10) J. Graph Theory(10) ALT(9) ATVA(9) J. Comb. Theory, Ser. B(9) Discret. Comput. Geom.(7) PLDI(7) VMCAI(7) DAC(6) More (+10 of total 352)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 341 occurrences of 254 keywords

Results
Found 738 publication records. Showing 738 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
101Sanjay Jain 0001, Efim B. Kinber On Learning Languages from Positive Data and a Limited Number of Short Counterexamples. Search on Bibsonomy COLT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
101Edmund M. Clarke, Somesh Jha, Yuan Lu 0004, Helmut Veith Tree-Like Counterexamples in Model Checking. Search on Bibsonomy LICS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
94Duminda Wijesekera, Paul Ammann, Lingya Sun, Gordon Fraser 0001 Relating counterexamples to test cases in CTL model checking specifications. Search on Bibsonomy A-MOST The full citation details ... 2007 DBLP  DOI  BibTeX  RDF test coverage criteria, model checking, formal methods, software testing, state machines, counterexamples
91Tobias Nopper, Christoph Scholl 0001, Bernd Becker 0001 Computation of minimal counterexamples by using black box techniques and symbolic methods. Search on Bibsonomy ICCAD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
80Viktor Schuppan, Armin Biere Shortest Counterexamples for Symbolic Model Checking of LTL with Past. Search on Bibsonomy TACAS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
80Sanjay Jain 0001, Efim B. Kinber Learning Languages from Positive Data and Negative Counterexamples. Search on Bibsonomy ALT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
73Arie Gurfinkel, Marsha Chechik Generating Counterexamples for Multi-valued Model-Checking. Search on Bibsonomy FME The full citation details ... 2003 DBLP  DOI  BibTeX  RDF De Morgan algebras, model-checking, CTL, counterexamples, witnesses
70Ahmad Bekir, Solomon W. Golomb There Are No Further Counterexamples to S. Piccard's Theorem. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
70Chao Wang 0001, Aarti Gupta, Franjo Ivancic Induction in CEGAR for Detecting Counterexamples. Search on Bibsonomy FMCAD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
66Jianbin Tan, George S. Avrunin, Lori A. Clarke, Shlomo Zilberstein, Stefan Leue Heuristic-guided counterexample search in FLAVERS. Search on Bibsonomy SIGSOFT FSE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF FLAVERS, heuristic search, counterexamples
59Sujatha Kashyap, Vijay K. Garg Producing Short Counterexamples Using "Crucial Events". Search on Bibsonomy CAV The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
56A. K. McIver, Carroll C. Morgan, Carlos Gonzalía Proofs and Refutations for Probabilistic Refinement. Search on Bibsonomy FM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF quantitative program logic, refinement, constraint solving, counterexamples, Probabilistic systems
53Sanjay Jain 0001, Efim B. Kinber Learning Languages from Positive Data and a Finite Number of Queries. Search on Bibsonomy FSTTCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
52Kai-Hui Chang, Igor L. Markov, Valeria Bertacco Fixing Design Errors with Counterexamples and Resynthesis. Search on Bibsonomy ASP-DAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF simulation-based verification, digital design errors, error-correction framework, resynthesis techniques, goal-directed search, entropy-guided search, counterexamples, digital designs, combinational equivalence-checking
49Miguel E. Andrés, Pedro R. D'Argenio, Peter van Rossum Significant Diagnostic Counterexamples in Probabilistic Model Checking. Search on Bibsonomy Haifa Verification Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
49Edmund M. Clarke, Helmut Veith Counterexamples Revisited: Principles, Algorithms, Applications. Search on Bibsonomy Verification: Theory and Practice The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
49Tomoya Horiguchi, Tsukasa Hirashima The Role of Counterexamples in Discovery Learning Environment: Awareness of the Chance for Learning. Search on Bibsonomy JSAI Workshops The full citation details ... 2001 DBLP  DOI  BibTeX  RDF discovery learning environment, simulation, education, counterexample, CAI
49Roberto Giacobazzi, Elisa Quintarelli Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking. Search on Bibsonomy SAS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Domain Refinement, Model-checking, Verification, Program Analysis, Abstract Interpretation, Completeness
49Jürgen Forster Learning Multiplicity Automata from Smallest Counterexamples. Search on Bibsonomy EuroCOLT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
49Andrey Burago Learning Structurally Reversible Context-Free Grammars from Queries and Counterexamples in Polynomial Time. Search on Bibsonomy COLT The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
42ShengYu Shen, Ying Qin, Sikun Li Minimizing Counterexample of ACTL Property. Search on Bibsonomy CHARME The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
42Robert Meolic, Alessandro Fantechi, Stefania Gnesi Witness and Counterexample Automata for ACTL. Search on Bibsonomy FORTE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
42Tachio Terauchi Dependent types from counterexamples. Search on Bibsonomy POPL The full citation details ... 2010 DBLP  DOI  BibTeX  RDF interpolation, type inference, dependent types, counterexamples, intersection types
42Husain Aljazzar, Stefan Leue Generation of Counterexamples for Model Checking of Markov Decision Processes. Search on Bibsonomy QEST The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Stochastic Model Checking, $k$-Shortest-Paths Search, K$^*$, Markov Decision Processes, Counterexamples, Directed Search
42Sharon Shoham, Orna Grumberg A game-based framework for CTL counterexamples and 3-valued abstraction-refinement. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF 3-valued semantics, Model checking games, Temporal logic, CTL, Counterexamples, Abstraction-Refinement
42Wolfgang Maass 0001, György Turán On the Complexity of Learning from Counterexamples and Membership Queries Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF nondecreasing functions, domain subsets, learning from counterexamples, learning complexities, online learning models, combinatorial parameters, monomials, lower bound, membership queries, equivalence queries, threshold gates, concept class
38Berteun Damman, Tingting Han 0001, Joost-Pieter Katoen Regular Expressions for PCTL Counterexamples. Search on Bibsonomy QEST The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
38Santiago Ontañón, Enric Plaza Arguments and Counterexamples in Case-Based Joint Deliberation. Search on Bibsonomy ArgMAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Husain Aljazzar, Holger Hermanns, Stefan Leue Counterexamples for Timed Probabilistic Reachability. Search on Bibsonomy FORMATS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
38Sharon Shoham, Orna Grumberg A Game-Based Framework for CTL Counterexamples and 3-Valued Abstraction-Refinement. Search on Bibsonomy CAV The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
35Graham Steel, Alan Bundy Attacking Group Protocols by Refuting Incorrect Inductive Conjectures. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF cryptographic security protocols, counterexamples, superposition
32Alessandro Ferrante, Margherita Napoli, Mimmo Parente Graded-CTL: Satisfiability and Symbolic Model Checking. Search on Bibsonomy ICFEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
32Andrey Rybalchenko, Rishabh Singh Subsumer-First: Steering Symbolic Reachability Analysis. Search on Bibsonomy SPIN The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
32Ralf Wimmer 0001, Bettina Braitling, Bernd Becker 0001 Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking. Search on Bibsonomy VMCAI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
32Ashutosh Gupta 0001, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko, Ru-Gang Xu Proving non-termination. Search on Bibsonomy POPL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF non-termination, recurrent sets, model checking, testing, program verification
32Tobe Toben Counterexample Guided Spotlight Abstraction Refinement. Search on Bibsonomy FORTE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
32Marsha Chechik, Arie Gurfinkel A framework for counterexample generation and exploration. Search on Bibsonomy Int. J. Softw. Tools Technol. Transf. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Mengjun Li, Ti Zhou, Zhoujun Li 0001, Huowang Chen An Abstraction and Refinement Framework for Verifying Security Protocols Based on Logic Programming. Search on Bibsonomy ASIAN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF abstraction and refinement, security protocol
32Bing Li, Chao Wang 0001, Fabio Somenzi Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure. Search on Bibsonomy Int. J. Softw. Tools Technol. Transf. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Unsatisfiability proof, Bounded model checking, Satisfiability problem, Abstraction refinement
32Christophe Damas, Bernard Lambeau, Pierre Dupont, Axel van Lamsweerde Generating Annotated Behavior Models from End-User Scenarios. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Scenario-based elicitation, synthesis of behavior models, incremental learning, labeled transition systems, model validation, message sequence charts, analysis tools, scenario generation, invariant generation
32Byron Cook, Andreas Podelski, Andrey Rybalchenko Abstraction Refinement for Termination. Search on Bibsonomy SAS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Rong Chen, Franz Wotawa An Object Store Model for Diagnosing Java Programs. Search on Bibsonomy Australian Conference on Artificial Intelligence The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Yao-Wen Huang, Fang Yu 0001, Christian Hang, Chung-Hung Tsai, D. T. Lee, Sy-Yen Kuo Verifying Web Applications Using Bounded Model Checking. Search on Bibsonomy DSN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
32Maria Sorea Lazy Approximation for Dense Real-Time Systems. Search on Bibsonomy FORMATS/FTRTFT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
32Nina Amla, Robert P. Kurshan, Kenneth L. McMillan, Ricardo H. Medel Experimental Analysis of Different Techniques for Bounded Model Checking. Search on Bibsonomy TACAS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Faisal N. Abu-Khzam, Michael A. Langston Graph Coloring and the Immersion Order. Search on Bibsonomy COCOON The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Kenneth L. McMillan, Lenore D. Zuck Abstract Counterexamples for Non-disjunctive Abstractions. Search on Bibsonomy RP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Ricco Rakotomalala, Alain Morineau The TVpercentprinciple for the counterexamples statistic. Search on Bibsonomy Statistical Implicative Analysis The full citation details ... 2008 DBLP  DOI  BibTeX  RDF TVpercent, Intensity of implication, Measure, Association rule
28Husain Aljazzar, Stefan Leue Debugging of Dependability Models Using Interactive Visualization of Counterexamples. Search on Bibsonomy QEST The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Tsutomu Kumazawa, Tetsuo Tamai Iterative Model Fixing with Counterexamples. Search on Bibsonomy APSEC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Qun Lin 0001, Jiaquan Liu Counterexamples to the asymptotic expansion of interpolation in finite elements. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 65D05, 34E05, 74S05, 65B05
28Tingting Han 0001, Joost-Pieter Katoen Counterexamples in Probabilistic Model Checking. Search on Bibsonomy TACAS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Aaron R. Bradley, Zohar Manna Checking Safety by Inductive Generalization of Counterexamples to Induction. Search on Bibsonomy FMCAD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Agata Ciabattoni, Kazushige Terui Modular Cut-Elimination: Finding Proofs or Counterexamples. Search on Bibsonomy LPAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Daniel Kroening, Georg Weissenbacher Counterexamples with Loops for Predicate Abstraction. Search on Bibsonomy CAV The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Sanjay Jain 0001, Efim B. Kinber Iterative Learning from Positive Data and Negative Counterexamples. Search on Bibsonomy ALT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Henri Hansen, Antti Kervinen Minimal Counterexamples in O(n log n) Memory and O(n^2) Time. Search on Bibsonomy ACSD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Hiroshi Unno 0001, Naoki Kobayashi 0001, Akinori Yonezawa Combining type-based analysis and model checking for finding counterexamples against non-interference. Search on Bibsonomy PLAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF model checking, type system, non-interference
28Graham Steel The Importance of Non-theorems and Counterexamples in Program Verification. Search on Bibsonomy VSTTE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Alex Groce, Daniel Kroening, Flavio Lerda Understanding Counterexamples with explain. Search on Bibsonomy CAV The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
28Alex Groce, Willem Visser What Went Wrong: Explaining Counterexamples. Search on Bibsonomy SPIN The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Kenneth L. McMillan, Nina Amla Automatic Abstraction without Counterexamples. Search on Bibsonomy TACAS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Christian Haase 0001, Günter M. Ziegler Examples and Counterexamples for the Perles Conjecture. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
28Ondrej Sýkora, László A. Székely, Imrich Vrto Two Counterexamples in Graph Drawing. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
28Christophe Bourely, Gilles Défourneaux, Nicolas Peltier Building Proofs or Counterexamples by Analogy in a Resoluton Framework. Search on Bibsonomy JELIA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF extended resolution, second order terms, generalization, analogy, model building
24Thomas Bochot, Pierre Virelizier, Hélène Waeselynck, Virginie Wiels Paths to Property Violation: A Structural Approach for Analyzing Counter-Examples. Search on Bibsonomy HASE The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Analysis of counterexamples, SCADE models, structural paths
24Sumit Gulwani, Saurabh Srivastava 0001, Ramarathnam Venkatesan Program analysis as constraint solving. Search on Bibsonomy PLDI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF most-general counterexamples, non-termination analysis, strongest postcondition, program verification, constraint solving, weakest precondition, bounds analysis
21Dieter Jungnickel, Vladimir D. Tonchev Polarities, quasi-symmetric designs, and Hamada's conjecture. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 05B05, 51E20, 94B27
21Tingting Han 0001, Joost-Pieter Katoen, Berteun Damman Counterexample Generation in Probabilistic Model Checking. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
21Junyan Qian, Lingzhong Zhao, Guoyong Cai, Tianlong Gu Automatic Construction of Complete Abstraction by Abstract Interpretation. Search on Bibsonomy ACIS-ICIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
21Michael R. James 0001, Satinder Singh 0001 SarsaLandmark: an algorithm for learning in POMDPs with landmarks. Search on Bibsonomy AAMAS (1) The full citation details ... 2009 DBLP  BibTeX  RDF reinforcement learning, landmark, POMDP, partial observability
21Greg Dennis, Kuat Yessenov, Daniel Jackson 0001 Bounded Verification of Voting Software. Search on Bibsonomy VSTTE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
21Vijay Victor D'Silva, Mitra Purandare, Daniel Kroening Approximation Refinement for Interpolation-Based Model Checking. Search on Bibsonomy VMCAI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
21Marc Segelken Abstraction and Counterexample-Guided Construction of omega -Automata for Model Checking of Step-Discrete Linear Hybrid Models. Search on Bibsonomy CAV The full citation details ... 2007 DBLP  DOI  BibTeX  RDF automata construction, counterexample guidance, iterative abstraction refinement, step-discrete hybrid systems, model-checking
21Gordon Fraser 0001, Franz Wotawa Test-Case Generation and Coverage Analysis for Nondeterministic Systems Using Model-Checkers. Search on Bibsonomy ICSEA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
21Chao Wang 0001, Bing Li, HoonSang Jin, Gary D. Hachtel, Fabio Somenzi Improving Ariadne's Bundle by Following Multiple Threads in Abstraction Refinement. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
21Rong Chen, Franz Wotawa Diagnosing Program Errors with Light-Weighted Specifications. Search on Bibsonomy IEA/AIE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
21Husain Aljazzar, Stefan Leue Extended Directed Search for Probabilistic Timed Reachability. Search on Bibsonomy FORMATS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
21Stefan Leue, Wei Wei 0015 Counterexample-Based Refinement for a Boundedness Test for CFSM Languages. Search on Bibsonomy SPIN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
21Ansgar Fehnker, Edmund M. Clarke, Sumit Kumar Jha 0001, Bruce H. Krogh Refining Abstractions of Hybrid Systems Using Counterexample Fragments. Search on Bibsonomy HSCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
21Sudhindra Pandav, Konrad Slind, Ganesh Gopalakrishnan Counterexample Guided Invariant Discovery for Parameterized Cache Coherence Verification. Search on Bibsonomy CHARME The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
21Ranjit Jhala, Rupak Majumdar Path slicing. Search on Bibsonomy PLDI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF counterexample analysis, program slicing
21Bing Li, Fabio Somenzi Efficient computation of small abstraction refinements. Search on Bibsonomy ICCAD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
21Phillip Rogaway, Thomas Shrimpton Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance. Search on Bibsonomy FSE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF preimage resistance, second-preimage resistance, provable security, cryptographic hash functions, collision resistance
21Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu 0004, Helmut Veith Counterexample-guided abstraction refinement for symbolic model checking. Search on Bibsonomy J. ACM The full citation details ... 2003 DBLP  DOI  BibTeX  RDF temporal logic, Abstraction, symbolic model checking, hardware verification
21Edmund M. Clarke, Muralidhar Talupur, Helmut Veith, Dong Wang SAT Based Predicate Abstraction for Hardware Verification. Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
21Nobo Komagata Contextual Effects on Word Order: Information Structure and Information Theory. Search on Bibsonomy CONTEXT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
21Peer Johannsen BooStER: Speeding Up RTL Property Checking of Digital Designs by Word-Level Abstarction. Search on Bibsonomy CAV The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
21Günter M. Ziegler Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions. Search on Bibsonomy Computational Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
21Wolfgang Reif, Gerhard Schellhorn, Andreas Thums Flaw Detection in Formal Specifications. Search on Bibsonomy IJCAR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
21Radu Mateescu 0001 Efficient Diagnostic Generation for Boolean Equation Systems. Search on Bibsonomy TACAS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
21Gabriel Istrate Computational Complexity and Phase Transitions. Search on Bibsonomy CCC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
21Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Yunshan Zhu Symbolic Model Checking without BDDs. Search on Bibsonomy TACAS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
21Paul Ammann, Paul E. Black, William Majurski Using Model Checking to Generate Tests from Specifications. Search on Bibsonomy ICFEM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
21David Y. W. Park, Jens U. Skakkebæk, David L. Dill Static Analysis to Identify Invariants in RSML Specifications. Search on Bibsonomy FTRTFT The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
21Bernhard Gramlich Generalized Sufficient Conditions for Modular Termination of Rewriting. Search on Bibsonomy ALP The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
21Jyrki Nummenmaa, Peter Thanisch Conjectures and Refutations in Database Design and Dependency Theory. Search on Bibsonomy ICDT The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
17Gail Weiss, Yoav Goldberg, Eran Yahav Extracting automata from recurrent neural networks using queries and counterexamples (extended version). Search on Bibsonomy Mach. Learn. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
17Marco Cognetta, Vilém Zouhar, Sangwhan Moon, Naoaki Okazaki Two Counterexamples to Tokenization and the Noiseless Channel. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
17Fernando Albiac, José L. Ansorena, Óscar Blasco, Hùng Viêt Chu, Timur Oikhberg Counterexamples in isometric theory of symmetric and greedy bases. Search on Bibsonomy J. Approx. Theory The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 738 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][>>]
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