The following pages link to Parosh Aziz Abdulla (Q300408):
Displaying 50 items.
- Verification of heap manipulating programs with ordered data by extended forest automata (Q300414) (← links)
- Budget-bounded model-checking pushdown systems (Q479843) (← links)
- A classification of the expressive power of well-structured transition systems (Q553290) (← links)
- Undecidable verification problems for programs with unreliable channels (Q675223) (← links)
- Mediating for reduction (on minimizing alternating Büchi automata) (Q740970) (← links)
- Parameterized verification of time-sensitive models of ad hoc network protocols (Q896913) (← links)
- Approximated parameterized verification of infinite-state processes with global conditions (Q1039841) (← links)
- (Q1189256) (redirect page) (← links)
- Automatic verification of a class of systolic circuits (Q1189257) (← links)
- Perfect timed communication is hard (Q1631220) (← links)
- Stateless model checking for TSO and PSO (Q1683934) (← links)
- Simulating perfect channels with probabilistic lossy channels (Q1776399) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355) (← links)
- SAT-solving the coverability problem for Petri nets (Q1878911) (← links)
- Using forward reachability analysis for verification of lossy channel systems (Q1878928) (← links)
- Verifying programs with unreliable channels (Q1923094) (← links)
- The decidability of verification under PS 2.0 (Q2233444) (← links)
- Counter-example guided program verification (Q2281622) (← links)
- Fragment abstraction for concurrent shape analysis (Q2323989) (← links)
- Tree regular model checking: a simulation-based approach (Q2500700) (← links)
- Verification of probabilistic systems with faulty communication (Q2573634) (← links)
- (Q2729082) (← links)
- (Q2754109) (← links)
- Sampled Semantics of Timed Automata (Q2786131) (← links)
- Qualitative Analysis of VASS-Induced MDPs (Q2811349) (← links)
- MONOTONIC ABSTRACTION FOR PROGRAMS WITH MULTIPLY-LINKED STRUCTURES (Q2841994) (← links)
- Solving Parity Games on Integer Vectors (Q2842100) (← links)
- (Q2851070) (← links)
- Priced Timed Petri Nets (Q2865063) (← links)
- The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems (Q2890180) (← links)
- Counter-Example Guided Fence Insertion under TSO (Q2894272) (← links)
- (Q2920108) (← links)
- All for the Price of Few (Q2926658) (← links)
- Stochastic Parity Games on Lossy Channel Systems (Q2938773) (← links)
- Push-Down Automata with Gap-Order Constraints (Q2948245) (← links)
- Timed lossy channel systems (Q2957514) (← links)
- Verification of Dynamic Register Automata (Q2978554) (← links)
- Dense-Timed Pushdown Automata (Q2986779) (← links)
- AUTOMATIC VERIFICATION OF DIRECTORY-BASED CONSISTENCY PROTOCOLS WITH GRAPH CONSTRAINTS (Q3016215) (← links)
- Well (and Better) Quasi-Ordered Transition Systems (Q3067860) (← links)
- Carrying Probabilities to the Infinite World (Q3090817) (← links)
- Advanced Ramsey-Based Büchi Automata Inclusion Testing (Q3090830) (← links)
- (Q3130545) (← links)
- (Q3130550) (← links)
- On the Verification of Timed Ad Hoc Networks (Q3172855) (← links)
- Monotonic Abstraction for Programs with Multiply-Linked Structures (Q3172870) (← links)
- Chain-Free String Constraints (Q3297597) (← links)
- (Q3388706) (← links)
- COMPOSED BISIMULATION FOR TREE AUTOMATA (Q3395139) (← links)
