Sciweavers

756 search results - page 116 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
ICLP
1989
Springer
14 years 16 days ago
A Simple Code Improvement Scheme for Prolog
The generation of efficient code for Prolog programs requires sophisticated code transformation and optimization systems. Much of the recent work in this area has focussed on hig...
Saumya K. Debray
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 8 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
CAV
2003
Springer
188views Hardware» more  CAV 2003»
14 years 4 days ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
CSMR
1998
IEEE
14 years 23 days ago
Towards Mature Measurement Programs
Many organizations are using measurement as a means to improve their software development and maintenance processes. A reasonable consensus has been reached about the main success...
Frank Niessink, Hans van Vliet
LICS
2005
IEEE
14 years 2 months ago
Certifying Compilation for a Language with Stack Allocation
This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack allocation. The type system uses linear logic and a ...
Limin Jia, Frances Spalding, David Walker, Neal Gl...