SPIN

swMATH3455MaRDI QIDQ15987FDOQ15987

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Models and formal verification of multiprocessor system-on-chips
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Model checking dynamic memory allocation in operating systems
• Verifying a signature architecture: a comparative case study
• Title not available (Why is that?)
• Action language verifier: An infinite-state model checker for reactive software specifications
• Beyond contracts for concurrency
• Symmetry and partial order reduction techniques in model checking Rebeca
• Summarization for termination: No return!
• Type inference and strong static type checking for Promela
• Optimistic synchronization-based state-space reduction
• Verifying distributed real-time properties of embedded systems via graph transformations and model checking
• Model Checking Quantified Computation Tree Logic
• Temporal Verification of Fault-Tolerant Protocols
• A note on stutter-invariant PLTL
• Tableau-based automata construction for dynamic linear time temporal logic
• CONCUR 2004 - Concurrency Theory
• Refinement and verification in component-based model-driven design
• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient partial order reduction algorithm with an alternative proviso implementation
• Designing communicating transaction processes by supervisory control theory
• Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
• From NuSMV to SPIN: Experiences with model checking flight guidance systems
• Model-Checking Iterated Games
• Search algorithms for automated validation
• On the unusual effectiveness of logic in computer science
• Dynamic analysis of Petri net-based discrete systems
• Hybrid automata-based CEGAR for rectangular hybrid systems
• A canonical form based decision procedure and model checking approach for propositional projection temporal logic
• A complete axiom system for propositional projection temporal logic with cylinder computation model
• Synthesizing distributed protocol specifications from a UML state machine modeled service specification
• Model checking the observational determinism security property using PROMELA and SPIN
• Synchronizing relations on words
• The verified software repository: a step towards the verifying compiler
• Highly-fair bakery algorithm using symmetric tokens
• Formal Approaches to Software Testing
• Computer Aided Verification
• Title not available (Why is that?)
• Random walk based heuristic algorithms for distributed memory model checking
• CTL Model-Checking with Graded Quantifiers
• Tools and Algorithms for the Construction and Analysis of Systems
• Title not available (Why is that?)
• Bounded model checking of traffic light control system
• Principles of Distributed Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Timed hyperproperties
• An Event-B based approach for cloud composite services verification
• Efficient SAT-based bounded model checking for software verification
• Star-Topology Decoupling in SPIN
• Formal verification of an executable LTL model checker with partial order reduction
• Visibly linear temporal logic
• Title not available (Why is that?)
• Model-checking structured context-free languages
• Model checking \(\omega \)-regular properties with decoupled search
• Integrating Owicki-Gries for C11-style memory models into Isabelle/HOL
• Comparison of algorithms for checking emptiness on Büchi automata
• Model checking of linear-time properties in multi-valued systems
• Inferring Synchronization under Limited Observability
• Designing the automatic transformation of visual languages
• Title not available (Why is that?)
• Extended dependency graphs and efficient distributed fixed-point computation
• Linear reachability problems and minimal solutions to linear Diophantine equation systems
• Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
• Concurrency and refinement in the unified modeling language
• A CTL* Model Checker for Petri Nets
• Abstract reduction in directed model checking CCS processes
• Specifying and verifying interaction protocols in a temporal action logic
• Star-topology decoupled state space search
• Feature interaction detection by pairwise analysis of LTL properties -- A case study
• Model Checking Software
• Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
• Backward Trace Slicing for Rewriting Logic Theories
• Directed algebraic topology and concurrency. With a foreword by Maurice Herlihy and a preface by Samuel Mimram
• Automata Theory and Model Checking
• Optimising the ProB model checker for B using partial order reduction
• A formal semantics of extended hierarchical state transition matrices using CSP\#
• Assisting the design of a groupware system - Model checking usability aspects of thinkteam
• Verifying chemical reaction network implementations: a pathway decomposition approach
• Invariant-driven specifications in Maude
• Visibly rational expressions
• Multi-Agent Programming
• Title not available (Why is that?)
• A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
• Testing Distributed Systems Through Symbolic Model Checking
• Verification and falsification of programs with loops using predicate abstraction
• Model Checking Procedural Programs
• Predicate Abstraction for Program Verification
• Game-theoretic simulation checking tool
• Nonatomic dual bakery algorithm with bounded tokens
• Verification by augmented abstraction: The automata-theoretic view
• An abstract interpretation toolkit for \(\mu\)CRL
• Title not available (Why is that?)

This page was built for software: SPIN