On the public citation graph
The temporal semantics of concurrent programs
0 signed · 135 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19590051405openalex-snapshot
Modal Logics Between S 4 and S 5
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_6openalex-snapshot
Towards a Theory of Parallel Programming
inferredcites →https://doi.org/10.1007/bf00264469openalex-snapshot
LAR: A logic of algorithmic reasoning
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf00288684openalex-snapshot
A comparison of two synchronizing concepts
inferredcites →https://doi.org/10.1007/bf00289074openalex-snapshot
A proof method for cyclic programs
inferredcites →https://doi.org/10.1016/s0022-0000(75)80018-3openalex-snapshot
Proving assertions about parallel programs
inferredcites →https://doi.org/10.1093/acprof:oso/9780198243113.001.0001openalex-snapshot
Past, Present and Future
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/321510.321516openalex-snapshot
Properties of Programs and the First-Order Predicate Calculus
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/512760.512782openalex-snapshot
Nondeterminism in logics of programs
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.2307/2270582openalex-snapshot
An algebraic study of Diodorean modal systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119716600.ch8openalex-snapshot
Hybrid Automata in Systems Biology
inferred← citeshttps://doi.org/10.1002/malq.19820281302openalex-snapshot
Eine Logik Erster Stufe mit Einem Infinitären Zeitoperator
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_10openalex-snapshot
Specification and verification of real-time, distributed systems using the theory of constraints
inferred← citeshttps://doi.org/10.1007/3-540-11160-3_6openalex-snapshot
On the algorithmic properties of concurrent programs
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_26openalex-snapshot
Algebre de machines et logique temporelle
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_64openalex-snapshot
Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-44584-6_3openalex-snapshot
Continuous Self-Evaluation for the Self-Improvement of Software
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_33openalex-snapshot
Abstract object types: A temporal perspective
inferred← citeshttps://doi.org/10.1007/3-540-56735-6_51openalex-snapshot
An analysis of the temporal relations of intervals in relativistic space-time
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_45openalex-snapshot
Hybrid parallel programming and implementation of synchronised communication
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_42openalex-snapshot
Fairness of N-party synchronization and its implementation in a distributed environment
inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_6openalex-snapshot
Programs, Semantics and Effective Atomicity
inferred← citeshttps://doi.org/10.1007/978-1-4615-6698-4_22openalex-snapshot
Specifying and Verifying Protocols Represented as Abstract Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-27181-6_12openalex-snapshot
Verification of Numeric Planning Problems Through Domain Dynamic Consistency
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_6openalex-snapshot
External Interactions on Hybrid Models of Biological Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-17404-4_9openalex-snapshot
Combining Separation Logic and Projection Temporal Logic to Reason About Non-blocking Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-319-49025-0_9openalex-snapshot
Validation of IP Security and Trust
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_1openalex-snapshot
The Birth of Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_2openalex-snapshot
The Beginning of Model Checking: A Personal Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_35openalex-snapshot
A Policy Language for Distributed Usage Control
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_11openalex-snapshot
Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_15openalex-snapshot
Meanings of Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_17openalex-snapshot
Bounded Rational Search for On-the-Fly Model Checking of LTL Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-28641-4_18openalex-snapshot
Towards Incrementalization of Holistic Hyperproperties
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_10openalex-snapshot
From Transitions to Executions
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_5openalex-snapshot
A Concurrent Temporal Programming Model with Atomic Blocks
inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_3openalex-snapshot
Tools for Verifying Network Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-73305-9_11openalex-snapshot
A Gentle Tour Through A Petri Net Model Checking Tool
inferred← citeshttps://doi.org/10.1007/978-94-011-4698-2_11openalex-snapshot
The Javatime Approach to Mixed Hardware-Software System Design
inferred← citeshttps://doi.org/10.1007/bf00286492openalex-snapshot
Descriptively complete process logic
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf01888216openalex-snapshot
Branching versus linear logics yet again
inferred← citeshttps://doi.org/10.1007/bfb0012796openalex-snapshot
Global and local invariants in transition systems
inferred← citeshttps://doi.org/10.1007/bfb0024426openalex-snapshot
A TLA solution to the RPC-memory specification problem
inferred← citeshttps://doi.org/10.1007/bfb0025785openalex-snapshot
Verification of concurrent programs: Temporal proof principles
inferred← citeshttps://doi.org/10.1007/bfb0053562openalex-snapshot
Verifiable and executable logic specifications of concurrent objects in $$\mathcal{L}_\pi$$
inferred← citeshttps://doi.org/10.1007/bfb0105124openalex-snapshot
On synchronization and its specification
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90051-4openalex-snapshot
A formal system for parallel programs in discrete time and space
inferred← citeshttps://doi.org/10.1016/0020-0255(86)90022-8openalex-snapshot
Correctness proof for the majority consensus algorithm
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90003-4openalex-snapshot
Process logic: Expressiveness, decidability, completeness
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90028-4openalex-snapshot
Port automata and the algebra of concurrent processes
inferred← citeshttps://doi.org/10.1016/0164-1212(84)90018-9openalex-snapshot
Environments for VLSI and software engineering
inferred← citeshttps://doi.org/10.1016/0164-1212(94)00101-4openalex-snapshot
AIDA: A dynamic analyzer for Ada programs
inferred← citeshttps://doi.org/10.1016/0169-7552(92)90109-4openalex-snapshot
Temporal logic and applications—a tutorial
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90067-6openalex-snapshot
A unified approach for studying the properties of transition systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00206-xopenalex-snapshot
On using temporal logic for refinement and compositional verification of concurrent systems
inferred← citeshttps://doi.org/10.1016/0306-4379(83)90017-0openalex-snapshot
Correctness of a distributed transaction system
inferred← citeshttps://doi.org/10.1016/0306-4379(86)90023-2openalex-snapshot
The INFOLOG linear tense propositional logic of events and transactions
inferred← citeshttps://doi.org/10.1016/0306-4379(87)90018-4openalex-snapshot
Verification of resource controller processes
inferred← citeshttps://doi.org/10.1016/0950-5849(94)90090-6openalex-snapshot
AIDA: a dynamic analyser for Ada programs
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50022-9openalex-snapshot
Modal Logics and mu-Calculi: An Introduction
inferred← citeshttps://doi.org/10.1016/j.conengprac.2015.05.006openalex-snapshot
Synthesizing safe control-command systems out of reusable components
inferred← citeshttps://doi.org/10.1016/j.scico.2014.07.006openalex-snapshot
A basis for compositionally ensuring safety properties and its connection to relational algebraic operators
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)91167-6openalex-snapshot
Global and local invariants in transition systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80025-5openalex-snapshot
The power of the future perfect in program logics
inferred← citeshttps://doi.org/10.1016/s1383-7621(97)00028-3openalex-snapshot
Formal methods integration for the specification of dependable distributed systems
inferred← citeshttps://doi.org/10.1017/s0960129510000241openalex-snapshot
Axiomatic semantics of projection temporal logic programs
inferred← citeshttps://doi.org/10.1023/a:1008713601998openalex-snapshot
Selective Quantitative Analysis and Interval Model Checking: Verifying Different Facets of a System
inferred← citeshttps://doi.org/10.1109/100.298482openalex-snapshot
A subject-indexed bibliography of discrete event dynamic systems
inferred← citeshttps://doi.org/10.1109/32.31354openalex-snapshot
Language constructs for specifying concurrency in CDL
inferred← citeshttps://doi.org/10.1109/5.21072openalex-snapshot
The control of discrete event systems
inferred← citeshttps://doi.org/10.1109/acsd.2008.4574596openalex-snapshot
An effective approach for model checking SystemC designs
inferred← citeshttps://doi.org/10.1109/aspec.2007.39openalex-snapshot
Checking Distributed Programs with Partially Ordered Atoms
inferred← citeshttps://doi.org/10.1109/dasc.2007.24openalex-snapshot
Using Atoms to Simplify Distributed Programs Checking
inferred← citeshttps://doi.org/10.1109/ftdcs.1988.26684openalex-snapshot
Global stability detection in the asynchronous distributed computations
inferred← citeshttps://doi.org/10.1109/ftdcs.1988.26697openalex-snapshot
A tool for the synthesis of discrete controllers for distributed systems
inferred← citeshttps://doi.org/10.1109/hicss.1990.205212openalex-snapshot
Temporal specification of Ada tasks
inferred← citeshttps://doi.org/10.1109/hpcs.2017.32openalex-snapshot
Automatic Generation of Wireless Sensor Networks Scheduling
inferred← citeshttps://doi.org/10.1109/icsm.1994.336786openalex-snapshot
Combining static and dynamic analysis of concurrent programs
inferred← citeshttps://doi.org/10.1109/icvd.2003.1183144openalex-snapshot
Formal verification using bounded model checking: SAT versus sequential ATPG engines
inferred← citeshttps://doi.org/10.1109/jcit.1990.128357openalex-snapshot
Reverse software engineering of concurrent programs
inferred← citeshttps://doi.org/10.1109/memcod.2003.1210099openalex-snapshot
On the use of a high-level fault model to check properties incompleteness
inferred← citeshttps://doi.org/10.1109/memcod.2005.1487918openalex-snapshot
On the use of a high-level fault model to analyze logical consequence of properties
inferred← citeshttps://doi.org/10.1109/milcom.1986.4805652openalex-snapshot
A Survey of Protocol Verification Techniques
inferred← citeshttps://doi.org/10.1109/sfcs.1980.35openalex-snapshot
Process logic: Expressiveness, decidability, completeness
inferred← citeshttps://doi.org/10.1109/tac.2019.2922583openalex-snapshot
Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints
inferred← citeshttps://doi.org/10.1109/tc.2006.170openalex-snapshot
A New Simulation-Based Property Checking Algorithm Based on Partitioned Alternative Search Space Traversal
inferred← citeshttps://doi.org/10.1109/tc.2007.1012openalex-snapshot
Properties Incompleteness Evaluation by Functional Verification
inferred← citeshttps://doi.org/10.1109/tcom.1983.1095720openalex-snapshot
Modular Verification of Computer Communication Protocols
inferred← citeshttps://doi.org/10.1109/tcom.1985.1096306openalex-snapshot
A Simple Protocol Whose Proof Isn't
inferred← citeshttps://doi.org/10.1109/test.2002.1041761openalex-snapshot
Verifying properties using sequential ATPG [IC design]
inferred← citeshttps://doi.org/10.1109/tse.1983.235435openalex-snapshot
Specification of Synchronizing Processes
inferred← citeshttps://doi.org/10.1109/vlsid.2006.58openalex-snapshot
Checking nested properties using bounded model checking and sequential ATPG
inferred← citeshttps://doi.org/10.1109/vlsid.2016.143openalex-snapshot
Formal Security Verification of Third Party Intellectual Property Cores for Information Leakage
inferred← citeshttps://doi.org/10.1137/0325013openalex-snapshot
Supervisory Control of a Class of Discrete Event Processes
inferred← citeshttps://doi.org/10.1142/9789814271059_0015openalex-snapshot
Specification and Verification using Temporal Logics
inferred← citeshttps://doi.org/10.1142/s012905411100843xopenalex-snapshot
Computable Semantics for CTL* on Discrete-Time and Continuous-Space Dynamic Systems
inferred← citeshttps://doi.org/10.1145/1593105.1593208openalex-snapshot
Race condition in Ajax-based web application
inferred← citeshttps://doi.org/10.1145/255471.255472openalex-snapshot
Proving specifications of tasking systems using Ada/TL
inferred← citeshttps://doi.org/10.1145/2989250.2991469openalex-snapshot
A Design Method for WSN's Automatic Scheduling Generation
inferred← citeshttps://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferred← citeshttps://doi.org/10.1145/3632849openalex-snapshot
Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation
inferred← citeshttps://doi.org/10.1145/582153.582187openalex-snapshot
Modular verification of concurrent programs
inferred← citeshttps://doi.org/10.1145/65979.65982openalex-snapshot
On Lamport's interprocessor communication model
inferred← citeshttps://doi.org/10.1145/66451.66455openalex-snapshot
DEBL: a knowledge-based language for specifying and debugging distributed programs
inferred← citeshttps://doi.org/10.1145/69575.69577openalex-snapshot
Tentative steps toward a development method for interfering programs
inferred← citeshttps://doi.org/10.1145/800057.808665openalex-snapshot
Now you may compose temporal logic specifications
inferred← citeshttps://doi.org/10.1145/800220.806687openalex-snapshot
Four combinators for concurrency
inferred← citeshttps://doi.org/10.1145/99412.99421openalex-snapshot
Specification and verification of active message systems
inferred← citeshttps://doi.org/10.14236/ewic/vecos2008.14openalex-snapshot
Heuristics to Verify LTL Properties of Hierarchical Systems
inferred← citeshttps://doi.org/10.2200/s00689ed1v01y201512aim031openalex-snapshot
Representing and Reasoning with Qualitative Preferences: Tools and Applications
inferred← citeshttps://doi.org/10.24963/ijcai.2019/220openalex-snapshot
Reasoning about Quality and Fuzziness of Strategic Behaviours
inferred← citeshttps://doi.org/10.4018/978-1-4666-0089-8.ch003openalex-snapshot
Runtime Verification of Distributed Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1605.09772openalex-snapshot
Technical Report: Directed Controller Synthesis of Discrete Event Systems
inferred← citeshttps://doi.org/10.5555/800254.807763openalex-snapshot
Functional specification of synchronized processes based on modal logic
inferred← citeshttps://doi.org/10.70675/04d8abe6z9041z42f1za290z1a4830304089openalex-snapshot
Extensions de l’algorithme d’atteignabilité arrière dans le cadre de la vérification de modèles modulo théories
inferred← citeshttps://doi.org/10.70675/12eb98a9zd844z4f6czba86z547eb2f8007aopenalex-snapshot
Towards Synthesizing Open Systems : Tableaux For Multi-Agent Temporal Logics
inferred← citeshttps://doi.org/10.70675/4d0d8fbbz9303z4601za7fcz3b03ff99d0ffopenalex-snapshot
Formal semantics and automatic verification of hierarchical multimedia scenarios with interactive choices
inferred← citeshttps://doi.org/10.70675/b20cca49z65b6z4eefzaac1za9636a6cb5d2openalex-snapshot
Ordonnancement des réseaux de capteurs sans fil embarqués
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.