Results 11 to 20 of about 5,971 (185)
, 2010 The goal of this lecture is to show how modern theorem provers---in this case, the Coq proof assistant---can be used to mechanize the specification of programming languages and their semantics, and to reason over individual programs and over generic ...
Leroy, Xavier
core +4 more sources
Virtual Machine Support for Many-Core Architectures: Decoupling Abstract from Concrete Concurrency Models [PDF]
, 2010 The upcoming many-core architectures require software developers to exploit concurrency to utilize available computational power. Today's high-level language virtual machines (VMs), which are a cornerstone of software development, do not provide ...
A. Peymandoust +56 more
core +3 more sources
Towards modular compilers for effects [PDF]
, 2012 Compilers are traditionally factorised into a number of separate phases, such as parsing, type checking, code generation, etc. However, there is another potential factorisation that has received comparatively little attention: the treatment of separate ...
D.A. Schmidt +7 more
core +2 more sources
, 1996 . Abstract interpretation has been widely used for verifying properties of computer systems. Here, we present a way to extend this framework to the case of probabilistic systems.
Michael Monerau, Patrick Cousot
core +1 more source
Domain-Specific Symbolic Compilation [PDF]
, 2017 A symbolic compiler translates a program to symbolic constraints, automatically reducing model checking and synthesis to constraint solving. We show that new applications of constraint solving require domain-specific encodings that yield the required ...
+3 more
core +1 more source
Link-time smart card code hardening [PDF]
, 2015 This paper presents a feasibility study to protect smart card software against fault-injection attacks by means of link-time code rewriting. This approach avoids the drawbacks of source code hardening, avoids the need for manual assembly writing, and is ...
De Bosschere, Koen +3 more
core +1 more source
Specializing Interpreters using Offline Partial Deduction [PDF]
, 2004 We present the latest version of the Logen partial evaluation system for logic programs. In particular we present new binding-types, and show how they can be used to effectively specialise a wide variety of interpreters.We show how to achieve Jones ...
A. Lakhotia +37 more
core +2 more sources
Speculative Staging for Interpreter Optimization [PDF]
, 2013 Interpreters have a bad reputation for having lower performance than just-in-time compilers. We present a new way of building high performance interpreters that is particularly effective for executing dynamically typed programming languages. The key idea
Brunthaler, Stefan
core
Open Programming Language Interpreters [PDF]
, 2017 Context: This paper presents the concept of open programming language interpreters and the implementation of a framework-level metaobject protocol (MOP) to support them.
Cazzola, Walter, Shaqiri, Albert
core +2 more sources
Molecular Oncology, EarlyView.This study integrates transcriptomic profiling of matched tumor and healthy tissues from 32 colorectal cancer patients with functional validation in patient‐derived organoids, revealing dysregulated metabolic programs driven by overexpressed xCT (SLC7A11) and SLC3A2, identifying an oncogenic cystine/glutamate transporter signature linked to ...
Marco Strecker +16 more
wiley +1 more source