Sciweavers

67 search results - page 11 / 14
» Rewriting-Based Techniques for Runtime Verification
Sort
View
DSN
2004
IEEE
14 years 8 days ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
ENTCS
2008
108views more  ENTCS 2008»
13 years 8 months ago
Modelling Dynamic Software Architectures using Typed Graph Grammars
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of th...
Roberto Bruni, Antonio Bucchiarone, Stefania Gnesi...
CODES
2010
IEEE
13 years 6 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...
DAC
2009
ACM
14 years 3 months ago
Accurate temperature estimation using noisy thermal sensors
Multicore SOCs rely on runtime thermal measurements using on-chip sensors for DTM. In this paper we address the problem of estimating the actual temperature of on-chip thermal sen...
Yufu Zhang, Ankur Srivastava
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
14 years 16 days ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...