Andreas Podelski

From MaRDI portal
Person:225062

Available identifiers

zbMath Open podelski.andreasMaRDI QIDQ225062

List of research outcomes

PublicationDate of PublicationType
Ultimately periodic words of rational ω-languages2023-04-28Paper
Equational and membership constraints for infinite trees2022-12-09Paper
Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)2022-12-08Paper
Feature automata and recognizable sets of feature trees2022-11-02Paper
https://portal.mardi4nfdi.de/entity/Q50163832021-12-13Paper
Temporal prophecy for proving temporal properties of infinite-state systems2021-12-08Paper
Verification of concurrent programs using Petri net unfoldings2021-10-18Paper
On reverse and general definite tree languages2019-12-04Paper
Loop Invariants from Counterexamples2019-09-16Paper
A tree-based approach to data flow proofs2018-12-07Paper
The map equality domain2018-12-07Paper
Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices2018-12-06Paper
Predicate Abstraction for Program Verification2018-07-20Paper
Proving Liveness of Parameterized Programs2018-04-23Paper
Fairness modulo theory: a new approach to LTL software model checking2018-03-01Paper
Thread modularity at many levels: a pearl in compositional verification2017-10-20Paper
Transition predicate abstraction and fair termination2017-07-14Paper
Eliminating spurious transitions in reachability with support functions2017-05-19Paper
Quasi-dependent variables in hybrid automata2017-05-16Paper
Proof Spaces for Unbounded Parallelism2016-09-29Paper
Automated Program Verification2016-04-08Paper
Fairness for Infinitary Control2015-11-04Paper
Push-Down Automata with Gap-Order Constraints2015-09-30Paper
Counterexample-guided focus2015-06-11Paper
Nested interpolants2015-06-11Paper
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs2015-03-17Paper
Paths vs. trees in set-based program analysis2015-03-17Paper
Inductive data flow graphs2014-11-27Paper
Proving that programs eventually do something good2014-09-12Paper
Linear Ranking for Linear Lasso Programs2014-07-08Paper
Proofs that count2014-04-10Paper
Detecting Quasi-equal Clocks in Timed Automata2013-08-16Paper
Reducing Quasi-Equal Clocks in Networks of Timed Automata2012-11-21Paper
Timed Automata with Disjoint Activity2012-11-21Paper
Splitting via Interpolants2012-06-15Paper
Composing Stability Proofs for Hybrid Systems2011-10-07Paper
Transition Invariants and Transition Predicate Abstraction for Program Termination2011-05-19Paper
Doomed program points2011-03-31Paper
Composing Reachability Analyses of Hybrid Systems for Safety and Stability2010-10-04Paper
Size-Change Termination and Transition Invariants2010-10-01Paper
Thread-Modular Counterexample-Guided Abstraction Refinement2010-10-01Paper
Fairness for Dynamic Control2010-04-27Paper
Explicit Fair Scheduling for Dynamic Control2010-03-09Paper
Summarization for termination: No return!2010-02-05Paper
Abstraction Refinement for Quantified Array Assertions2009-08-18Paper
Refinement of Trace Abstraction2009-08-18Paper
Verification, Model Checking, and Abstract Interpretation2009-05-15Paper
Transition-Based Directed Model Checking2009-03-31Paper
Precise Thread-Modular Verification2009-03-03Paper
Thread-Modular Verification Is Cartesian Abstract Interpretation2008-09-11Paper
Heap Assumptions on Demand2008-07-15Paper
Region Stability Proofs for Hybrid Systems2008-07-03Paper
Is Lazy Abstraction a Decision Procedure for Broadcast Protocols?2008-04-04Paper
Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL2007-11-01Paper
Hybrid Systems: Computation and Control2007-05-02Paper
Model Checking Software2007-05-02Paper
Verification, Model Checking, and Abstract Interpretation2007-02-12Paper
Static Analysis2006-10-31Paper
Static Analysis2006-10-31Paper
Set constraints with intersection2006-10-10Paper
Tools and Algorithms for the Construction and Analysis of Systems2005-11-10Paper
Programming Languages and Systems2005-09-13Paper
Verification of cryptographic protocols: tagging enforces termination2005-04-06Paper
https://portal.mardi4nfdi.de/entity/Q48091602004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47369912004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47375892004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q30438052004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44722352004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44739802004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44178562003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44143732003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q27695922002-02-05Paper
https://portal.mardi4nfdi.de/entity/Q27670902002-01-28Paper
Constraint-based deductive model checking2002-01-23Paper
https://portal.mardi4nfdi.de/entity/Q27220462001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q45016752000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49392702000-05-28Paper
https://portal.mardi4nfdi.de/entity/Q49452172000-03-23Paper
https://portal.mardi4nfdi.de/entity/Q49361262000-01-24Paper
https://portal.mardi4nfdi.de/entity/Q42603641999-09-19Paper
https://portal.mardi4nfdi.de/entity/Q42189201998-11-15Paper
https://portal.mardi4nfdi.de/entity/Q42179321998-11-11Paper
Situated simplification1998-07-23Paper
Order-sorted feature theory unification1998-03-17Paper
https://portal.mardi4nfdi.de/entity/Q43755891998-02-08Paper
https://portal.mardi4nfdi.de/entity/Q56889301997-05-25Paper
Minimal Ascending and Descending Tree Automata1997-05-19Paper
Rabin tree automata and finite monoids1995-01-09Paper
A feature constraint system for logic programming with entailment1994-11-29Paper
https://portal.mardi4nfdi.de/entity/Q42736591994-10-31Paper
https://portal.mardi4nfdi.de/entity/Q43036811994-09-27Paper
https://portal.mardi4nfdi.de/entity/Q42973971994-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42824981994-08-21Paper
https://portal.mardi4nfdi.de/entity/Q42874741994-04-12Paper
Another variation on the common subexpression problem1993-10-24Paper
Towards a meaning of life1993-08-23Paper
A geometrical view of the determinization and minimization of finite-state automata1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38336291989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Andreas Podelski