The temporal semantics of concurrent programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3469994 (Why is no real title available?)
- scientific article; zbMATH DE number 3566126 (Why is no real title available?)
- scientific article; zbMATH DE number 3229502 (Why is no real title available?)
- scientific article; zbMATH DE number 3271460 (Why is no real title available?)
- scientific article; zbMATH DE number 3351182 (Why is no real title available?)
- A comparison of two synchronizing concepts
- A hard act to follow
- A proof method for cyclic programs
- An algebraic study of Diodorean modal systems
- An axiomatic proof technique for parallel programs
- Formal verification of parallel programs
- LAR: A logic of algorithmic reasoning
- Modal Logics Between S 4 and S 5
- Properties of Programs and the First-Order Predicate Calculus
- Proving assertions about parallel programs
- Proving the Correctness of Multiprocess Programs
- Verifying properties of parallel programs
Cited in
(91)- A dynamic temporal logic for quality of service in choreographic models
- Syntax-directed model checking of sequential programs
- Monotonicity characterizations of regular languages
- Fuzzy Halpern and Shoham's interval temporal logics
- Distributed breadth-first search LTL model checking
- Temporal logic programming
- Synthesis in presence of dynamic links
- Model checking of pushdown systems for projection temporal logic
- scientific article; zbMATH DE number 3898203 (Why is no real title available?)
- Timed network games with clocks
- Automated temporal reasoning about reactive systems
- Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations
- Efficient normalization of linear temporal logic
- Timed network games
- A formalization of programs in first-order logic with a discrete linear order
- Assumption/guarantee specifications in linear-time temporal logic
- A semantics for concurrent separation logic
- A simple rewrite system for the normalization of linear temporal logic
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
- On relative and probabilistic finite counterability
- Test generation from P systems using model checking
- Model Checking LTL Formulae in RAISE with FDR
- Church's Problem Revisited
- Concurrent systems and inevitability
- Feature interaction detection by pairwise analysis of LTL properties -- A case study
- Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?
- Calculi for synchrony and asynchrony
- Modular model checking
- Prime languages
- Back to the future: a fresh look at linear temporal logic
- Good-for-Game QPTL: An Alternating Hodges Semantics
- Resources, concurrency, and local reasoning
- (Heterogeneous) structured specifications in logics without interpolation
- Reliability-aware automatic composition approach for web services
- Verification of concurrent programs: The automata-theoretic framework
- A logic for reasoning about time and reliability
- The temporal logic of branching time
- A dynamic temporal logic for quality of service in choreographic models
- Non-standard algorithmic and dynamic logic
- An approach to automating the verification of compact parallel coordination programs. I
- The power of temporal proofs
- Reasoning about time in the situation calculus
- Checking timed Büchi automata emptiness efficiently
- Parallel algorithms for the single source shortest path problem
- Action and State Based Computation Tree Measurement Language and Algorithms
- A fixpoint theory for non-monotonic parallelism
- Model checking of biological systems
- Checking interval properties of computations
- Automata-driven partial order reduction and guided search for LTL model checking
- Ten years of Hoare's logic: A survey. II: Nondeterminism
- Question-guided stubborn set methods for state properties
- Mathematical modal logic: A view of its evolution
- A modular approach to defining and characterising notions of simulation
- Taming strategy logic: non-recurrent fragments
- Synthesis with privacy against an observer
- The language of social software
- Game-theoretic simulation checking tool
- Assumption/guarantee specifications in linear-time temporal logic (extended abstract)
- Compositionality of Hennessy-Milner logic by structural operational semantics
- Branching-Time Temporal Logics with Minimal Model Quantifiers
- Computation tree measurement language (CTML)
- Decision procedures for a deontic logic modeling temporal inheritance of obligations
- Does “N+1 times” prove more programs correct than “N times”?
- Inductive and coinductive components of corecursive functions in Coq
- Bounded semantics
- Compositional verification of asynchronous concurrent systems using CADP
- Compositionality and bisimulation: A negative result
- Specification of communicating processes: temporal logic versus refusals-based refinement
- Reasoning about Quality and Fuzziness of Strategic Behaviors
- Reasoning About Substructures and Games
- Alternative semantics for temporal logics
- The complexity of LTL rational synthesis
- scientific article; zbMATH DE number 7455739 (Why is no real title available?)
- Synthesis with privacy against an observer
- Converting a Büchi alternating automaton to a usual nondeterministic one
- Appraising two decades of distributed computing theory research
- On the computational complexity of behavioral description-based web service composition
- Deductive verification of simple foraging robotic behaviours
- Automata-theoretic techniques for modal logics of programs
- Model-Based Testing for Functional and Security Test Generation
- A generalized nexttime operator in temporal logic
- Ultraproducts and possible worlds semantics in institutions
- Embedding finite automata within regular expressions
- Extended Stochastic Petri Nets for Model-Based Design of Wetlab Experiments
- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL
- Query-based verification of qualitative trends and oscillations in biochemical systems
- The complexity of LTL rational synthesis
- The complementation problem for Büchi automata with applications to temporal logic
- ‘What I Fail to Do Today, I Have to Do Tomorrow’: A Logical Study of the Propagation of Obligations
- Multi-Valued Reasoning about Reactive Systems
- Weak second order characterizations of various program verification systems
This page was built for publication: The temporal semantics of concurrent programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143164)
