Sciweavers

114 search results - page 14 / 23
» Model-Checking Systems with Unbounded Variables without Abst...
Sort
View
HIPEAC
2007
Springer
14 years 3 months ago
Reducing Exit Stub Memory Consumption in Code Caches
Abstract. The interest in translation-based virtual execution environments (VEEs) is growing with the recognition of their importance in a variety of applications. However, due to ...
Apala Guha, Kim M. Hazelwood, Mary Lou Soffa
HASE
2007
IEEE
14 years 3 months ago
On the Verifiability of Programs Written in the Feature Language Extensions
High assurance in embedded system software is difficult to attain. Verification relies on testing. The unreliable and costly testing process is made much worse because the softwar...
Wu-Hon F. Leung
SAC
2009
ACM
14 years 3 months ago
Variable handling in time-based XML declarative languages
This paper focuses on time-based declarative languages. The use of declarative languages has the advantage of their simplicity and gh-level abstraction, usually requiring few or n...
Luiz Fernando Gomes Soares, Rogério Ferreir...
FASE
2008
Springer
13 years 10 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt
FUIN
2008
147views more  FUIN 2008»
13 years 8 months ago
A Basic Logic for Reasoning about Connector Reconfiguration
Abstract. Software systems evolve over time. From a component-based software engineering perspective, this means that either the components of the system need to change, or, if com...
Dave Clarke