Publication | Date of Publication | Type |
---|
Ultimately periodic words of rational ω-languages | 2023-04-28 | Paper |
Equational and membership constraints for infinite trees | 2022-12-09 | Paper |
Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version) | 2022-12-08 | Paper |
Feature automata and recognizable sets of feature trees | 2022-11-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q5016383 | 2021-12-13 | Paper |
Temporal prophecy for proving temporal properties of infinite-state systems | 2021-12-08 | Paper |
Verification of concurrent programs using Petri net unfoldings | 2021-10-18 | Paper |
On reverse and general definite tree languages | 2019-12-04 | Paper |
Loop Invariants from Counterexamples | 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 | 2018-12-06 | Paper |
Predicate Abstraction for Program Verification | 2018-07-20 | Paper |
Proving Liveness of Parameterized Programs | 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 | 2017-10-20 | Paper |
Transition predicate abstraction and fair termination | 2017-07-14 | Paper |
Eliminating spurious transitions in reachability with support functions | 2017-05-19 | Paper |
Quasi-dependent variables in hybrid automata | 2017-05-16 | Paper |
Proof Spaces for Unbounded Parallelism | 2016-09-29 | Paper |
Automated Program Verification | 2016-04-08 | Paper |
Fairness for Infinitary Control | 2015-11-04 | Paper |
Push-Down Automata with Gap-Order Constraints | 2015-09-30 | Paper |
Counterexample-guided focus | 2015-06-11 | Paper |
Nested interpolants | 2015-06-11 | Paper |
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs | 2015-03-17 | Paper |
Paths vs. trees in set-based program analysis | 2015-03-17 | Paper |
Inductive data flow graphs | 2014-11-27 | Paper |
Proving that programs eventually do something good | 2014-09-12 | Paper |
Linear Ranking for Linear Lasso Programs | 2014-07-08 | Paper |
Proofs that count | 2014-04-10 | Paper |
Detecting Quasi-equal Clocks in Timed Automata | 2013-08-16 | Paper |
Reducing Quasi-Equal Clocks in Networks of Timed Automata | 2012-11-21 | Paper |
Timed Automata with Disjoint Activity | 2012-11-21 | Paper |
Splitting via Interpolants | 2012-06-15 | Paper |
Composing Stability Proofs for Hybrid Systems | 2011-10-07 | Paper |
Transition Invariants and Transition Predicate Abstraction for Program Termination | 2011-05-19 | Paper |
Doomed program points | 2011-03-31 | Paper |
Composing Reachability Analyses of Hybrid Systems for Safety and Stability | 2010-10-04 | Paper |
Size-Change Termination and Transition Invariants | 2010-10-01 | Paper |
Thread-Modular Counterexample-Guided Abstraction Refinement | 2010-10-01 | Paper |
Fairness for Dynamic Control | 2010-04-27 | Paper |
Explicit Fair Scheduling for Dynamic Control | 2010-03-09 | Paper |
Summarization for termination: No return! | 2010-02-05 | Paper |
Abstraction Refinement for Quantified Array Assertions | 2009-08-18 | Paper |
Refinement of Trace Abstraction | 2009-08-18 | Paper |
Verification, Model Checking, and Abstract Interpretation | 2009-05-15 | Paper |
Transition-Based Directed Model Checking | 2009-03-31 | Paper |
Precise Thread-Modular Verification | 2009-03-03 | Paper |
Thread-Modular Verification Is Cartesian Abstract Interpretation | 2008-09-11 | Paper |
Heap Assumptions on Demand | 2008-07-15 | Paper |
Region Stability Proofs for Hybrid Systems | 2008-07-03 | Paper |
Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? | 2008-04-04 | Paper |
Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL | 2007-11-01 | Paper |
Hybrid Systems: Computation and Control | 2007-05-02 | Paper |
Model Checking Software | 2007-05-02 | Paper |
Verification, Model Checking, and Abstract Interpretation | 2007-02-12 | Paper |
Static Analysis | 2006-10-31 | Paper |
Static Analysis | 2006-10-31 | Paper |
Set constraints with intersection | 2006-10-10 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
Programming Languages and Systems | 2005-09-13 | Paper |
Verification of cryptographic protocols: tagging enforces termination | 2005-04-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4809160 | 2004-08-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4736991 | 2004-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4737589 | 2004-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q3043805 | 2004-08-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4472235 | 2004-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4473980 | 2004-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4417856 | 2003-07-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4414373 | 2003-07-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q2769592 | 2002-02-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q2767090 | 2002-01-28 | Paper |
Constraint-based deductive model checking | 2002-01-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q2722046 | 2001-07-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4501675 | 2000-09-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4939270 | 2000-05-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4945217 | 2000-03-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4936126 | 2000-01-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4260364 | 1999-09-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4218920 | 1998-11-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4217932 | 1998-11-11 | Paper |
Situated simplification | 1998-07-23 | Paper |
Order-sorted feature theory unification | 1998-03-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4375589 | 1998-02-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q5688930 | 1997-05-25 | Paper |
Minimal Ascending and Descending Tree Automata | 1997-05-19 | Paper |
Rabin tree automata and finite monoids | 1995-01-09 | Paper |
A feature constraint system for logic programming with entailment | 1994-11-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4273659 | 1994-10-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4303681 | 1994-09-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4297397 | 1994-09-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4282498 | 1994-08-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4287474 | 1994-04-12 | Paper |
Another variation on the common subexpression problem | 1993-10-24 | Paper |
Towards a meaning of life | 1993-08-23 | Paper |
A geometrical view of the determinization and minimization of finite-state automata | 1991-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3833629 | 1989-01-01 | Paper |