Pages that link to "Item:Q3664404"
From MaRDI portal
The following pages link to Specifying Concurrent Program Modules (Q3664404):
Displaying 38 items.
- Stutter-invariant temporal properties are expressible without the next-time operator (Q290250) (← links)
- Modular verification of multithreaded programs (Q557795) (← links)
- Temporal logic programming (Q582280) (← links)
- On using temporal logic for refinement and compositional verification of concurrent systems (Q674008) (← links)
- A logical view of composition (Q685416) (← links)
- Encapsulating deontic and branching time specifications (Q714879) (← links)
- The existence of refinement mappings (Q805251) (← links)
- A\(^ 2\)CCS: Atomic actions for CCS (Q912608) (← links)
- Verifying atomic data types (Q914403) (← links)
- Algebraic specification of concurrent systems (Q914405) (← links)
- Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems (Q916414) (← links)
- Proving entailment between conceptual state specifications (Q1095649) (← links)
- On verifying that a concurrent program satisfies a nondeterministic specification (Q1123589) (← links)
- Programming in metric temporal logic (Q1128978) (← links)
- Proving correctness with respect to nondeterministic safety specifications (Q1182117) (← links)
- Temporal theories as modularisation units for concurrent system specification (Q1192604) (← links)
- Using mappings to prove timing properties (Q1200918) (← links)
- Eliminating disjunctions of leads-to properties (Q1318740) (← links)
- Program composition via unification (Q1331925) (← links)
- A temporal logic-based approach for the description of object behavior evolution (Q1353949) (← links)
- Specification of abstract dynamic-data types: A temporal logic approach (Q1391733) (← links)
- Order-sorted model theory for temporal executable specifications (Q1391744) (← links)
- Verification of reactive systems using temporal logic with clocks (Q1575841) (← links)
- Time and logic: A calculus of binary events (Q1805011) (← links)
- Public data structures: counters as a special case. (Q1853535) (← links)
- Semantics of temporal classes (Q1854386) (← links)
- Compositionality in dataflow synchronous languages: Specification and distributed code generation (Q1854388) (← links)
- Fair simulation (Q1854506) (← links)
- An optimistic approach to lock-free FIFO queues (Q1954254) (← links)
- Semantic specification and verification of data flow diagrams (Q2277862) (← links)
- Capacitated automata and systems (Q2280332) (← links)
- Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach (Q3434609) (← links)
- Quantitative Analysis under Fairness Constraints (Q3648696) (← links)
- Control problems in a temporal logic framework (Q3745691) (← links)
- Search strategies for resolution in temporal logics (Q4647556) (← links)
- Design and analysis of dynamic leader election protocols in broadcast networks (Q5137017) (← links)
- Action systems in incremental and aspect-oriented modeling (Q5138491) (← links)
- Safety assurance via on-line monitoring (Q5138497) (← links)
