Search results for "Over-approximation"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine	Approximated parameterized verification of infinite-state processes with global conditions.	Formal Methods Syst. Des.	2009	DBLP DOI BibTeX RDF	Unbounded processes, Over-approximation, Parameterized systems
19	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
19	Vijay Victor D'Silva, Mitra Purandare, Daniel Kroening	Approximation Refinement for Interpolation-Based Model Checking.	VMCAI	2008	DBLP DOI BibTeX RDF
16	Randal E. Bryant, Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman, Bryan A. Brady	An abstraction-based decision procedure for bit-vector arithmetic.	Int. J. Softw. Tools Technol. Transf.	2009	DBLP DOI BibTeX RDF	Decision-procedures, Bit-vector
16	Randal E. Bryant, Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman, Bryan A. Brady	Deciding Bit-Vector Arithmetic with Abstraction.	TACAS	2007	DBLP DOI BibTeX RDF
16	Abdelli Abdelkrim, Dahbia Yahiatene	Efficient computation of state space over approximation of preemptive real time systems.	AICCSA	2008	DBLP DOI BibTeX RDF
15	Zhiyi Xue, Si Liu 0003, Zhaodi Zhang, Yiting Wu, Min Zhang 0002	A Tale of Two Approximations: Tightening Over-Approximation for DNN Robustness Verification via Under-Approximation.	CoRR	2023	DBLP DOI BibTeX RDF
15	Zhiyi Xue, Si Liu 0003, Zhaodi Zhang, Yiting Wu, Min Zhang 0002	A Tale of Two Approximations: Tightening Over-Approximation for DNN Robustness Verification via Under-Approximation.	ISSTA	2023	DBLP DOI BibTeX RDF
15	Yiting Wu, Zhaodi Zhang, Zhiyi Xue, Si Liu 0003, Min Zhang	DualApp: Tight Over-Approximation for Neural Network Robustness Verification via Under-Approximation.	CoRR	2022	DBLP DOI BibTeX RDF
15	Robert Brummayer, Armin Biere	Effective Bit-Width and Under-Approximation.	EUROCAST	2009	DBLP DOI BibTeX RDF
12	Yohan Boichut, Thomas Genet	Feasible Trace Reconstruction for Rewriting Approximations.	RTA	2006	DBLP DOI BibTeX RDF
11	Jason Baumgartner, Andreas Kuehlmann	Enhanced Diameter Bounding via Structural.	DATE	2004	DBLP DOI BibTeX RDF
9	Abdelkrim Abdelli	Time distance-based computation of the DBM over-approximation of preemptive real-time systems.	J. Log. Algebraic Methods Program.	2024	DBLP DOI BibTeX RDF
9	Mahendra Singh Tomar, Christoph Kawan, Majid Zamani 0001	Numerical over-approximation of invariance entropy via finite abstractions.	Syst. Control. Lett.	2022	DBLP DOI BibTeX RDF
9	Shadi Haddad, Abhishek Halder	Anytime Ellipsoidal Over-approximation of Forward Reach Sets of Uncertain Linear Systems.	CoRR	2021	DBLP BibTeX RDF
9	Shadi Haddad, Abhishek Halder	Anytime ellipsoidal over-approximation of forward reach sets of uncertain linear systems.	CAADCPS@CPSIoTWeek	2021	DBLP DOI BibTeX RDF
9	Eugenio Moggi, Walid Taha, Johan Thunberg	Sound Over-Approximation of Probabilities.	Acta Cybern.	2020	DBLP DOI BibTeX RDF
9	Max Tschaikowski	Over-Approximation of Fluid Models.	IEEE Trans. Autom. Control.	2020	DBLP DOI BibTeX RDF
9	Peter Zechel, Ralph Streiter, Klaus Bogenberger, Ulrich Göhner	Over-Approximation of the Driver Behavior as Occupancy Prediction.	ISKE	2019	DBLP DOI BibTeX RDF
9	Jérôme Feret, Kim Quyen Ly	Local Traces: An Over-Approximation of the Behavior of the Proteins in Rule-Based Models.	IEEE ACM Trans. Comput. Biol. Bioinform.	2018	DBLP DOI BibTeX RDF
9	Yassamine Seladji, Zheng Qu 0001	Polyhedron over-approximation for complexity reduction in static analysis.	Int. J. Comput. Math. Comput. Syst. Theory	2018	DBLP DOI BibTeX RDF
9	Hui Kong 0004, Ezio Bartocci, Thomas A. Henzinger	Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes.	CAV (1)	2018	DBLP DOI BibTeX RDF
9	Max Tschaikowski	Over-Approximation of Fluid Models.	CoRR	2017	DBLP BibTeX RDF
9	Anicet Bart, Charlotte Truchet, Éric Monfroy	A global constraint for over-approximation of real-time streams.	Constraints An Int. J.	2017	DBLP DOI BibTeX RDF
9	Yude Lin	Symbolic execution with over-approximation.		2017	RDF
9	Chuchu Fan, James Kapinski, Xiaoqing Jin, Sayan Mitra	Locally optimal reach set over-approximation for nonlinear systems.	EMSOFT	2016	DBLP DOI BibTeX RDF
9	Jérôme Feret, Kim Quyên Lý	Local Traces: An Over-Approximation of the Behaviour of the Proteins in Rule-Based Models.	CMSB	2016	DBLP DOI BibTeX RDF
9	Yinan Li 0001, Jun Liu 0015, Necmiye Ozay	Computing finite abstractions with robustness margins via local reachable set over-approximation.	CoRR	2015	DBLP BibTeX RDF
9	Yinan Li 0001, Jun Liu 0015, Necmiye Ozay	Computing finite abstractions with robustness margins via local reachable set over-approximation.	ADHS	2015	DBLP DOI BibTeX RDF
9	Mohammad Abdulaziz, Charles Gretton, Michael Norrish	Verified Over-Approximation of the Diameter of Propositionally Factored Transition Systems.	ITP	2015	DBLP DOI BibTeX RDF
9	Yunqing Wen, Guoqiang Li 0001, Shoji Yuen	An Over-Approximation Forward Analysis for Nested Timed Automata.	SOFL+MSVL	2014	DBLP DOI BibTeX RDF
9	Abdelli Abdelkrim	Improving the Construction of the DBM Over Approximation of the State Space of Real-time Preemptive Systems.	Acta Cybern.	2012	DBLP DOI BibTeX RDF
9	Alessandro Marchetto 0001, Paolo Tonella, Filippo Ricca	Under and Over Approximation of State Models Recovered for Ajax Applications.	CSMR	2010	DBLP DOI BibTeX RDF
9	Nacim Ramdani, Nacim Meslem, Yves Candau	A Hybrid Bounding Method for Computing an Over-Approximation for the Reachable Set of Uncertain Nonlinear Systems.	IEEE Trans. Autom. Control.	2009	DBLP DOI BibTeX RDF
9	Mila E. Majster-Cederbaum, Christoph Minnameier	Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems.	RP	2009	DBLP DOI BibTeX RDF
9	Dusan M. Stipanovic, Inseok Hwang 0002, Claire J. Tomlin	Computation of an over-approximation of the backward reachable set using subsystem level set functions.	ECC	2003	DBLP DOI BibTeX RDF
9	Christopher Lynch	Unsound Theorem Proving.	CSL	2004	DBLP DOI BibTeX RDF
9	John P. Gallagher, Mads Rosendahl	Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation.	LPAR	2008	DBLP DOI BibTeX RDF
9	Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux	Rewriting Approximations for Fast Prototyping of Static Analyzers.	RTA	2007	DBLP DOI BibTeX RDF
9	Thomas Genet, Francis Klay	Rewriting for Cryptographic Protocol Verification.	CADE	2000	DBLP DOI BibTeX RDF
8	Michael Huth 0001, Orna Grumberg	Special section on advances in reachability analysis and decision procedures: contributions to abstraction-based system verification.	Int. J. Softw. Tools Technol. Transf.	2009	DBLP DOI BibTeX RDF	Bounded reachability, Bit-vector arithmetic, Abstraction, Asynchronous systems, Decision diagrams, Memory models, Decision problems
8	Sumit Gulwani, Bill McCloskey, Ashish Tiwari 0001	Lifting abstract interpreters to quantified logical domains.	POPL	2008	DBLP DOI BibTeX RDF	logical lattices, quantified invariants, underapproximation algorithms, abstract interpreter
7	Max Schäfer, Oege de Moor	Type inference for datalog with complex type hierarchies.	POPL	2010	DBLP DOI BibTeX RDF	type system, datalog, type inference
7	Matthew Hague, C.-H. Luke Ong	Winning Regions of Pushdown Parity Games: A Saturation Method.	CONCUR	2009	DBLP DOI BibTeX RDF
7	Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau	Towards an Efficient Implementation of Tree Automata Completion.	AMAST	2008	DBLP DOI BibTeX RDF
7	Sumit Gulwani, Nebojsa Jojic	Program verification as probabilistic inference.	POPL	2007	DBLP DOI BibTeX RDF	automated recovery machine, forward and backward analysis, over and under approximation, learning, program verification, Markov chain Monte Carlo, Gibbs sampling, belief networks, probabilistic inference, factor graphs
7	Luca de Alfaro, Pritam Roy	Solving Games Via Three-Valued Abstraction Refinement.	CONCUR	2007	DBLP DOI BibTeX RDF
6	Junghee Lim, Thomas W. Reps, Ben Liblit	Extracting Output Formats from Executables.	WCRE	2006	DBLP DOI BibTeX RDF
6	Mahadevan Subramaniam, Jiangfan Shi	Using Dominators to Extract Observable Protocol Contexts.	SEFM	2005	DBLP DOI BibTeX RDF
6	Natasha Sharygina, Stefano Tonetta, Aliaksei Tsitovich	The synergy of precise and fast abstractions for program verification.	SAC	2009	DBLP DOI BibTeX RDF	CEGAR, predicate abstraction, abstraction refinement
6	Matthias Ehrgott, Xavier Gandibleux	Hybrid Metaheuristics for Multi-objective Combinatorial Optimization.	Hybrid Metaheuristics	2008	DBLP DOI BibTeX RDF
6	Antoine Girard, Colas Le Guernic	Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis.	HSCC	2008	DBLP DOI BibTeX RDF
6	Nicolas Caniart, Emmanuel Fleury, Jérôme Leroux, Marc Zeitoun	Accelerating Interpolation-Based Model-Checking.	TACAS	2008	DBLP DOI BibTeX RDF
6	Zhenyu Chen 0001, Zhihong Tao, Baowen Xu, Lifu Wang	Implication-Based Approximating Bounded Model Checking.	FSEN	2007	DBLP DOI BibTeX RDF	Approximation, Abstraction, Bounded Model Checking, Implication
6	Barbara König 0001, Vitali Kozioura	Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems.	TACAS	2006	DBLP DOI BibTeX RDF
6	Ruggero Lanotte, Simone Tini	Taylor Approximation for Hybrid Systems.	HSCC	2005	DBLP DOI BibTeX RDF
5	Sriram Sankaranarayanan 0001, Thao Dang 0001, Franjo Ivancic	A Policy Iteration Technique for Time Elapse over Template Polyhedra.	HSCC	2008	DBLP DOI BibTeX RDF
5	Sriram Sankaranarayanan 0001, Henny B. Sipma, Zohar Manna	Fixed Point Iteration for Computing the Time Elapse Operator.	HSCC	2006	DBLP DOI BibTeX RDF
5	Arnaud Gotlieb, Matthieu Petit	Path-oriented random testing.	Random Testing	2006	DBLP DOI BibTeX RDF	random test data generation, random testing, constraint solving
5	Corneliu Popeea, Wei-Ngan Chin	Dual analysis for proving safety and finding bugs.	SAC	2010	DBLP DOI BibTeX RDF	numerical domains, static analysis
5	Didier Lime, Olivier H. Roux	Formal verification of real-time systems with preemptive scheduling.	Real Time Syst.	2009	DBLP DOI BibTeX RDF	Verification, Formal methods, Petri nets, Preemptive scheduling, Hybrid automata
5	Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine	Monotonic Abstraction in Action.	ICTAC	2008	DBLP DOI BibTeX RDF
5	Daniel Kroening, Natasha Sharygina, Stefano Tonetta, Aliaksei Tsitovich, Christoph M. Wintersteiger	Loop Summarization Using Abstract Transformers.	ATVA	2008	DBLP DOI BibTeX RDF
5	Gianpiero Cabodi, Paolo Camurati, Marco Murciano	Automated abstraction by incremental refinement in interpolant-based model checking.	ICCAD	2008	DBLP DOI BibTeX RDF
5	Barbara König 0001, Vitali Kozioura	Towards the Verification of Attributed Graph Transformation Systems.	ICGT	2008	DBLP DOI BibTeX RDF
5	Daniel Kroening, Natasha Sharygina	Approximating Predicate Images for Bit-Vector Logic.	TACAS	2006	DBLP DOI BibTeX RDF
5	Stefan Ratschan, Zhikun She	Constraints for Continuous Reachability in the Verification of Hybrid Systems.	AISC	2006	DBLP DOI BibTeX RDF
5	Enric Rodríguez-Carbonell, Ashish Tiwari 0001	Generating Polynomial Invariants for Hybrid Systems.	HSCC	2005	DBLP DOI BibTeX RDF
4	Raúl A. Santelices, Mary Jean Harrold	Exploiting program dependencies for scalable multiple-path symbolic execution.	ISSTA	2010	DBLP DOI BibTeX RDF	invariant detection, modular analysis, path family, test suite augmentation, verification, program analysis, test generation, data dependence, symbolic execution, control dependence, change analysis, path sensitive analysis, path condition
4	Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang	Compositional shape analysis by means of bi-abduction.	POPL	2009	DBLP DOI BibTeX RDF	program analysis, abduction, proof theory
4	Nan Guan, Martin Stigge, Wang Yi 0001, Ge Yu 0001	Cache-aware scheduling and analysis for multicores.	EMSOFT	2009	DBLP DOI BibTeX RDF	real-time systems, multicores, schedulability analysis, cache partitioning
4	Matthias Heizmann, Jochen Hoenicke, Andreas Podelski	Refinement of Trace Abstraction.	SAS	2009	DBLP DOI BibTeX RDF
4	Toivo Henningsson	Recursive state estimation for linear systems with mixed stochastic and set-bounded disturbances.	CDC	2008	DBLP DOI BibTeX RDF
4	Pietro Ferrara 0001	Static Analysis Via Abstract Interpretation of the Happens-Before Memory Model.	TAP	2008	DBLP DOI BibTeX RDF	Static Analysis, Abstract Interpretation, Memory Model, Multithreaded Programs
4	Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Frédéric Haziza, Ahmed Rezine	Parameterized Tree Systems.	FORTE	2008	DBLP DOI BibTeX RDF
4	Chao Yan 0001, Mark R. Greenstreet	Verifying an Arbiter Circuit.	FMCAD	2008	DBLP DOI BibTeX RDF
4	Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Ahmed Rezine	Handling Parameterized Systems with Non-atomic Global Conditions.	VMCAI	2008	DBLP DOI BibTeX RDF
4	Pieter Collins	Optimal Semicomputable Approximations to Reachable and Invariant Sets.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
4	Jörg Bauer 0001, Werner Damm, Tobe Toben, Bernd Westphal	Verification and Synthesis of OCL Constraints Via Topology Analysis.	AGTIVE	2007	DBLP DOI BibTeX RDF
4	Daniel Kroening, Natasha Sharygina	Interactive presentation: Image computation and predicate refinement for RTL verilog using word level proofs.	DATE	2007	DBLP DOI BibTeX RDF
4	Jörg Bauer 0001, Tobe Toben, Bernd Westphal	Mind the Shapes: Abstraction Refinement Via Topology Invariants.	ATVA	2007	DBLP DOI BibTeX RDF
4	Parosh Aziz Abdulla, Giorgio Delzanno, Noomene Ben Henda, Ahmed Rezine	Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems).	TACAS	2007	DBLP DOI BibTeX RDF
4	Peter Z. Revesz	The Constraint Database Approach to Software Verification.	VMCAI	2007	DBLP DOI BibTeX RDF
4	Wenhui Zhang	SAT-Based Verification of LTL Formulas.	FMICS/PDMC	2006	DBLP DOI BibTeX RDF
4	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
4	Charles Hymans	Verification of an Error Correcting Code by Abstract Interpretation.	VMCAI	2005	DBLP DOI BibTeX RDF
4	Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman	Completeness and Complexity of Bounded Model Checking.	VMCAI	2004	DBLP DOI BibTeX RDF
4	Olaf Stursberg, Bruce H. Krogh	Efficient Representation and Computation of Reachable Sets for Hybrid Systems.	HSCC	2003	DBLP DOI BibTeX RDF	Hybrid Dynamic Systems, Hyperrectangles, Model Checking, Singular Value Decomposition, Convex Hull, Polyhedra
4	Daniel Kroening, Ofer Strichman	Efficient Computation of Recurrence Diameters.	VMCAI	2003	DBLP DOI BibTeX RDF
4	Stephen Adams 0001, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle, Westley Weimer	Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis.	SAS	2002	DBLP DOI BibTeX RDF
4	Thomas Genet, Valérie Viet Triem Tong	Reachability Analysis of Term Rewriting Systems with Timbuk.	LPAR	2001	DBLP DOI BibTeX RDF
4	Felice Balarin	Correctness of the Concurrent Approach to Symbolic Verification of Interleaved Models.	CAV	1998	DBLP DOI BibTeX RDF