Sciweavers

4340 search results - page 649 / 868
» Formal Methods and Cryptography
Sort
View
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
16 years 1 days ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman
WOSP
2005
ACM
16 years 1 days ago
From UML to LQN by XML algebra-based model transformations
The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of nonfunctional characteristics of UML models, such as pe...
Gordon Ping Gu, Dorina C. Petriu
ICFEM
2005
Springer
16 years 13 hour ago
An Evidential Tool Bus
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...
John M. Rushby
SAS
2005
Springer
135views Formal Methods» more  SAS 2005»
15 years 12 months ago
Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis
Abstract. We present our experience of combining, in a realistic setting, a static analyzer with a statistical analysis. This combination is in order to reduce the inevitable false...
Yungbum Jung, Jaehwang Kim, Jaeho Shin, Kwangkeun ...
ESOP
2004
Springer
15 years 12 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn