Sciweavers

2514 search results - page 340 / 503
» The use of industrial-strength formal methods
Sort
View
FORMATS
2003
Springer
15 years 11 months ago
Folk Theorems on the Determinization and Minimization of Timed Automata
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
Stavros Tripakis
GCC
2003
Springer
15 years 11 months ago
Improving the Objects Set Availability in the P2P Environment by Multiple Groups
The availability is often used to measure how well a system can provide the service continuously. The measures of availability for a single computer and for multiple computers are ...
Kang Chen, Shuming Shi, Guangwen Yang, Meiming She...
IFL
2003
Springer
128views Formal Methods» more  IFL 2003»
15 years 11 months ago
With-Loop Scalarization - Merging Nested Array Operations
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
Clemens Grelck, Sven-Bodo Scholz, Kai Trojahner
ACSAC
2002
IEEE
15 years 11 months ago
Networking in The Solar Trust Model: Determining Optimal Trust Paths in a Decentralized Trust Network
The Solar Trust Model provides a method by which the sender of a message can be authenticated, and the level of trust that can be placed in the sender of the message or the messag...
Michael Clifford
IWANN
2001
Springer
15 years 11 months ago
Verifying Properties of Neural Networks
In the beginning of nineties, Hava Siegelmann proposed a new computational model, the Artificial Recurrent Neural Network (ARNN), and proved that it could perform hypercomputation....
Pedro Rodrigues, José Félix Costa, H...