Pages that link to "Item:Q4095835"
From MaRDI portal
The following pages link to Formal verification of parallel programs (Q4095835):
Displaying 50 items.
- A characterization of finitary bisimulation (Q287256) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- A cylinder computation model for many-core parallel computing (Q391222) (← links)
- Achieving distributed control through model checking (Q453529) (← links)
- A dynamic logic for deductive verification of multi-threaded programs (Q470007) (← links)
- Rough approximations based on bisimulations (Q505252) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Models for concurrency: Towards a classification (Q672053) (← links)
- Composing model programs for analysis (Q710670) (← links)
- Eliminating the substitution axiom from UNITY logic (Q751848) (← links)
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- Comparative semantics for flow of control in logic programming without logic (Q805247) (← links)
- Specification and analysis of a data transfer protocol using systems of communicating machines (Q808228) (← links)
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces (Q831141) (← links)
- Mathematical programming approach to the Petri nets reachability problem (Q856211) (← links)
- Compositional semantics and behavioral equivalences for P systems (Q924685) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Compositional semantics of spiking neural P systems (Q987958) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs (Q1071491) (← links)
- Bisimulations and abstraction homomorphisms (Q1089791) (← links)
- Trace, failure and testing equivalences for communicating processes (Q1104076) (← links)
- Deadlock and fairness in morphisms of transition systems (Q1105379) (← links)
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency (Q1107303) (← links)
- A linear algorithm to solve fixed-point equations on transition systems (Q1115196) (← links)
- Bisimulation and effectiveness (Q1118393) (← links)
- Concurrent transition systems (Q1119395) (← links)
- Terminal metric spaces of finitely branching and image finite linear processes (Q1128985) (← links)
- The temporal semantics of concurrent programs (Q1143164) (← links)
- A characterization of systems derived from terminating concurrent histories (Q1143805) (← links)
- Methods and means of parallel processing of information (Q1155954) (← links)
- A unified approach for studying the properties of transition systems (Q1161289) (← links)
- Parallel algorithms for the single source shortest path problem (Q1162156) (← links)
- Reduction and covering of infinite reachability trees (Q1173681) (← links)
- Minimizing the number of transitions with respect to observation equivalence (Q1182610) (← links)
- An agent calculus with simple actions where the enabling and disabling are derived operators (Q1183473) (← links)
- Fairness, distances and degrees (Q1193862) (← links)
- Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
- An algebraic semantics for structured transition systems and its application to logic programs (Q1199528) (← links)
- Deciding bisimilarity is P-complete (Q1203120) (← links)
- On reduction of asynchronous systems (Q1241274) (← links)
- Functional behavior in data spaces (Q1244988) (← links)
- Formal derivation of strongly correct concurrent programs (Q1251066) (← links)
- Analysis of Petri nets by stepwise refinements (Q1255320) (← links)
- A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
- GSOS and finite labelled transition systems (Q1331924) (← links)
- An equational axiomatization for multi-exit iteration (Q1369097) (← links)
- A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
- Verification of reactive systems using temporal logic with clocks (Q1575841) (← links)
