Cited in
(only showing first 100 items - show all)- Specification-oriented semantics for communicating processes
- Sometime = always + recursion always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
- Bisimulations and abstraction homomorphisms
- Trace, failure and testing equivalences for communicating processes
- Deadlock and fairness in morphisms of transition systems
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- A linear algorithm to solve fixed-point equations on transition systems
- Bisimulation and effectiveness
- Concurrent transition systems
- Terminal metric spaces of finitely branching and image finite linear processes
- The temporal semantics of concurrent programs
- A characterization of systems derived from terminating concurrent histories
- Methods and means of parallel processing of information
- A unified approach for studying the properties of transition systems
- Parallel algorithms for the single source shortest path problem
- Reduction and covering of infinite reachability trees
- Minimizing the number of transitions with respect to observation equivalence
- An agent calculus with simple actions where the enabling and disabling are derived operators
- Fairness, distances and degrees
- Structured operational semantics and bisimulation as a congruence
- An algebraic semantics for structured transition systems and its application to logic programs
- Deciding bisimilarity is P-complete
- On reduction of asynchronous systems
- Functional behavior in data spaces
- Formal derivation of strongly correct concurrent programs
- Analysis of Petri nets by stepwise refinements
- A complete equational axiomatization for MPA with string iteration
- GSOS and finite labelled transition systems
- An equational axiomatization for multi-exit iteration
- A methodology for designing proof rules for fair parallel programs
- Verification of reactive systems using temporal logic with clocks
- Universal coalgebra: A theory of systems
- Verification, refinement and scheduling of real-time programs
- Additive models of probabilistic processes
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Identification of biological transition systems using meta-interpreted logic programs
- A deductive approach towards reasoning about algebraic transition systems
- SOS specifications for uniformly continuous operators
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
- Reasoning about graded strategy quantifiers
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- CCS with Hennessy's merge has no finite-equational axiomatization
- Homomorphisms between models of parallel computation
- The origins of structural operational semantics
- Rule formats for compositional non-interference properties
- Invariants, composition, and substitution
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- Probabilistic divide \& congruence: branching bisimilarity
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
- On the axiomatisability of priority. III: Priority strikes again
- Team bisimilarity, and its associated modal logic, for BPP nets
- Towards general axiomatizations for bisimilarity and trace semantics
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- Determinizing monitors for HML with recursion
- A verification-driven framework for iterative design of controllers
- An application of temporal projection to interleaving concurrency
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
- When are prime formulae characteristic?
- Automated synthesis of application-layer connectors from automata-based specifications
- Determining asynchronous test equivalence for probabilistic processes
- Cooperative concurrent games
- Characteristic formulae for timed autoamta
- Automated synthesis of application-layer connectors from automata-based specifications
- Group-by-group probabilistic bisimilarities and their logical characterizations
- A characterization of finitary bisimulation
- Characteristic formulae for fixed-point semantics: a general framework
- When are prime formulae characteristic?
- Reasoning about strategies: on the model-checking problem
- Reasoning About Substructures and Games
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Trace and testing metrics on nondeterministic probabilistic processes
- SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
- From Philosophical to Industrial Logics
- Composition of Model Programs
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- On the design and specification of message oriented programs
- Current methods for proving program correctness
- A cylinder computation model for many-core parallel computing
- A new methodology for analyzing distributed systems modeled by petri nets
- Achieving distributed control through model checking
- A dynamic logic for deductive verification of multi-threaded programs
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
- scientific article; zbMATH DE number 7471704 (Why is no real title available?)
- Verification and comparison of transition systems
- Rough approximations based on bisimulations
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
- scientific article; zbMATH DE number 7559474 (Why is no real title available?)
- Interleaving vs True Concurrency: Some Instructive Security Examples
- Compositional weak metrics for group key update
- What good are digital clocks?
- New results on computability of recurrence equations
- Mitigating covert channels based on analysis of the potential for communication
- From Monadic Logic to PSL
- Livelocks in parallel programs
- A fully abstract denotational model for observational precongruence
- A coalgebraic presentation of structured transition systems
This page was built for publication: Formal verification of parallel programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4095835)
