The temporal semantics of concurrent programs

From MaRDI portal
Revision as of 04:08, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1143164

DOI10.1016/0304-3975(81)90110-9zbMath0441.68010OpenAlexW1970603830MaRDI QIDQ1143164

Amir Pnueli

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90110-9




Related Items (80)

Non-standard algorithmic and dynamic logicA formalization of programs in first-order logic with a discrete linear orderDoes “N+1 times” prove more programs correct than “N times”?Compositionality of Hennessy-Milner logic by structural operational semanticsChurch's Problem RevisitedA fixpoint theory for non-monotonic parallelismThe complementation problem for Büchi automata with applications to temporal logicAutomata-theoretic techniques for modal logics of programsUltraproducts and possible worlds semantics in institutionsA logic for reasoning about time and reliabilityModel Checking of Biological SystemsMulti-Valued Reasoning about Reactive SystemsConstruction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOLChecking interval properties of computationsFeature interaction detection by pairwise analysis of LTL properties -- A case studyAutomata-driven partial order reduction and guided search for LTL model checkingQuestion-guided stubborn set methods for state propertiesThe power of temporal proofsConcurrent systems and inevitabilityWeak second order characterizations of various program verification systemsA semantics for concurrent separation logicResources, concurrency, and local reasoningReasoning about time in the situation calculusAssumption/guarantee specifications in linear-time temporal logic (extended abstract)Taming strategy logic: non-recurrent fragmentsFuzzy Halpern and Shoham's interval temporal logicsAction and State Based Computation Tree Measurement Language and AlgorithmsA simple rewrite system for the normalization of linear temporal logicReasoning about Quality and Fuzziness of Strategic BehaviorsReasoning About Substructures and GamesModel checking of pushdown systems for projection temporal logicThe language of social softwareUnnamed ItemDistributed breadth-first search LTL model checkingReliability-aware automatic composition approach for web servicesParallel algorithms for the single source shortest path problemUnnamed ItemMathematical modal logic: A view of its evolutionOn the computational complexity of behavioral description-based web service compositionAppraising two decades of distributed computing theory researchSpecification of communicating processes: temporal logic versus refusals-based refinementBounded semanticsCompositionality and bisimulation: A negative resultAssumption/guarantee specifications in linear-time temporal logicOn relative and probabilistic finite counterabilityEmbedding finite automata within regular expressionsUnnamed ItemSafety and Liveness, Weakness and Strength, and the Underlying Topological RelationsQuery-based verification of qualitative trends and oscillations in biochemical systemsAlternative semantics for temporal logicsA modular approach to defining and characterising notions of simulationTest generation from P systems using model checkingVerification of concurrent programs: The automata-theoretic frameworkTemporal logic programming‘What I Fail to Do Today, I Have to Do Tomorrow’: A Logical Study of the Propagation of ObligationsModel checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchyConverting a Büchi alternating automaton to a usual nondeterministic oneModel Checking LTL Formulae in RAISE with FDRPrime languagesComputation tree measurement language (CTML)Branching-Time Temporal Logics with Minimal Model QuantifiersExtended Stochastic Petri Nets for Model-Based Design of Wetlab ExperimentsDecision Procedures for a Deontic Logic Modeling Temporal Inheritance of ObligationsGame-theoretic simulation checking toolIs ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?Deductive verification of simple foraging robotic behavioursCalculi for synchrony and asynchronyThe temporal logic of branching timeModel-Based Testing for Functional and Security Test GenerationAn approach to automating the verification of compact parallel coordination programs. ITen years of Hoare's logic: A survey. II: NondeterminismA generalized nexttime operator in temporal logicSyntax-directed model checking of sequential programsSynthesis in presence of dynamic linksCompositional verification of asynchronous concurrent systems using CADPInductive and Coinductive Components of Corecursive Functions in CoqTimed network gamesGood-for-Game QPTL: An Alternating Hodges SemanticsChecking timed Büchi automata emptiness efficientlyBack to the future: a fresh look at linear temporal logic



Cites Work




This page was built for publication: The temporal semantics of concurrent programs