The following pages link to MAGIC (Q26067):
Displaying 38 items.
- A complete refinement procedure for regular separability of context-free languages (Q264992) (← links)
- A model checking-based approach for security policy verification of mobile systems (Q432137) (← links)
- A formal model for service-oriented interactions (Q436383) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Partial order reduction for state/event LTL with application to component-interaction automata (Q549692) (← links)
- Lost in abstraction: monotonicity in multi-threaded programs (Q729809) (← links)
- Reducing concurrent analysis under a context bound to sequential analysis (Q1039852) (← links)
- Efficient verification of sequential and concurrent C programs (Q1888200) (← links)
- Verifying parallel programs with dynamic communication structures (Q1959654) (← links)
- Simulation for lattice-valued doubly labeled transition systems (Q2353987) (← links)
- Model checking dynamic pushdown networks (Q2355386) (← links)
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
- Concurrent software verification with states, events, and deadlocks (Q2432214) (← links)
- Counterexample-guided abstraction refinement for symmetric concurrent programs (Q2441711) (← links)
- Verification of Boolean programs with unbounded thread creation (Q2464944) (← links)
- Automated compositional abstraction refinement for concurrent C programs: a two-level approach (Q2845499) (← links)
- Parallel assignments in software model checking (Q2852081) (← links)
- Model Checking Concurrent Programs (Q3176376) (← links)
- On the analysis of interacting pushdown systems (Q3189810) (← links)
- Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs (Q3401092) (← links)
- The Temporal Logic of Rewriting: A Gentle Introduction (Q3507374) (← links)
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems (Q3541030) (← links)
- Finding Concurrency-Related Bugs Using Random Isolation (Q3600476) (← links)
- Partial Order Reduction for State/Event LTL (Q3605476) (← links)
- Verifying Parallel Programs with Dynamic Communication Structures (Q3637351) (← links)
- The Linear Temporal Logic of Rewriting Maude Model Checker (Q4933287) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- Revisiting Underapproximate Reachability for Multipushdown Systems (Q5039520) (← links)
- Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous (Q5056000) (← links)
- A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting (Q5166636) (← links)
- Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism (Q5179049) (← links)
- Verifying Multithreaded Recursive Programs with Integer Variables (Q5179057) (← links)
- Unbounded Model-Checking with Interpolation for Regular Language Constraints (Q5326331) (← links)
- State/Event Software Verification for Branching-Time Specifications (Q5429308) (← links)
- Interprocedural Analysis of Concurrent Programs Under a Context Bound (Q5458333) (← links)
- Program Analysis Using Weighted Pushdown Systems (Q5458821) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5899068) (← links)
- Integrated Formal Methods (Q5901610) (← links)
