Bebop

swMATH8928MaRDI QIDQ20924

No author found.

Related Items (70)

Model-checking structured context-free languages ⋮ Modular strategies for recursive game graphs ⋮ Counterexample-guided predicate abstraction of hybrid systems ⋮ Model checking LTL with regular valuations for pushdown systems ⋮ SAT-Based Model Checking ⋮ Interpolation and Model Checking ⋮ Predicate Abstraction for Program Verification ⋮ Model Checking Procedural Programs ⋮ Summarization for termination: No return! ⋮ Winning Regions of Pushdown Parity Games: A Saturation Method ⋮ Verification: Theory and Practice ⋮ Unnamed Item ⋮ Tools and Algorithms for the Construction and Analysis of Systems ⋮ Program verification with interacting analysis plugins ⋮ Model Checking Software ⋮ Unnamed Item ⋮ Hybrid Automata-Based CEGAR for Rectangular Hybrid Systems ⋮ Computer Aided Verification ⋮ Context-aware counter abstraction ⋮ Unnamed Item ⋮ An abstract interpretation toolkit for \(\mu\)CRL ⋮ Hybrid automata-based CEGAR for rectangular hybrid systems ⋮ Unnamed Item ⋮ Application of static analyses for state-space reduction to the microcontroller binary code ⋮ Pushdown timed automata: A binary reachability characterization and safety verification. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bisimulation conversion and verification procedure for goal-based control systems ⋮ A model checking-based approach for security policy verification of mobile systems ⋮ Analyzing pushdown systems with stack manipulation ⋮ Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages ⋮ Faster Algorithms for Weighted Recursive State Machines ⋮ Model Checking Recursive Programs with Exact Predicate Abstraction ⋮ An Infinite Automaton Characterization of Double Exponential Time ⋮ Programming Languages and Systems ⋮ Visibly rational expressions ⋮ The word problem for visibly pushdown languages described by grammars ⋮ Verification of Boolean programs with unbounded thread creation ⋮ Efficient SAT-based bounded model checking for software verification ⋮ Verification of scope-dependent hierarchical state machines ⋮ Visibly linear temporal logic ⋮ SMT-based model checking for recursive programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A saturation method for the modal \(\mu \)-calculus over pushdown systems ⋮ Visibly pushdown languages ⋮ Verification and falsification of programs with loops using predicate abstraction ⋮ CPBPV: a constraint-programming framework for bounded program verification ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ CONCUR 2004 -- concurrency theory. 15th international conference, London, UK, August 31 -- September 3, 2004. Proceedings. ⋮ An Abort-Aware Model of Transactional Programming ⋮ Unnamed Item ⋮ Types and trace effects of higher order programs ⋮ On-the-Fly Techniques for Game-Based Software Model Checking ⋮ Interprocedural Analysis of Concurrent Programs Under a Context Bound ⋮ First-Order and Temporal Logics for Nested Words ⋮ Verification, Model Checking, and Abstract Interpretation ⋮ Hybrid Systems: Computation and Control ⋮ Types and trace effects for object orientation ⋮ Verification, Model Checking, and Abstract Interpretation ⋮ Reducing concurrent analysis under a context bound to sequential analysis ⋮ Tools and Algorithms for the Construction and Analysis of Systems ⋮ Tools and Algorithms for the Construction and Analysis of Systems ⋮ Programming Languages and Systems ⋮ Compositional may-must program analysis ⋮ Parameterised Pushdown Systems with Non-Atomic Writes ⋮ Syntax-directed model checking of sequential programs ⋮ Verifying time partitioning in the DEOS scheduling kernel ⋮ Translating Java for multiple model checkers: The Bandera back-end

This page was built for software: Bebop