MAGIC
From MaRDI portal
Software:26067
No author found.
Related Items (38)
A complete refinement procedure for regular separability of context-free languages ⋮ Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Efficient verification of sequential and concurrent C programs ⋮ Model Checking Concurrent Programs ⋮ Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous ⋮ On the analysis of interacting pushdown systems ⋮ Unbounded Model-Checking with Interpolation for Regular Language Constraints ⋮ Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving ⋮ The Temporal Logic of Rewriting: A Gentle Introduction ⋮ Concurrent software verification with states, events, and deadlocks ⋮ A model checking-based approach for security policy verification of mobile systems ⋮ A formal model for service-oriented interactions ⋮ SAT-solving in CSP trace refinement ⋮ Counterexample-guided abstraction refinement for symmetric concurrent programs ⋮ Verifying parallel programs with dynamic communication structures ⋮ On the Reachability Analysis of Acyclic Networks of Pushdown Systems ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Verification of Boolean programs with unbounded thread creation ⋮ A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Partial order reduction for state/event LTL with application to component-interaction automata ⋮ Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism ⋮ Verifying Multithreaded Recursive Programs with Integer Variables ⋮ State/Event Software Verification for Branching-Time Specifications ⋮ The Linear Temporal Logic of Rewriting Maude Model Checker ⋮ Finding Concurrency-Related Bugs Using Random Isolation ⋮ Partial Order Reduction for State/Event LTL ⋮ Lost in abstraction: monotonicity in multi-threaded programs ⋮ Interprocedural Analysis of Concurrent Programs Under a Context Bound ⋮ Program Analysis Using Weighted Pushdown Systems ⋮ Tools and Algorithms for the Construction and Analysis of Systems ⋮ Verifying Parallel Programs with Dynamic Communication Structures ⋮ Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs ⋮ Integrated Formal Methods ⋮ Reducing concurrent analysis under a context bound to sequential analysis ⋮ Simulation for lattice-valued doubly labeled transition systems ⋮ Model checking dynamic pushdown networks
This page was built for software: MAGIC
