861 search results - page 47 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
231
Voted
POPL
2008
ACM
16 years 2 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
110
Voted
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we propose a technique for leveraging historical field failure records in conjunction with automated static analysis alerts to determine which alerts or sets of ale...
106
Voted
IEEEPACT
2006
IEEE
15 years 8 months ago
2006
IEEE
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly...
140
click to vote
ENTCS
2007
15 years 2 months ago
2007
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...
115
Voted
COLT
1999
Springer
15 years 7 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...