Sciweavers

1141 search results - page 155 / 229
» From Rigorous Requirements Engineering to Formal System Desi...
Sort
View
C3S2E
2010
ACM
15 years 7 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
ECSA
2010
Springer
15 years 7 months ago
Functional Architecture Modeling for the Software Product Industry
Although a lot of research has been carried out on the technical architecture of software systems, the domain of Functional Architecture in the software product industry lacks a fo...
Sjaak Brinkkemper, Stella Pachidi
ICDE
2003
IEEE
102views Database» more  ICDE 2003»
16 years 7 months ago
Schema Mediation in Peer Data Management Systems
Intuitively, data management and data integration tools should be well-suited for exchanging information in a semantically meaningful way. Unfortunately, they suffer from two sign...
Alon Y. Halevy, Zachary G. Ives, Dan Suciu, Igor T...
SAC
2010
ACM
16 years 24 days ago
General constant expressions for system programming languages
Most mainstream system programming languages provide support for builtin types, and extension mechanisms through userdefined types. They also come with a notion of constant expre...
Gabriel Dos Reis, Bjarne Stroustrup
SPW
2000
Springer
15 years 10 months ago
Users and Trust in Cyberspace
The underlying belief and knowledge models assumed by various kinds of authentication protocols have been studied for well over 10 years now. On the other hand, the related questio...
Pekka Nikander, Kristiina Karvonen