Sciweavers

1018 search results - page 146 / 204
» Abstraction and Refinement in Model Checking
Sort
View
CADE
2007
Springer
14 years 8 months ago
Automated Reasoning in Kleene Algebra
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 ...
Georg Struth, Peter Höfner
TACAS
2010
Springer
221views Algorithms» more  TACAS 2010»
14 years 2 months ago
Trace-Based Symbolic Analysis for Atomicity Violations
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...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...
B
2007
Springer
14 years 2 months ago
A Generic Flash-Based Animation Engine for ProB
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...
Jens Bendisposto, Michael Leuschel
ASWEC
2006
IEEE
14 years 2 months ago
Formally Analysing a Security Protocol for Replay Attacks
The Kerberos-One-Time protocol is a key distribution protocol promoted for use with Javacards to provide secure communication over the GSM mobile phone network. From inspection we...
Benjamin W. Long, Colin J. Fidge
ISW
2005
Springer
14 years 1 months ago
Universally Composable Time-Stamping Schemes with Audit
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...
Ahto Buldas, Peeter Laud, Märt Saarepera, Jan...