UNITY

swMATH13461MaRDI QIDQ25375FDOQ25375

Author name not available (Why is that?)

Official website: https://en.wikipedia.org/wiki/UNITY_%28programming_language%29

Described by source

• Simulation model development and analysis in UNITY
• Unnamed Publication

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

• Tiara: a self-stabilizing deterministic skip list and skip graph
• A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
• Credible execution of bounded-time parallel systems with delayed diagnosis
• A framework for automated distributed implementation of component-based models
• Queue based mutual exclusion with linearly bounded overtaking
• Distributed consensus, revisited
• Splitting atoms safely
• Event-based proof of the mutual exclusion property of Peterson's algorithm
• Simulation refinement for concurrency verification
• A queue based mutual exclusion algorithm
• Partial correctness for probabilistic demonic programs
• Generate \& check method for verifying transition systems in CafeOBJ
• Mechanizing a process algebra for network protocols
• Cones and foci: A mechanical framework for protocol verification
• Fixed points of increasing functions
• A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol
• Verification of distributed systems with local-global predicates
• Knowledge-based synthesis of distributed systems using event structures
• Progress properties for empty \textsc{Unity} programs
• A rewriting-based model checker for the linear temporal logic of rewriting
• The chemical abstract machine
• Focus points and convergent process operators: A proof strategy for protocol verification
• Property preserving abstractions for the verification of concurrent systems
• Parallel elementwise processable functions in concurrent clean
• Stabilizing phase-clocks
• A framework for viewing atomic events in distributed computations
• Abstract state machines: a unifying view of models of computation and of system design frameworks
• An incremental specification of the sliding-window protocol
• Phase synchronization
• Safety and liveness from a methodological point of view
• Concurrent maintenance of rings
• A basic algebra of stateless connectors
• D-Finder
• Convergence of iteration systems
• OBJ3
• AgentSpeak
• Reo
• Kumo
• B4Free
• Rodin
• NQTHM
• Starvation-free mutual exclusion with semaphores
• BEHAVE
• fireLib
• Chord
• Linda
• Quartz
• SLAB
• InvA
• RAVEN
• Pastry
• InVeSt
• Polychrony
• LusSy
• Omega
• PEP
• Foundations for using linear temporal logic in Event-B refinement
• Refinement verification of the lazy caching algorithm
• DLC
• Esterel
• LNT2LOTOS
• AADL
• 3APL
• XTL
• mural
• FeatureC++
• CITP
• ABCL
• HOL-UNITY
• AODV
• AWN
• TAME
• Superposition refinement of reactive systems
• Knowledge-based programs
• Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous
• A verification framework for agent programming with declarative goals
• A verifiable low-level concurrent programming model based on colored Petri nets
• Structural transformations for data-enriched real-time systems
• Compositional Verification for Component-Based Systems and Application
• Composite registers
• Probabilistic communicating processes
• Linda-based applicative and imperative process algebras
• Conditional rewriting logic as a unified model of concurrency
• Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs
• A principle for sequential reasoning about distributed algorithms
• Adaptive solutions to the mutual exclusion problem
• Title not available (Why is that?)
• Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions
• Unity properties and sequences of states, some observations
• A simple proof of a completeness result for \(leads\)-\(to\) in the UNITY logic
• Abstract compositional analysis of iterated relations. A structural approach to complex state transition systems
• Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols
• Reasoning about programs by exploiting the environment
• Theories for mechanical proofs of imperative programs
• Alternating states for dual nondeterminism in imperative programming
• Specification and verification of concurrent programs through refinements
• Formal verification of a programming logic for a distributed programming language
• Mechanizing UNITY in Isabelle
• Linearization in parallel pCRL
• DUALITY: A simple formalism for the analysis of UNITY

This page was built for software: UNITY