Travelled to:1 × Brazil
1 × Czech Republic
1 × Poland
1 × Serbia
1 × The Netherlands
1 × United Kingdom
2 × Austria
Collaborated with:R.Thiemann A.Middeldorp T.Sternagel S.Winkler M.Avanzini M.Korp H.Zankl A.Y.0002 K.Kusakari
Talks about:certifi (5) termin (3) proof (3) complex (2) complet (2) formal (2) depend (2) certif (2) bendix (2) order (2)
Person: Christian Sternagel
DBLP: Sternagel:Christian
Contributed to:
2015201420132011
20102010200920082016
20172019Wrote 12 papers:
- RTA-2015-AvanziniST #certification #complexity #proving #using
- Certification of Complexity Proofs using CeTA (MA, CS, RT), pp. 23–39.
- RTA-TLCA-2014-SternagelT #algebra #certification #complexity #formal method #proving #termination
- Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs (CS, RT), pp. 441–455.
- RTA-2013-SternagelT #formal method #order
- Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion (CS, RT), pp. 287–302.
- RTA-2011-SternagelT #composition #semantics
- Modular and Certified Semantic Labeling and Unlabeling (CS, RT), pp. 329–344.
- CSL-2010-SternagelT #dependence #proving #termination
- Signature Extensions Preserve Termination — An Alternative Proof via Dependency Pairs (CS, RT), pp. 514–528.
- RTA-2010-SternagelT
- Certified Subterm Criterion and Certified Usable Rules (CS, RT), pp. 325–340.
- RTA-2009-KorpSZM #termination
- Tyrolean Termination Tool 2 (MK, CS, HZ, AM), pp. 295–304.
- RTA-2009-ThiemannS
- Loops under Strategies (RT, CS), pp. 17–31.
- RTA-2008-SternagelM
- Root-Labeling (CS, AM), pp. 336–350.
- CSL-2016-0002STK #dependence #revisited
- AC Dependency Pairs Revisited (AY0, CS, RT, KK), p. 16.
- CADE-2017-SternagelS #confluence #term rewriting
- Certifying Confluence of Quasi-Decreasing Strongly Deterministic Conditional Term Rewrite Systems (CS, TS), pp. 413–431.
- CADE-2019-SternagelW #equation #order #reasoning
- Certified Equational Reasoning via Ordered Completion (CS, SW), pp. 508–525.