Thomas Wies

Publications (6)0 Total impact

• Source

  Available from: ist.ac.at

  Conference Proceeding: Ideal Abstractions for Well-Structured Transition Systems.

  Damien Zufferey, Thomas Wies, Thomas A. Henzinger
  Verification, Model Checking, and Abstract Interpretation - 13th International Conference, VMCAI 2012, Philadelphia, PA, USA, January 22-24, 2012. Proceedings; 01/2012
• Source

  Available from: uni-salzburg.at

  Conference Proceeding: Scheduling large jobs by abstraction refinement.

  Thomas A. Henzinger, Vasu Singh, Thomas Wies, Damien Zufferey
  European Conference on Computer Systems, Proceedings of the Sixth European conference on Computer systems, EuroSys 2011, alzburg, Austria - April 10-13, 2011; 01/2011
• Source

  Available from: ist.ac.at

  Conference Proceeding: A marketplace for cloud resources.

  Thomas A. Henzinger, Anmol V. Singh, Vasu Singh, Thomas Wies, Damien Zufferey
  Proceedings of the 10th International conference on Embedded software, EMSOFT 2010, Scottsdale, Arizona, USA, October 24-29, 2010; 01/2010
• Source

  Available from: pub.ist.ac.at

  Conference Proceeding: Forward Analysis of Depth-Bounded Processes.

  Thomas Wies, Damien Zufferey, Thomas A. Henzinger
  Foundations of Software Science and Computational Structures, 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings; 01/2010
• Source

  Available from: itb.ac.id

  Conference Proceeding: FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment.

  Thomas A. Henzinger, Anmol V. Singh, Vasu Singh, Thomas Wies, Damien Zufferey
  IEEE International Conference on Cloud Computing, CLOUD 2010, Miami, FL, USA, 5-10 July, 2010; 01/2010
• Article: On Depth-bounded Message Passing Systems

  Thomas A. Henzinger, Thomas Wies, Damien Zufferey
  [show abstract] [hide abstract]
  ABSTRACT: We explore the border between decidability and undecidability of verification problems related to message passing systems that admit unbounded creation of threads and name mobility. Inspired by use cases in real-life programs we introduce the notion of depth-bounded message passing systems. A configuration of a message passing system can be represented as a graph. In a depth-bounded system the length of the longest acyclic path in each reachable configuration is bounded by a constant. While the general reachability problem for depth-bounded systems is undecidable, we prove that control reachability is decidable. In our decidability proof we show that depth-bounded systems are well-structured transition systems to which a forward algorithm for the covering problem can be applied.