Context-Bounded Analysis of Concurrent Queue Systems
From MaRDI portal
Publication:5458334
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- Analysis of a class of communicating finite state machines
- Complexity results for 1-safe nets
- Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Interprocedural analysis of asynchronous programs
- Model Checking Multithreaded Programs with Asynchronous Atomic Methods
- Tools and Algorithms for the Construction and Analysis of Systems
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
- Verification in loosely synchronous queue-connected discrete timed automata.
Cited in
(45)- Context-bounded analysis of TSO systems
- Bounded context switching for valence systems
- Synchronizability for Verification of Asynchronously Communicating Systems
- Reachability of scope-bounded multistack pushdown systems
- Round- and context-bounded control of dynamic pushdown systems
- Guessing the buffer bound for k-synchronizability
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems
- scientific article; zbMATH DE number 7471708 (Why is no real title available?)
- On the k-synchronizability of systems
- The decidability of verification under PS 2.0
- Realizability of Concurrent Recursive Programs
- Extending the Service Domain of an Interactive Bounded Queue
- A Sound Algorithm for Asynchronous Session Subtyping
- Bounded phase analysis of message-passing programs
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
- Deciding branching time properties for asynchronous programs
- Games on Higher Order Multi-stack Pushdown Systems
- Compatibility properties of synchronously and asynchronously communicating components
- Parameterized Verification of Communicating Automata under Context Bounds
- Guessing the Buffer Bound for k-Synchronizability
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- Weakly synchronous systems with three machines are Turing powerful
- Multiparty half-duplex systems and synchronous communications
- Games on Multi-stack Pushdown Systems
- An Infinite Automaton Characterization of Double Exponential Time
- On deciding synchronizability for asynchronously communicating systems
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- Concurrent expandable AMQs on the basis of quotient filters
- Towards generalised half-duplex systems
- The complexity of model checking multi-stack systems
- Comparing channel restrictions of communicating state machines, high-level message sequence charts, and multiparty session types
- Verification of well-formed communicating recursive state machines
- Verifying parallel programs with dynamic communication structures
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Data flow analysis of asynchronous systems using infinite abstract domains
- Realizability of concurrent recursive programs
- scientific article; zbMATH DE number 1773081 (Why is no real title available?)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
- Complete multiparty session type projection with automata
- On the path-width of integer linear programming
- The language theory of bounded context-switching
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Reachability analysis of communicating pushdown systems
- Reachability analysis of communicating pushdown systems
- scientific article; zbMATH DE number 7327953 (Why is no real title available?)
This page was built for publication: Context-Bounded Analysis of Concurrent Queue Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458334)
