Sciweavers

1210 search results - page 165 / 242
» Formal Techniques for Java Programs
Sort
View
POPL
1995
ACM
13 years 11 months ago
Total Correctness by Local Improvement in Program Transformation
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
David Sands
ESE
2006
154views Database» more  ESE 2006»
13 years 7 months ago
Prioritizing JUnit Test Cases: An Empirical Assessment and Cost-Benefits Analysis
Test case prioritization provides a way to run test cases with the highest priority earliest. Numerous empirical studies have shown that prioritization can improve a test suite�...
Hyunsook Do, Gregg Rothermel, Alex Kinneer
SAC
2010
ACM
14 years 2 months ago
General constant expressions for system programming languages
Most mainstream system programming languages provide support for builtin types, and extension mechanisms through userdefined types. They also come with a notion of constant expre...
Gabriel Dos Reis, Bjarne Stroustrup
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
13 years 9 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders
AC
2000
Springer
14 years 2 days ago
The Join Calculus: A Language for Distributed Mobile Programming
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
Cédric Fournet, Georges Gonthier