4340 search results - page 326 / 868 » Formal Methods and Cryptography |
161
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
190
click to vote
FORMATS
2009
Springer
15 years 10 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
199
click to vote
LICS
1998
IEEE
15 years 10 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
157
click to vote
ARTS
1997
Springer
15 years 10 months ago
1997
Springer
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
169
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...