Martin Suda

I am a postdoc (Projectassistent) in the group of Laura Kovács and one of the developers of the automated theorem prover Vampire.

Previously, I was a Research Associate in First-Order Theorem Proving and Verification in the Formal Methods Group in the School of Computer Science at the University of Manchester, Manchester, UK.

I did my Ph.D. at the Max-Planck-Institut für Informatik and the Saarland University in Saarbrücken, Germany, and at the Faculty of Mathematics and PhysicsCharles University in Prague, Czech Republic.

Research interests:

  • Automated reasoning
  • Linear temporal logic and symbolic reachability analysis
  • Hardware verification
  • Automated planning

Publications:

See my profile on Google Scholar

Address:
Martin Suda
Technische Universität Wien
Institut für Informationssysteme 184/4
Favoritenstraße 9–11
1040 Wien
Austria

Room: HA 03 12 (how to get there)
Phone: +43 (1) 58801 – 184 836
Email: ta.etysrofnull@adusm
Web: http://forsyte.at/~suda/

Martin Suda

 

 

Latest News

Austrian Computer Science Day 2015

The Austrian Computer Science Day 2015, which takes place on October 15, features a range of talks by leading Austrian computer scientists, including topics such as computer games, augmented reality, aware systems, semantic web, business processes, and reliable systems. Register for free by October 7, 2015! This year’s speakers are: Alois Ferscha (JKU Linz) Tom […]

Continue reading

Helmut Veith receives CAV Award

The 2015 CAV Award is given to Edmund Clarke, Orna Grumberg, Ron Hardin, Zvi Harel, Somesh Jha, Robert Kurshan, Yuan Lu, and Helmut Veith for the development and implementation of the localization-reduction technique and the formulation of counterexample-guided abstraction refinement (CEGAR).

Continue reading

FRIDA’15

We had great talks at FRIDA’15 workshop in Grenoble. The slides of some of the talks are available online.

Continue reading

FRIDA’15 Program

Check the program of the 2nd workshop on Formal Reasoning in Distributed Algorithms at FORTE. We have a nice program this year.

Continue reading

Full news archive