Sciweavers

190 search results - page 19 / 38
» Towards model checking interpreted systems
Sort
View
SIGSOFT
2003
ACM
14 years 8 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
CC
2009
Springer
153views System Software» more  CC 2009»
13 years 5 months ago
From Specification to Optimisation: An Architecture for Optimisation of Java Bytecode
We present the architecture of the Rosser toolkit that allows optimisations to be specified in a domain specific language, then compiled and deployed towards optimising object prog...
Richard Warburton, Sara Kalvala
ICCD
1995
IEEE
109views Hardware» more  ICCD 1995»
13 years 11 months ago
Verifying the performance of the PCI local bus using symbolic techniques
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
Sérgio Vale Aguiar Campos, Edmund M. Clarke...
CSL
2007
Springer
14 years 1 months ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam
ADAEUROPE
2007
Springer
14 years 1 months ago
Towards User-Level Extensibility of an Ada Library: An Experiment with Cheddar
In this article, we experiment a way to extend an Ada library called Cheddar. Cheddar provides a domain specific language. Programs written with this domain specific language can...
Frank Singhoff, Alain Plantec