Sciweavers

53 search results - page 8 / 11
» Software architects in practice: handling requirements
Sort
View
C3S2E
2010
ACM
15 years 23 days 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
CORR
2004
Springer
113views Education» more  CORR 2004»
14 years 11 months ago
Pattern Reification as the Basis for Description-Driven Systems
One of the main factors driving object-oriented software development for information systems is the requirement for systems to be tolerant to change. To address this issue in desig...
Florida Estrella, Zsolt Kovacs, Jean-Marie Le Goff...
EWSPT
2003
Springer
15 years 4 months ago
An Approach and Framework for Extensible Process Support System
The issue of building a Process Support System Environment (PSSE), or a family of PSEE, to make them interoperate or to use them to pilot applications or services requires new solu...
Jacky Estublier, Jorge Villalobos, Anh-Tuyet Le, S...
ISPASS
2005
IEEE
15 years 5 months ago
Analysis of Network Processing Workloads
Abstract— Network processing is becoming an increasingly important paradigm as the Internet moves towards an architecture with more complex functionality inside the network. Mode...
Ramaswamy Ramaswamy, Ning Weng, Tilman Wolf
HPCA
2008
IEEE
16 years 7 hour ago
Thread-safe dynamic binary translation using transactional memory
Dynamic binary translation (DBT) is a runtime instrumentation technique commonly used to support profiling, optimization, secure execution, and bug detection tools for application...
JaeWoong Chung, Michael Dalton, Hari Kannan, Chris...