Sciweavers

150 search results - page 29 / 30
» Counting Results in Weak Formalisms
Sort
View
ACSAC
2001
IEEE
14 years 13 days ago
Practical Automated Filter Generation to Explicitly Enforce Implicit Input Assumptions
Vulnerabilities in distributed applications are being uncovered and exploited faster than software engineers can patch the security holes. All too often these weaknesses result fr...
Valentin Razmov, Daniel R. Simon
ICSE
2000
IEEE-ACM
14 years 10 days ago
Producing more reliable software: mature software engineering process vs. state-of-the-art technology?
: Producing More Reliable Software: Mature Software Engineering Process vs. State-of-the-Art Technology? A customer of high assurance software recently sponsored a software enginee...
James C. Widmaier
CONCUR
2008
Springer
13 years 10 months ago
A Notion of Glue Expressiveness for Component-Based Systems
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
Simon Bliudze, Joseph Sifakis
AAI
2010
108views more  AAI 2010»
13 years 9 months ago
Augmenting Subsumption Propagation in Distributed Description Logics
Distributed Description Logics (DDL) enable reasoning with multiple ontologies interconnected by directional semantic mapping, called bridge rules. Bridge rules map concepts of a s...
Martin Homola, Luciano Serafini
BMCBI
2007
147views more  BMCBI 2007»
13 years 8 months ago
Modeling biochemical transformation processes and information processing with Narrator
Background: Software tools that model and simulate the dynamics of biological processes and systems are becoming increasingly important. Some of these tools offer sophisticated gr...
Johannes J. Mandel, Hendrik Fuß, Niall M. Pa...