scientific article; zbMATH DE number 1283472
From MaRDI portal
Publication:4240122
Recommendations
- scientific article; zbMATH DE number 1670511
- scientific article; zbMATH DE number 1617335
- scientific article; zbMATH DE number 176124
- scientific article; zbMATH DE number 1314563
- Model checking of concurrent algorithms: from Java to C
- Models for concurrency: Towards a classification
- scientific article; zbMATH DE number 17833
- A structured approach for developing concurrent programs in Java
- Introducing concurrency in sequential Java via laws
Cited in
(34)- Equivalence checking 40 years after: a review of bisimulation tools
- On the usability of process algebra: An architectural view
- Deriving non-Zeno behaviour models from goal models using ILP
- Assume, guarantee or repair
- Architectural concepts and design patterns for behavior modeling and integration
- Dynamic logic with binders and its application to the development of reactive systems
- A verification-driven framework for iterative design of controllers
- On a directed tree problem motivated by a newly introduced graph product
- CADP 2010: a toolbox for the construction and analysis of distributed processes
- Using abduction and induction for operational requirements elaboration
- Property specifications for workflow modelling
- Understanding concurrent systems
- scientific article; zbMATH DE number 2087132 (Why is no real title available?)
- Implied scenario detection in the presence of behaviour constraints
- FSP and FLTL framework for specification and verification of middle-agents
- Teaching Concurrency Concepts to Freshmen
- Translating FSP into LOTOS and networks of automata
- Highly dependable concurrent programming using design for verification
- Model-Checking Helena Ensembles with Spin
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Communicating Sequential Processes. The First 25 Years
- Automated circular assume-guarantee reasoning
- Compositional specification in rewriting logic
- Automated program repair using formal verification techniques
- On-the-fly informed search of non-blocking directed controllers
- Compositional verification of asynchronous concurrent systems using CADP
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Decompositions of graphs based on a new graph product
- Concurrency and refinement in the unified modeling language
- Development of global specification for dynamically adaptive software
- Testing Concurrent Objects with Application-Specific Schedulers
- Compositional reasoning
- Active learning of nondeterministic finite state machines
- Automated circular assume-guarantee reasoning
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240122)
