A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Program Transformation with Stratego/XT
[chapter]
2004
Lecture Notes in Computer Science
The framework consists of the transformation language Stratego and the XT collection of transformation tools. ...
The XT tools provide facilities for the infrastructure of transformation systems including parsing and prettyprinting. ...
The first prototype language design and compiler was developed with Zino Benaissa and Andrew Tolmach. ...
doi:10.1007/978-3-540-25935-0_13
fatcat:5d55spl7hvgrbcy2uai7ccbm44
The Kansas University rewrite engine
2014
Journal of functional programming
We also compare KURE, its design choices, and their consequences, with other approaches to strategic and datatype-generic programming. ...
This article describes KURE's approach to assigning types to generic traversals, and the implementation of that approach. ...
Acknowledgments We thank Andrew Farmer and Ed Komp for valuable discussions on their experience using KURE to implement the HERMIT system; Neil Mitchell for his help with Uniplate performance issues; and ...
doi:10.1017/s0956796814000185
fatcat:xuozsse5q5f7jfdtb7lpbzputq
A calculus for reasoning about software composition
2005
Theoretical Computer Science
We demonstrate how the calculus can be used to simplify compositions by partial evaluation, and we briefly outline some other applications of the calculus to reasoning about compositional styles. ...
The calculus is high level, rather than minimal, and is consequently convenient for expressing and reasoning about software components, and different styles of composition. ...
and 2000-067855.02, "Tools and Techniques for Decomposing and Composing Software''. ...
doi:10.1016/j.tcs.2004.09.022
fatcat:k52e3hrenzdttbene4zqqernje
Stack inspection
2003
ACM Transactions on Programming Languages and Systems
We present a formal semantics and an equational theory to explain how stack inspection affects program behavior and code optimisations. ...
We discuss the security properties enforced by stack inspection, and also consider variants with stronger, simpler properties. ...
ACKNOWLEDGMENTS This work benefited from discussion with Martín Abadi, Tony Hoare, Butler Lampson, and Erik Meijer. We also thank the referees for helpful suggestions. ...
doi:10.1145/641909.641912
fatcat:vqauwgxhajewrcazq3suj55xui
Stack inspection
2002
SIGPLAN notices
We present a formal semantics and an equational theory to explain how stack inspection affects program behavior and code optimisations. ...
We discuss the security properties enforced by stack inspection, and also consider variants with stronger, simpler properties. ...
ACKNOWLEDGMENTS This work benefited from discussion with Martín Abadi, Tony Hoare, Butler Lampson, and Erik Meijer. We also thank the referees for helpful suggestions. ...
doi:10.1145/565816.503301
fatcat:qhi4jdtzzzcopop4bpocfhgzym
Stack inspection
2002
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '02
We present a formal semantics and an equational theory to explain how stack inspection affects program behavior and code optimisations. ...
We discuss the security properties enforced by stack inspection, and also consider variants with stronger, simpler properties. ...
ACKNOWLEDGMENTS This work benefited from discussion with Martín Abadi, Tony Hoare, Butler Lampson, and Erik Meijer. We also thank the referees for helpful suggestions. ...
doi:10.1145/503272.503301
dblp:conf/popl/FournetG02
fatcat:j3qc6irakfct5fzqm6xdpvztma
Guardians for Ambient-Based Monitoring
2002
Electronical Notes in Theoretical Computer Science
Since the seminal work of Cardelli and Gordon, several ambient-based calculi have been proposed (Seal, Boxπ, Safe Ambients, Secure Safe Ambients, Boxed Ambients), mainly for supporting security. ...
At the operational level these (box-and) ambient-based calculi differ only in the capabilities of processes. ...
recorded in the partial function F ). ...
doi:10.1016/s1571-0661(04)80416-x
fatcat:lp5zskhbencw3ozvaed3dwbjp4
Effective strategic programming for Java developers
2012
Software, Practice & Experience
The main contribution comes from the introduction of a recursion operator µ and two generic congruence operators All and One that can be used to describe higher-level strategies such as top-down, innermost ...
This approach is of course less general than the previous one, but it is an interesting trade-off between expressiveness and simplicity of use. ...
We sincerely thank the anonymous referees for their valuable and detailed remarks that led to a substantial improvement of the paper. ...
doi:10.1002/spe.2159
fatcat:h5lb3cf4vndqjgwxwoovxvvvde
The Hidden Subgroup Problem for Universal Algebras
[article]
2020
arXiv
pre-print
We propose a generalization of the HSP to include arbitrary algebraic structures and analyze this new problem on powers of 2-element algebras. ...
The celebrated polynomial-time quantum algorithms for factorization and the discrete logarithm are restricted versions of a generic polynomial-time quantum solution to the HSP for abelian groups, but despite ...
Figure 2 is an example of such a diagram and Definition 3.2 is the inline form of the same circuit. ...
arXiv:2001.11298v1
fatcat:m3oxykxz5reorjugfqhxrn7uku
egg: Fast and Extensible Equality Saturation
[article]
2020
arXiv
pre-print
An e-graph efficiently represents a congruence relation over many expressions. ...
A general mechanism called e-class analyses integrates domain-specific analyses into the e-graph, reducing the need for ad hoc manipulation. ...
1813166 and 1749570. ...
arXiv:2004.03082v3
fatcat:jqqec6vamnaejcl2fqw3tq2nyy
A Generating-Extension-Generator for Machine Code
[article]
2020
arXiv
pre-print
In particular, a partial evaluator needs to be able to (i) save and restore arbitrary program states, and (ii) determine whether a program state is equal to one that arose earlier. ...
The technique has been incorporated into GenXGen[MC], a novel tool for producing machine-code generating extensions. ...
ACKNOWLEDGMENTS Supported, in part, by a gift from Rajiv and Ritu Batra; by ONR under grants N00014-17-1-2889 and N00014-19-1-2318; and by the UW-Madison OVCRGE with funding from WARF. The U.S. ...
arXiv:2005.06645v2
fatcat:mzt2dzgtb5flxd5dhou3c3egna
CryptHOL: Game-based Proofs in Higher-order Logic
[article]
2017
IACR Cryptology ePrint Archive
By basing our framework on a conservative extension of higher-order logic and providing automation support, the resulting proofs are trustworthy and comprehensible, and the framework is extensible and ...
Game-based proofs are a well-established paradigm for structuring security arguments and simplifying their understanding. ...
Acknowledgements Andreas Lochbihler and S. Reza Sefidgar were supported by the Swiss National Science Foundation grant 153217 "Formalising Computational Soundness for Protocol Implementations". ...
dblp:journals/iacr/BasinLS17
fatcat:y5zxivqgnjdn3dlrzekpdkv47q
Translation Certification for Smart Contracts
[article]
2022
arXiv
pre-print
Smart contracts are typically developed in a high-level contract language and compiled to low-level virtual machine code before being committed to the blockchain. ...
Smart contracts are self-contained pieces of software that control assets, which are often of high financial value, in an adversarial environment and, once committed to the blockchain, they cannot be changed ...
The remaining rules are congruence rules, where Rule [Inline-Let] also extends the environment Γ . ...
arXiv:2201.04919v2
fatcat:xfllurf6s5ebpnj6cdgsobaum4
Exploration of language specifications by compilation to first-order logic
2016
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming - PPDP '16
, naming, partial naming), and three compilation strategies that apply different simplifications on the resulting problems (none, general-purpose, domain-specific). ...
Klein et al. propose lightweight mechanization and exploration of language specifications via execution and automated test generation instead of using powerful interactive theorem provers such as Isabelle ...
Encoding Function Specifications We encode partial and total SPL functions of the form (partial) function f : T1 ... ...
doi:10.1145/2967973.2968606
dblp:conf/ppdp/GreweERM16
fatcat:i2ljgauannh2bbvx3ksyojhqnq
Cognitive and Electrophysiological Correlates of the Bilingual Stroop Effect
2012
Frontiers in Psychology
The BWLS effect was present for both balanced and unbalanced bilinguals, but only partially supported a response set explanation. ...
Finally, larger negative amplitude (200-350 ms) was observed between than within languages independent of color congruence. ...
Resources and support were provided by the Computational Biology Initiative. Funding was provided by NICHD/NIGMH HD060435 and the UTSA College of Science to N. Y. Y. Wicha. ...
doi:10.3389/fpsyg.2012.00081
pmid:22485099
pmcid:PMC3317261
fatcat:dxlcz7cr2bfdtb2f3znt2w4cnu
« Previous
Showing results 1 — 15 out of 287 results