The following pages link to A. P. Sistla (Q198033):
Displaying 13 items.
- A multiprocess network logic with temporal and spatial modalities (Q1058846) (← links)
- On verifying that a concurrent program satisfies a nondeterministic specification (Q1123589) (← links)
- Proving correctness with respect to nondeterministic safety specifications (Q1182117) (← links)
- (Q3668862) (← links)
- (Q3704886) (← links)
- Can message buffers be axiomatized in linear temporal logic? (Q3719805) (← links)
- Automatic verification of finite-state concurrent systems using temporal logic specifications (Q3719811) (← links)
- Deciding full branching time logic (Q3722471) (← links)
- The complexity of propositional linear temporal logics (Q3769957) (← links)
- (Q4037378) (← links)
- (Q4414377) (← links)
- (Q5184412) (← links)
- On model checking for the \(\mu\)-calculus and its fragments (Q5941205) (← links)
