Pages that link to "Item:Q1143164"
From MaRDI portal
The following pages link to The temporal semantics of concurrent programs (Q1143164):
Displaying 22 items.
- A formalization of programs in first-order logic with a discrete linear order (Q274400) (← links)
- Checking interval properties of computations (Q329413) (← links)
- Reliability-aware automatic composition approach for web services (Q439793) (← links)
- Bounded semantics (Q483292) (← links)
- Temporal logic programming (Q582280) (← links)
- The language of social software (Q625718) (← links)
- On the computational complexity of behavioral description-based web service composition (Q650907) (← links)
- Assumption/guarantee specifications in linear-time temporal logic (Q671674) (← links)
- Game-theoretic simulation checking tool (Q764005) (← links)
- The temporal logic of branching time (Q789895) (← links)
- A generalized nexttime operator in temporal logic (Q800722) (← links)
- Checking timed Büchi automata emptiness efficiently (Q816203) (← links)
- Feature interaction detection by pairwise analysis of LTL properties -- A case study (Q853722) (← links)
- Question-guided stubborn set methods for state properties (Q862861) (← links)
- A semantics for concurrent separation logic (Q879367) (← links)
- Resources, concurrency, and local reasoning (Q879368) (← links)
- Decision Procedures for a Deontic Logic Modeling Temporal Inheritance of Obligations (Q4982115) (← links)
- (Q5005123) (← links)
- Appraising two decades of distributed computing theory research (Q5138493) (← links)
- Does “N+1 times” prove more programs correct than “N times”? (Q5887528) (← links)
- Taming strategy logic: non-recurrent fragments (Q6077842) (← links)
- Fuzzy Halpern and Shoham's interval temporal logics (Q6083148) (← links)
