The following pages link to Bebop (Q20924):
Displaying 40 items.
- A model checking-based approach for security policy verification of mobile systems (Q432137) (← links)
- SMT-based model checking for recursive programs (Q518396) (← links)
- A saturation method for the modal \(\mu \)-calculus over pushdown systems (Q532393) (← links)
- Context-aware counter abstraction (Q600978) (← links)
- Application of static analyses for state-space reduction to the microcontroller binary code (Q617924) (← links)
- Bisimulation conversion and verification procedure for goal-based control systems (Q633304) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- Verifying time partitioning in the DEOS scheduling kernel (Q816194) (← links)
- Translating Java for multiple model checkers: The Bandera back-end (Q816196) (← links)
- Model-checking structured context-free languages (Q832277) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- An abstract interpretation toolkit for \(\mu\)CRL (Q883139) (← links)
- Hybrid automata-based CEGAR for rectangular hybrid systems (Q888464) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Verification of scope-dependent hierarchical state machines (Q948087) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- CPBPV: a constraint-programming framework for bounded program verification (Q968353) (← links)
- Types and trace effects for object orientation (Q1029806) (← links)
- Reducing concurrent analysis under a context bound to sequential analysis (Q1039852) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Analyzing pushdown systems with stack manipulation (Q1706143) (← links)
- CONCUR 2004 -- concurrency theory. 15th international conference, London, UK, August 31 -- September 3, 2004. Proceedings. (Q1769770) (← links)
- Syntax-directed model checking of sequential programs (Q1858441) (← links)
- Model checking LTL with regular valuations for pushdown systems (Q1887158) (← links)
- Modular strategies for recursive game graphs (Q2368953) (← links)
- Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
- Visibly rational expressions (Q2453980) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Verification of Boolean programs with unbounded thread creation (Q2464944) (← links)
- Program verification with interacting analysis plugins (Q2642983) (← links)
- (Q2753756) (← links)
- (Q2769592) (← links)
- Parameterised Pushdown Systems with Non-Atomic Writes (Q2911646) (← links)
- Hybrid Automata-Based CEGAR for Rectangular Hybrid Systems (Q2926638) (← links)
- Faster Algorithms for Weighted Recursive State Machines (Q2988644) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Interpolation and Model Checking (Q3176372) (← links)
- Predicate Abstraction for Program Verification (Q3176373) (← links)
- Model Checking Procedural Programs (Q3176375) (← links)
- Winning Regions of Pushdown Parity Games: A Saturation Method (Q3184687) (← links)
