Sciweavers

279 search results - page 26 / 56
» Sorting out software complexity
Sort
View
ISORC
2009
IEEE
14 years 2 months ago
Resource Scopes: Toward Language Support for Compositional Determinism
Complex real-time embedded systems should be compositional and deterministic in the resource, time, and value domains. Determinism eases the engineering of correct systems and com...
Madhukar Anand, Sebastian Fischmeister, Insup Lee
ICFEM
2007
Springer
14 years 1 months ago
Machine-Assisted Proof Support for Validation Beyond Simulink
Simulink is popular in industry for modeling and simulating embedded systems. It is deficient to handle requirements of high-level assurance and timing analysis. Previously, we sh...
Chunqing Chen, Jin Song Dong, Jun Sun 0001
WECWIS
2006
IEEE
106views ECommerce» more  WECWIS 2006»
14 years 1 months ago
A Feature-based Approach to Electronic Contracts
E-contracts are used to describe the supply and the consumption details of e-services within a business process. The establishment of e-contracts in a given application domain usu...
Marcelo Fantinato, Maria Beatriz Felgar de Toledo,...
HICSS
2005
IEEE
178views Biometrics» more  HICSS 2005»
14 years 1 months ago
The Entity Container - An Object-Oriented and Model-Driven Persistency Cache
Data persistency is a fundamental, but complex aspect of a modern software development process. Therefore, in order to reduce development costs and improve a system’s quality, s...
Gernot Schmoelzer, Stefan Mitterdorfer, Christian ...
CP
2005
Springer
14 years 1 months ago
Distributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...