The following pages link to Franjo Ivančić (Q947792):
Displaying 24 items.
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
- Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (Q2891416) (← links)
- Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems (Q2985883) (← links)
- SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement (Q3522074) (← links)
- Whodunit? Causal Analysis for Counterexamples (Q3522901) (← links)
- A Policy Iteration Technique for Time Elapse over Template Polyhedra (Q3523151) (← links)
- Program Analysis Using Symbolic Ranges (Q3612010) (← links)
- Static Analysis in Disjunctive Numerical Domains (Q3613374) (← links)
- (Q4417540) (← links)
- (Q4417924) (← links)
- (Q4417973) (← links)
- (Q4444409) (← links)
- (Q4552454) (← links)
- (Q4736570) (← links)
- (Q4736572) (← links)
- Efficient Probabilistic Model Checking of Systems with Ranged Probabilities (Q4899147) (← links)
- Program analysis via satisfiability modulo path programs (Q5255063) (← links)
- Hybrid Systems: Computation and Control (Q5307932) (← links)
- Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination (Q5387848) (← links)
- Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra (Q5429329) (← links)
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra (Q5458327) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703774) (← links)
- Computer Aided Verification (Q5716592) (← links)
