scientific article; zbMATH DE number 1670774

zbMATH Open0974.68127MaRDI QIDQ2754080FDOQ2754080

Kedar S. Namjoshi, Richard Trefler

Publication date: 11 November 2001

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (17)

• Completion Is an Instance of Abstract Canonical System Inference
• Automated compositional proofs for real-time systems
• Learning Meets Verification
• Automatic symbolic compositional verification by learning assumptions
• Automatic Synthesis of Assumptions for Compositional Model Checking
• On conceptual completeness of syntactic-semantical systems
• Compositional Reasoning about Shared Futures
• Tool support for learning Büchi automata and linear temporal logic
• Automated circular assume-guarantee reasoning
• Compositional models for credal sets
• Assume, Guarantee or Repair
• Automated Circular Assume-Guarantee Reasoning
• Title not available (Why is that?)
• Automated program repair using formal verification techniques
• Completeness for ancestral logic via a computationally-meaningful semantics
• Theory and methodology of assumption/commitment based system interface specification and architectural contracts
• Observational Completeness on Abstract Interpretation

Uses Software

• CESAR

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 Q2754080)