329 search results - page 22 / 66 » Automatic Proofs for Scalecharts |
CAV
2007
Springer
14 years 2 months ago
2007
Springer
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
ECOOPW
1999
Springer
14 years 22 days ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
CSFW
2007
IEEE
14 years 12 days ago
2007
IEEE
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
ESOP
2008
Springer
13 years 10 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...