Pages that link to "Item:Q5711491"
From MaRDI portal
The following pages link to Verification, Model Checking, and Abstract Interpretation (Q5711491):
Displaying 19 items.
- On the consistency, expressiveness, and precision of partial modeling formalisms (Q617712) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- On model checking multiple hybrid views (Q947781) (← links)
- Comparing disjunctive modal transition systems with an one-selecting variant (Q953529) (← links)
- Automata methods in transcendence (Q2197705) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- Refinement sensitive formal semantics of state machines with persistent choice (Q2810972) (← links)
- Process algebra having inherent choice: revised semantics for concurrent systems (Q2871829) (← links)
- Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (Q2891416) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- (Q3803205) (← links)
- The Vienna abstract machine (Q4339848) (← links)
- Abstract interpretation from Büchi automata (Q4635636) (← links)
- Abstracting abstract machines (Q5176929) (← links)
- Why These Automata Types? (Q5222950) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
- More Precise Partition Abstractions (Q5452605) (← links)
- EDUCATIONAL PEARL: Automata via macros (Q5472305) (← links)
- Computer Aided Verification (Q5900685) (← links)