62 search results - page 10 / 13 » EPR-Based Bounded Model Checking at Word Level |
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
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...
ICLP
2004
Springer
14 years 26 days ago
2004
Springer
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
DSN
2003
IEEE
14 years 24 days ago
2003
IEEE
This paper combines an analysis of data on security vulnerabilities (published in Bugtraq database) and a focused source-code examination to develop a finite state machine (FSM) m...
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
ICSE
2005
IEEE-ACM
14 years 7 months ago
2005
IEEE-ACM
We argue that finding vulnerabilities in software components is different from finding exploits against them. Exploits that compromise security often use several low-level details...