The following pages link to Andreas Podelski (Q225062):
Displaying 50 items.
- Doomed program points (Q633286) (← links)
- Another variation on the common subexpression problem (Q685700) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- A feature constraint system for logic programming with entailment (Q1314426) (← links)
- Rabin tree automata and finite monoids (Q1341736) (← links)
- Situated simplification (Q1391936) (← links)
- A tree-based approach to data flow proofs (Q1629956) (← links)
- The map equality domain (Q1629967) (← links)
- Fairness modulo theory: a new approach to LTL software model checking (Q1702910) (← links)
- Verification of cryptographic protocols: tagging enforces termination (Q1770413) (← links)
- Temporal prophecy for proving temporal properties of infinite-state systems (Q2058382) (← links)
- Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version) (Q2105418) (← links)
- Verification of concurrent programs using Petri net unfoldings (Q2234071) (← links)
- Set constraints with intersection (Q2506490) (← links)
- (Q2722046) (← links)
- (Q2767090) (← links)
- (Q2769592) (← links)
- Automated Program Verification (Q2799160) (← links)
- Proof Spaces for Unbounded Parallelism (Q2819827) (← links)
- Detecting Quasi-equal Clocks in Timed Automata (Q2842671) (← links)
- Splitting via Interpolants (Q2891411) (← links)
- Inductive data flow graphs (Q2931789) (← links)
- Push-Down Automata with Gap-Order Constraints (Q2948245) (← links)
- Quasi-dependent variables in hybrid automata (Q2986955) (← links)
- Eliminating spurious transitions in reachability with support functions (Q2988931) (← links)
- Transition Invariants and Transition Predicate Abstraction for Program Termination (Q3000631) (← links)
- (Q3043805) (← links)
- Composing Stability Proofs for Hybrid Systems (Q3172858) (← links)
- Predicate Abstraction for Program Verification (Q3176373) (← links)
- Proving that programs eventually do something good (Q3189807) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- Abstraction Refinement for Quantified Array Assertions (Q3392917) (← links)
- Refinement of Trace Abstraction (Q3392921) (← links)
- Fairness for Infinitary Control (Q3449624) (← links)
- Region Stability Proofs for Hybrid Systems (Q3510850) (← links)
- Heap Assumptions on Demand (Q3512501) (← links)
- Thread-Modular Verification Is Cartesian Abstract Interpretation (Q3525149) (← links)
- Fairness for Dynamic Control (Q3557081) (← links)
- Precise Thread-Modular Verification (Q3612004) (← links)
- Transition-Based Directed Model Checking (Q3617760) (← links)
- (Q3833629) (← links)
- (Q4217932) (← links)
- (Q4218920) (← links)
- (Q4260364) (← links)
- (Q4273659) (← links)
- (Q4282498) (← links)
- (Q4287474) (← links)
- (Q4297397) (← links)
- (Q4303681) (← links)
- Minimal Ascending and Descending Tree Automata (Q4337430) (← links)
