777 search results - page 108 / 156 » Model Checking with Formula-Dependent Abstract Models |
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
115
click to vote
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
ISW
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...
TPHOL
1998
IEEE
15 years 2 months ago
1998
IEEE
Abstract. Over the last decade, the increasing demand for the validation of safety critical systems lead to the development of domain-specific programming languages (e.g. synchrono...
DBPL
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead...