Context-Bounded Analysis of Concurrent Queue Systems
DOI10.1007/978-3-540-78800-3_21zbMATH Open1134.68446OpenAlexW1842117537MaRDI QIDQ5458334FDOQ5458334
Authors: Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato 
Publication date: 11 April 2008
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78800-3_21
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Verification in loosely synchronous queue-connected discrete timed automata.
- Model Checking Multithreaded Programs with Asynchronous Atomic Methods
- Complexity results for 1-safe nets
- Interprocedural analysis of asynchronous programs
- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
- Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
- Analysis of a class of communicating finite state machines
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
Cited In (45)
- 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
- Title not available (Why is that?)
- On the \(k\)-synchronizability of systems
- Extending the Service Domain of an Interactive Bounded Queue
- Realizability of Concurrent Recursive Programs
- The decidability of verification under PS 2.0
- A Sound Algorithm for Asynchronous Session Subtyping
- Bounded phase analysis of message-passing programs
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
- Games on Higher Order Multi-stack Pushdown Systems
- Deciding branching time properties for asynchronous programs
- Compatibility properties of synchronously and asynchronously communicating components
- Parameterized Verification of Communicating Automata under Context Bounds
- Guessing the Buffer Bound for k-Synchronizability
- Weakly synchronous systems with three machines are Turing powerful
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- Games on Multi-stack Pushdown Systems
- Multiparty half-duplex systems and synchronous communications
- 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
- Comparing channel restrictions of communicating state machines, high-level message sequence charts, and multiparty session types
- The complexity of model checking multi-stack systems
- Verification of well-formed communicating recursive state machines
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Verifying parallel programs with dynamic communication structures
- Data flow analysis of asynchronous systems using infinite abstract domains
- Title not available (Why is that?)
- Realizability of concurrent recursive programs
- Complete multiparty session type projection with automata
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
- On the path-width of integer linear programming
- The language theory of bounded context-switching
- Reachability analysis of communicating pushdown systems
- Reachability analysis of communicating pushdown systems
- Title not available (Why is that?)
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Context-bounded analysis of TSO systems
- Bounded context switching for valence systems
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)
