Sciweavers

3738 search results - page 249 / 748
» Parametrized Logic Programming
Sort
View
TPHOL
2007
IEEE
15 years 10 months ago
Proof Pearl: The Termination Analysis of Terminator
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
Joe Hurd
ENTCS
2002
92views more  ENTCS 2002»
15 years 4 months ago
Improving the Efficiency of Non-Deterministic Computations
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
Sergio Antoy, Pascual Julián Iranzo, Bart M...
FAC
2007
170views more  FAC 2007»
15 years 4 months ago
Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?
Abstract. The Verifying Compiler (VC) project proposals suggest that mainstream software developers are its targeted end-users. Like other software engineering efforts, the VC proj...
Patrice Chalin
JFP
2006
89views more  JFP 2006»
15 years 4 months ago
Featherweight generic confinement
Existing approaches to object encapsulation and confinement either rely on restrictions to programs or require the use of specialised ownership type systems. Syntactic restriction...
Alex Potanin, James Noble, Dave Clarke, Robert Bid...
ECOOP
2010
Springer
15 years 9 months ago
Modules as Objects in Newspeak
Abstract. We describe support for modularity in Newspeak, a programming language descended from Smalltalk [33] and Self [69]. Like Self, all computation — even an object’s own ...
Gilad Bracha, Peter von der Ahé, Vassili By...