Sciweavers

1210 search results - page 154 / 242
» Formal Techniques for Java Programs
Sort
View
TOPLAS
2008
138views more  TOPLAS 2008»
13 years 8 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
SIGCSE
2006
ACM
362views Education» more  SIGCSE 2006»
14 years 2 months ago
Chirp on crickets: teaching compilers using an embedded robot controller
Traditionally, the topics of compiler construction and language processing have been taught as an elective course in Computer Science curricula. As such, students may graduate wit...
Li Xu, Fred G. Martin
FM
2003
Springer
107views Formal Methods» more  FM 2003»
14 years 2 months ago
Verifying Emulation of Legacy Mission Computer Systems
Processor obsolescence is a serious maintenance problem for long-lived embedded control systems. A practical solution is to interpose an emulator program between the ‘legacy’ s...
Colin J. Fidge
FMCO
2003
Springer
102views Formal Methods» more  FMCO 2003»
14 years 2 months ago
Preserving Properties Under Change
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
Heike Wehrheim
EICS
2010
ACM
14 years 1 months ago
User interface model discovery: towards a generic approach
UI model discovery is a lightweight formal method in which a model of an interactive system is automatically discovered by exploring the system’s state space, simulating the act...
Andy Gimblett, Harold W. Thimbleby