Sciweavers

797 search results - page 101 / 160
» Eliminating Proofs from Programs
Sort
View
SPLC
2008
15 years 2 months ago
Automated Domain-Specific Modeling Languages for Generating Framework-Based Applications
The adoption of Domain-Specific Modeling Languages (DSMLs) for generating framework-based applications has proved to be an effective way of enforcing the correct use of frameworks...
André L. Santos, Kai Koskimies, Antó...
129
Voted
ECAI
2010
Springer
15 years 1 months ago
Symmetries of Symmetry Breaking Constraints
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different s...
George Katsirelos, Toby Walsh
95
Voted
ISSTA
2010
ACM
15 years 27 days ago
Robust non-intrusive record-replay with processor extraction
With the advent of increasingly larger parallel machines, debugging is becoming more and more challenging. In particular, applications at this scale tend to behave non-determinist...
Filippo Gioachin, Gengbin Zheng, Laxmikant V. Kal&...
106
Voted
ICFP
2008
ACM
16 years 20 days ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
121
Voted
SP
2008
IEEE
162views Security Privacy» more  SP 2008»
15 years 19 days ago
Fable: A Language for Enforcing User-defined Security Policies
This paper presents FABLE, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In ...
Nikhil Swamy, Brian J. Corcoran, Michael Hicks