Testing Concurrent Objects with Application-Specific Schedulers
From MaRDI portal
Publication:5505611
DOI10.1007/978-3-540-85762-4_22zbMath1161.68630OpenAlexW1541559884MaRDI QIDQ5505611
Rudolf Schlatte, Bernhard K. Aichernig, Einar Broch Johnsen, Andreas Griesmayer, Frank S. de Boer
Publication date: 27 January 2009
Published in: Theoretical Aspects of Computing - ICTAC 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85762-4_22
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional rewriting logic as a unified model of concurrency
- Maude: specification and programming in rewriting logic
- Task automata: Schedulability, decidability and undecidability
- Whodunit? Causal Analysis for Counterexamples
- A Theory of Bounded Fair Scheduling
- A Complete Guide to the Future