Travelled to:1 × Ireland
1 × Spain
1 × United Kingdom
2 × Italy
2 × USA
Collaborated with:∅ I.Horrocks F.Baader U.Sattler E.Cohen M.Moskal W.Schulte V.Klebanov P.Müller N.Shankar G.T.Leavens V.Wüstholz E.Alkassar R.Arthan D.Bronish R.Chapman M.A.Hillebrand B.Jacobs K.R.M.Leino R.Monahan F.Piessens N.Polikarpova T.Ridge J.Smans T.Tuerk M.Ulbrich B.Weiß
Talks about:logic (3) descript (2) reason (2) modal (2) implement (1) algorithm (1) individu (1) competit (1) automata (1) approach (1)
Person: Stephan Tobies
DBLP: Tobies:Stephan
Contributed to:
2011
2010
2001
2000
20001999
1999Wrote 7 papers:
- FM-2011-KlebanovMSLWAABCCHJLMPPRSTTUW #case study #contest #experience
- The 1st Verified Software Competition: Experience Report (VK, PM, NS, GTL, VW, EA, RA, DB, RC, EC, MAH, BJ, KRML, RM, FP, NP, TR, JS, ST, TT, MU, BW), pp. 154–168.
- CAV-2010-CohenMST #concurrent #invariant #source code #verification
- Local Verification of Global Invariants in Concurrent Programs (EC, MM, WS, ST), pp. 480–494.
- IJCAR-2001-BaaderT #approach #automaton #satisfiability
- The Inverse Method Implements the Automata Approach for Modal Satisfiability (FB, ST), pp. 92–106.
- CADE-2000-HorrocksST #logic #reasoning
- Reasoning with Individuals for the Description Logic SHIQ (IH, US, ST), pp. 482–496.
- KR-2000-HorrocksT #axiom #reasoning #theory and practice
- Reasoning with Axioms: Theory and Practice (IH, ST), pp. 285–296.
- CADE-1999-Tobies #algorithm #logic
- A PSpace Algorithm for Graded Modal Logic (ST), pp. 52–66.
- CSL-1999-Tobies #logic #strict
- A NExpTime-Complete Description Logic Strictly Contained in C2 (ST), pp. 292–306.