Sciweavers

949 search results - page 61 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
KDD
2002
ACM
193views Data Mining» more  KDD 2002»
14 years 8 months ago
Query, analysis, and visualization of hierarchically structured data using Polaris
In the last several years, large OLAP databases have become common in a variety of applications such as corporate data warehouses and scientific computing. To support interactive ...
Chris Stolte, Diane Tang, Pat Hanrahan
LICS
2006
IEEE
14 years 1 months ago
Provable Implementations of Security Protocols
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
Andrew D. Gordon
IFM
2004
Springer
125views Formal Methods» more  IFM 2004»
14 years 1 months ago
Formally Justifying User-Centred Design Rules: A Case Study on Post-completion Errors
Abstract. Interactive systems combine a human operator with a computer. Either may be a source of error. The veri cation processes used must ensure both the correctness of the comp...
Paul Curzon, Ann Blandford
AINA
2003
IEEE
13 years 11 months ago
Formal Verification of Condition Data Flow Diagrams for Assurance of Correct Network Protocols
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
Shaoying Liu
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula