Sciweavers

125 search results - page 22 / 25
» Bounded Model Checking of Compositional Processes
Sort
View
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
14 years 2 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
ICLP
2007
Springer
14 years 1 months ago
Declarative Diagnosis of Temporal Concurrent Constraint Programs
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
Moreno Falaschi, Carlos Olarte, Catuscia Palamides...
FM
2009
Springer
157views Formal Methods» more  FM 2009»
14 years 2 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...
SIGSOFT
2004
ACM
14 years 8 months ago
Merging partial behavioural models
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners have adopted techniques that support increment...
Marsha Chechik, Sebastián Uchitel
FOSSACS
2001
Springer
14 years 4 days 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