84 search results - page 13 / 17 » Mixed symbolic representations for model checking software p... |
127
Voted
POPL
2010
ACM
16 years 23 days ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
137
click to vote
ENTCS
2002
15 years 3 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
175
click to vote
POPL
2011
ACM
14 years 6 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
150
Voted
COMPSAC
2002
IEEE
15 years 8 months ago
2002
IEEE
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...
118
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...