1410 search results - page 160 / 282 » Proving theorems by reuse |
253
click to vote
RTA
2011
Springer
14 years 9 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
134
click to vote
SAC
2009
ACM
16 years 26 days ago
2009
ACM
Component-Based Development(CBD) is an emerging discipline for promoting practical reuse of software. In CBD, by building new software with independently developed components, we ...
143
Voted
CHARME
2005
Springer
15 years 11 months ago
2005
Springer
Today, verification is becoming the dominating factor for successful circuit designs. In this context formal verification techniques allow to prove the correctness of a circuit ...
153
click to vote
CL
2004
Springer
15 years 5 months ago
2004
Springer
In the context of meta-programming and reflective languages, classes are treated as full fledged objects which are instances of other classes named metaclasses. Metaclasses have p...
176
Voted
FPCA
1989
15 years 10 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...