Sciweavers

917 search results - page 38 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
VLSID
2006
IEEE
121views VLSI» more  VLSID 2006»
15 years 10 months ago
An Integrated Approach for Combining BDD and SAT Provers
Many formal verification tools today are based on Boolean proof techniques. The two most powerful approaches in this context are Binary Decision Diagrams (BDDs) and methods based ...
Rolf Drechsler, Görschwin Fey, Sebastian Kind...
DPPI
2003
ACM
15 years 2 months ago
Observing and probing
In this paper, we discuss and compare two user centred methods applied in concept design: observation and probes. The comparison is based on findings from two case studies. In the...
Vesa Jääskö, Tuuli Mattelmäki
DOLAP
1999
ACM
15 years 2 months ago
starER: A Conceptual Model for Data Warehouse Design
Modeling data warehouses is a complex task focusing, very often, into internal structures and implementation issues. In this paper we argue that, in order to accurately reflect the...
Nectaria Tryfona, Frank Busborg, Jens G. Borch Chr...
SAFECOMP
1998
Springer
15 years 1 months ago
Safety Verification of Software Using Structured Petri Nets
A method is described for the analysis and the verification of safety in software systems. The method offers a formal notation for describing the software structure, the means for ...
Krzysztof Sacha
160
Voted
POPL
2008
ACM
15 years 10 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson