Sciweavers

117 search results - page 3 / 24
» A Dynamic Approach to Characterizing Termination of General ...
Sort
View
TPLP
2002
90views more  TPLP 2002»
13 years 4 months ago
Properties of input-consuming derivations
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
ICFP
2005
ACM
14 years 5 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
ICFP
2005
ACM
13 years 11 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
EUROSYS
2007
ACM
13 years 9 months ago
Dynamic updates: another middleware service?
Middleware simplifies the construction of distributed applications. These applications typically require continuous uptime. The maintenance of distributed applications, though, im...
Susanne Cech Previtali
PEPM
2010
ACM
13 years 7 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...