Sciweavers

547 search results - page 85 / 110
» On Automated Program Construction and Verification
Sort
View
RTA
2005
Springer
14 years 2 months ago
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
Proof-carrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set ...
Amy P. Felty
FUIN
2007
99views more  FUIN 2007»
13 years 8 months ago
Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code
Proof-carryingcode provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set o...
Amy P. Felty
ICLP
2005
Springer
14 years 2 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
ECOOP
2010
Springer
14 years 1 months ago
Correct Refactoring of Concurrent Java Code
Automated refactorings as implemented in modern IDEs for Java usually make no special provisions for concurrent code. Thus, refactored programs may exhibit unexpected new concurren...
Max Schäfer, Julian Dolby, Manu Sridharan, Em...
LICS
2007
IEEE
14 years 2 months ago
A Dependent Set Theory
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
Wojciech Moczydlowski