Search results for "counterexamples"

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