12981 search results - page 133 / 2597 » Model Checking and Abstraction |
127
click to vote
AMC
2008
15 years 4 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
175
click to vote
TACAS
2010
Springer
15 years 11 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...
124
click to vote
ISW
2005
Springer
15 years 10 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...
136
click to vote
B
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Writing a formal specification for real-life, industrial problems is a difficult and error prone task, even for experts in formal methods. In the process of specifying a...