Sciweavers

2000 search results - page 252 / 400
» Program Transformation and Proof Transformation
Sort
View
TLCA
1999
Springer
15 years 8 months ago
AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem
AnnoDomini is a commercially available source-to-source conversion tool for finding and fixing Year 2000 problems in COBOL programs. AnnoDomini uses type-based specification, an...
Peter Harry Eidorff, Fritz Henglein, Christian Mos...
LCTRTS
1998
Springer
15 years 8 months ago
Automatic Accurate Time-Bound Analysis for High-Level Languages
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
Yanhong A. Liu, Gustavo Gomez
SIGGRAPH
1994
ACM
15 years 8 months ago
Fast contact force computation for nonpenetrating rigid bodies
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
David Baraff
BIRTHDAY
2008
Springer
15 years 5 months ago
From Monadic Logic to PSL
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...
Moshe Y. Vardi
FASE
2008
Springer
15 years 5 months ago
Software Quality Improvement Via Pattern Matching
Abstract. Nested if-then-else statements is the most common programming schema in applications like data transformation or data analysis. In most cases, these can be replaced by hi...
Radu Kopetz, Pierre-Etienne Moreau