797 search results - page 77 / 160 » Eliminating Proofs from Programs |
148
click to vote
TPDS
1998
15 years 5 months ago
1998
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
313
click to vote
CADE
2011
Springer
14 years 6 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
153
click to vote
ACMSE
2004
ACM
15 years 11 months ago
2004
ACM
This paper presents a specification-driven approach to test automation for GUI-based JAVA programs as an alternative to the use of capture/replay. The NetBeans Jemmy library provi...
152
click to vote
COMPASS
1994
15 years 10 months ago
1994
ASL+ is a formalism for speci cation and programming in-the-large, based on an arbitrary institution. It has rules for proving the satisfaction and re nement of speci cations, whic...
150
Voted
ESOP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...