scientific article; zbMATH DE number 1283472
From MaRDI portal
Publication:4240122
zbMath0924.68026MaRDI QIDQ4240122
Publication date: 3 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theory of programming languages (68N15) General topics in the theory of software (68N01) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)
Related Items (31)
Assume, Guarantee or Repair ⋮ Using abduction and induction for operational requirements elaboration ⋮ Compositional Reasoning ⋮ Dynamic Logic with Binders and Its Application to the Development of Reactive Systems ⋮ Highly dependable concurrent programming using design for verification ⋮ Automated circular assume-guarantee reasoning ⋮ Model-Checking Helena Ensembles with Spin ⋮ Translating FSP into LOTOS and networks of automata ⋮ Automated program repair using formal verification techniques ⋮ Compositional Specification in Rewriting Logic ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Automated Assume-Guarantee Reasoning by Abstraction Refinement ⋮ Active learning of nondeterministic finite state machines ⋮ Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning ⋮ CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes ⋮ Development of global specification for dynamically adaptive software ⋮ Decompositions of graphs based on a new graph product ⋮ FSP and FLTL framework for specification and verification of middle-agents ⋮ Unnamed Item ⋮ Deriving non-zeno behaviour models from goal models using ILP ⋮ Property specifications for workflow modelling ⋮ Architectural concepts and design patterns for behavior modeling and integration ⋮ Teaching Concurrency Concepts to Freshmen ⋮ On the usability of process algebra: An architectural view ⋮ Automated Circular Assume-Guarantee Reasoning ⋮ Implied Scenario Detection in the Presence of Behaviour Constraints ⋮ Testing Concurrent Objects with Application-Specific Schedulers ⋮ A verification-driven framework for iterative design of controllers ⋮ On A Directed Tree Problem Motivated by A Newly Introduced Graph Product ⋮ On-the-fly informed search of non-blocking directed controllers ⋮ Compositional verification of asynchronous concurrent systems using CADP
This page was built for publication:
