Travelled to:1 × Austria
1 × Cyprus
1 × Germany
2 × USA
Collaborated with:∅ H.Binsztok J.Waldmann A.Middeldorp H.Zantema
Talks about:order (3) termin (2) recurs (2) label (2) path (2) interpret (1) predict (1) infinit (1) certifi (1) automat (1)
Person: Adam Koprowski
DBLP: Koprowski:Adam
Contributed to:
2010
2008
2007
20062006Wrote 6 papers:
- ESOP-2010-KoprowskiB #interpreter #named #parsing
- TRX: A Formally Verified Parser Interpreter (AK, HB), pp. 345–365.
- RTA-2008-KoprowskiW #termination
- Arctic Termination ...Below Zero (AK, JW), pp. 202–216.
- CADE-2007-KoprowskiM #dependence #predict #satisfiability #using
- Predictive Labeling with Dependency Pairs Using SAT (AK, AM), pp. 410–425.
- IJCAR-2006-KoprowskiZ #automation #infinity #order #recursion #term rewriting
- Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems (AK, HZ), pp. 332–346.
- RTA-2006-Koprowski #higher-order #recursion
- Certified Higher-Order Recursive Path Ordering (AK), pp. 227–241.
- RTA-2006-Koprowski06a #automation #named #termination
- TPA: Termination Proved Automatically (AK), pp. 257–266.