Pages that link to "Item:Q2915093"
From MaRDI portal
The following pages link to Theoretical Aspects of Computing – ICTAC 2012 (Q2915093):
Displayed 13 items.
- Symbolically Bounding the Drift in Time-Constrained MSC Graphs (Q2915094) (← links)
- A Compositional Hierarchical Monitoring Automaton Construction for LTL (Q2915096) (← links)
- How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata (Q2915098) (← links)
- Non-termination Sets of Simple Linear Loops (Q2915099) (← links)
- Definite Expression Aliasing Analysis for Java Bytecode (Q2915100) (← links)
- A Locally Nameless Representation for a Natural Semantics for Lazy Evaluation (Q2915102) (← links)
- Modal Process Rewrite Systems (Q2915103) (← links)
- S-Narrowing for Constructor Systems (Q2915104) (← links)
- Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols (Q2915106) (← links)
- A Cure for Stuttering Parity Games (Q2915107) (← links)
- Ensuring Reachability by Design (Q2915108) (← links)
- Approximate Verification and Enumeration Problems (Q2915109) (← links)
- Undecidability of Quantized State Feedback Control for Discrete Time Linear Hybrid Systems (Q2915110) (← links)