Sciweavers

117 search results - page 12 / 24
» On Complexity of Model-Checking for the TQL Logic
Sort
View
DAGSTUHL
2006
13 years 9 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
ATVA
2005
Springer
202views Hardware» more  ATVA 2005»
14 years 1 months ago
Model Checking Real Time Java Using Java PathFinder
Abstract. The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real t...
Gary Lindstrom, Peter C. Mehlitz, Willem Visser
RE
2008
Springer
13 years 7 months ago
Requirements Capture with RCAT
NASA spends millions designing and building spacecraft for its missions. The dependence on software is growing as spacecraft become more complex. With the increasing dependence on...
Margaret H. Smith, Klaus Havelund
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 7 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
LICS
2009
IEEE
14 years 2 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...