MAGIC

swMATH14159MaRDI QIDQ26067FDOQ26067

Author name not available (Why is that?)

Described by source

• An Iterative Framework for Simulation Conformance

Cited In (38)

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

This page was built for software: MAGIC