Andreas Podelski
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Ultimately periodic words of rational ω-languages Lecture Notes in Computer Science | 2023-04-28 | Paper |
| Equational and membership constraints for infinite trees Rewriting Techniques and Applications | 2022-12-09 | Paper |
| Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version) Information and Computation | 2022-12-08 | Paper |
| Feature automata and recognizable sets of feature trees Lecture Notes in Computer Science | 2022-11-02 | Paper |
| scientific article; zbMATH DE number 7444022 (Why is no real title available?) (available as arXiv preprint) | 2021-12-13 | Paper |
| scientific article; zbMATH DE number 7444022 (Why is no real title available?) | 2021-12-13 | Paper |
| Temporal prophecy for proving temporal properties of infinite-state systems Formal Methods in System Design | 2021-12-08 | Paper |
| Verification of concurrent programs using Petri net unfoldings | 2021-10-18 | Paper |
| On reverse and general definite tree languages (extended abstract) Automata, Languages and Programming | 2019-12-04 | Paper |
| Loop Invariants from Counterexamples Static Analysis | 2019-09-16 | Paper |
| A tree-based approach to data flow proofs | 2018-12-07 | Paper |
| The map equality domain | 2018-12-07 | Paper |
| Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week) | 2018-12-06 | Paper |
| Predicate abstraction for program verification Handbook of Model Checking | 2018-07-20 | Paper |
| Proving liveness of parameterized programs Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Fairness modulo theory: a new approach to LTL software model checking | 2018-03-01 | Paper |
| Thread modularity at many levels: a pearl in compositional verification Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
| Transition predicate abstraction and fair termination Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2017-07-14 | Paper |
| Eliminating spurious transitions in reachability with support functions Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control | 2017-05-19 | Paper |
| Quasi-dependent variables in hybrid automata Proceedings of the 17th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
| Proof spaces for unbounded parallelism Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
| Automated program verification Language and Automata Theory and Applications | 2016-04-08 | Paper |
| Fairness for infinitary control Lecture Notes in Computer Science | 2015-11-04 | Paper |
| Push-down automata with gap-order constraints Fundamentals of Software Engineering | 2015-09-30 | Paper |
| Counterexample-guided focus Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-06-11 | Paper |
| Nested interpolants Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-06-11 | Paper |
| Efficient algorithms for pre* and post* on interprocedural parallel flow graphs Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
| Paths vs. trees in set-based program analysis Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
| Inductive data flow graphs Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
| Proving that programs eventually do something good Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
| Linear ranking for linear lasso programs Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
| Proofs that count Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
| Detecting quasi-equal clocks in timed automata Lecture Notes in Computer Science | 2013-08-16 | Paper |
| Reducing quasi-equal clocks in networks of timed automata Lecture Notes in Computer Science | 2012-11-21 | Paper |
| Timed automata with disjoint activity Lecture Notes in Computer Science | 2012-11-21 | Paper |
| Splitting via Interpolants Lecture Notes in Computer Science | 2012-06-15 | Paper |
| Composing stability proofs for hybrid systems Lecture Notes in Computer Science | 2011-10-07 | Paper |
| Transition invariants and transition predicate abstraction for program termination Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
| Doomed program points Formal Methods in System Design | 2011-03-31 | Paper |
| Composing reachability analyses of hybrid systems for safety and stability Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
| Size-change termination and transition invariants Static Analysis | 2010-10-01 | Paper |
| Thread-modular counterexample-guided abstraction refinement Static Analysis | 2010-10-01 | Paper |
| Fairness for dynamic control Tools and Algorithms for the Construction and Analysis of Systems | 2010-04-27 | Paper |
| Explicit fair scheduling for dynamic control Concurrency, Compositionality, and Correctness | 2010-03-09 | Paper |
| Summarization for termination: No return! Formal Methods in System Design | 2010-02-05 | Paper |
| Abstraction Refinement for Quantified Array Assertions Static Analysis | 2009-08-18 | Paper |
| Refinement of Trace Abstraction Static Analysis | 2009-08-18 | Paper |
| Verification, Model Checking, and Abstract Interpretation Lecture Notes in Computer Science | 2009-05-15 | Paper |
| Transition-Based Directed Model Checking Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
| Precise Thread-Modular Verification Static Analysis | 2009-03-03 | Paper |
| Thread-Modular Verification Is Cartesian Abstract Interpretation Lecture Notes in Computer Science | 2008-09-11 | Paper |
| Heap Assumptions on Demand Computer Aided Verification | 2008-07-15 | Paper |
| Region Stability Proofs for Hybrid Systems Lecture Notes in Computer Science | 2008-07-03 | Paper |
| Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? Lecture Notes in Computer Science | 2008-04-04 | Paper |
| Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL Model Checking and Artificial Intelligence | 2007-11-01 | Paper |
| Hybrid Systems: Computation and Control Lecture Notes in Computer Science | 2007-05-02 | Paper |
| Model Checking Software Lecture Notes in Computer Science | 2007-05-02 | Paper |
| Verification, Model Checking, and Abstract Interpretation Lecture Notes in Computer Science | 2007-02-12 | Paper |
| Static Analysis Lecture Notes in Computer Science | 2006-10-31 | Paper |
| Static Analysis Lecture Notes in Computer Science | 2006-10-31 | Paper |
| Set constraints with intersection Information and Computation | 2006-10-10 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems Lecture Notes in Computer Science | 2005-11-10 | Paper |
| Programming Languages and Systems Lecture Notes in Computer Science | 2005-09-13 | Paper |
| Verification of cryptographic protocols: tagging enforces termination Theoretical Computer Science | 2005-04-06 | Paper |
| Constraint-based infinite model checking and tabulation for stratified CLP Lecture Notes in Computer Science | 2004-08-12 | Paper |
| Compositional termination analysis of symbolic forward analysis Lecture Notes in Computer Science | 2004-08-11 | Paper |
| An algebraic framework for abstract model checking Lecture Notes in Computer Science | 2004-08-11 | Paper |
| Accurate widenings and boundedness properties of timed systems Lecture Notes in Computer Science | 2004-08-06 | Paper |
| Relative completeness of abstraction refinement for software model checking Lecture Notes in Computer Science | 2004-08-04 | Paper |
| Model checking communication protocols Lecture Notes in Computer Science | 2004-08-04 | Paper |
| Verification of cryptographic protocols: Tagging enforces termination Lecture Notes in Computer Science | 2003-07-30 | Paper |
| Software model checking with abstraction refinement Lecture Notes in Computer Science | 2003-07-25 | Paper |
| Boolean and Cartesian abstraction for model checking C programs Lecture Notes in Computer Science | 2002-02-05 | Paper |
| Model checking for timed logic processes Lecture Notes in Computer Science | 2002-01-28 | Paper |
| Constraint-based deductive model checking International Journal on Software Tools for Technology Transfer. STTT | 2002-01-23 | Paper |
| Model checking as constraint solving Lecture Notes in Computer Science | 2001-07-11 | Paper |
| Beyond region graphs: Symbolic forward analysis of timed automata Lecture Notes in Computer Science | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1406234 (Why is no real title available?) | 2000-05-28 | Paper |
| Ordering constraints over feature trees Constraints | 2000-04-09 | Paper |
| Constraint-based analysis of broadcast protocols Lecture Notes in Computer Science | 2000-03-23 | Paper |
| scientific article; zbMATH DE number 1392287 (Why is no real title available?) | 2000-01-24 | Paper |
| Rabin tree automata and finite monoids Lecture Notes in Computer Science | 1999-09-19 | Paper |
| LISA: A specification language based on WS2S Lecture Notes in Computer Science | 1998-11-15 | Paper |
| Directional type inference for logic programs Lecture Notes in Computer Science | 1998-11-11 | Paper |
| Situated simplification Theoretical Computer Science | 1998-07-23 | Paper |
| Situated simplification Theoretical Computer Science | 1998-07-23 | Paper |
| Order-sorted feature theory unification The Journal of Logic Programming | 1998-03-17 | Paper |
| The independence property of a class of set constraints Lecture Notes in Computer Science | 1998-02-08 | Paper |
| scientific article; zbMATH DE number 970739 (Why is no real title available?) | 1997-05-25 | Paper |
| Minimal Ascending and Descending Tree Automata SIAM Journal on Computing | 1997-05-19 | Paper |
| Rabin tree automata and finite monoids Theoretical Computer Science | 1995-01-09 | Paper |
| A feature constraint system for logic programming with entailment Theoretical Computer Science | 1994-11-29 | Paper |
| scientific article; zbMATH DE number 475412 (Why is no real title available?) | 1994-10-31 | Paper |
| scientific article; zbMATH DE number 626030 (Why is no real title available?) | 1994-09-27 | Paper |
| scientific article; zbMATH DE number 599132 (Why is no real title available?) | 1994-09-22 | Paper |
| scientific article; zbMATH DE number 516982 (Why is no real title available?) | 1994-08-21 | Paper |
| scientific article; zbMATH DE number 549955 (Why is no real title available?) | 1994-04-12 | Paper |
| Another variation on the common subexpression problem Discrete Mathematics | 1993-10-24 | Paper |
| Towards a meaning of life The Journal of Logic Programming | 1993-08-23 | Paper |
| A geometrical view of the determinization and minimization of finite-state automata Mathematical Systems Theory | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4110130 (Why is no real title available?) | 1989-01-01 | Paper |
Research outcomes over time
This page was built for person: Andreas Podelski
