Sciweavers

319 search results - page 54 / 64
» Space-Efficient Bounded Model Checking
Sort
View
SAT
2004
Springer
97views Hardware» more  SAT 2004»
14 years 3 months ago
Incremental Compilation-to-SAT Procedures
We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework...
Marco Benedetti, Sara Bernardini
DLT
2008
13 years 11 months ago
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
Mohamed Faouzi Atig, Benedikt Bollig, Peter Haberm...
FOSSACS
2001
Springer
14 years 2 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
FM
2009
Springer
157views Formal Methods» more  FM 2009»
14 years 4 months ago
Symbolic Predictive Analysis for Concurrent Programs
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
Chao Wang, Sudipta Kundu, Malay K. Ganai, Aarti Gu...
TACAS
1998
Springer
81views Algorithms» more  TACAS 1998»
14 years 2 months ago
Formal Design and Analysis of a Gear Controller
In this paper, we report on an application of the validation and veri cation tool kit Uppaal in the design and analysis of a prototype gear controller, carried out in a joint proje...
Magnus Lindahl, Paul Pettersson, Wang Yi