Sciweavers

4930 search results - page 593 / 986
» Learning minimal abstractions
Sort
View
176
Voted
SPIN
2009
Springer
16 years 1 months ago
Subsumer-First: Steering Symbolic Reachability Analysis
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
Andrey Rybalchenko, Rishabh Singh
162
Voted
EMSOFT
2006
Springer
15 years 10 months ago
Incremental schedulability analysis of hierarchical real-time components
Embedded systems are complex as a whole but consist of smaller independent modules minimally interacting with each other. This structure makes embedded systems amenable to composi...
Arvind Easwaran, Insik Shin, Oleg Sokolsky, Insup ...
ICFEM
2009
Springer
16 years 1 months ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
BSL
2004
110views more  BSL 2004»
15 years 6 months ago
Notes on quasiminimality and excellence
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
John T. Baldwin
298
Voted
POPL
2002
ACM
16 years 7 months ago
Mining specifications
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
Glenn Ammons, James R. Larus, Rastislav Bodí...