101 search results - page 10 / 21 » Proving correctness of compiler optimizations by temporal lo... |
EMSOFT
2011
Springer
12 years 8 months ago
2011
Springer
Given a multi-modal dynamical system, optimal switching logic synthesis involves generating conditions for switching between the system modes such that the resulting hybrid system...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We present an iterative algorithm for enforcing policies represented in a first-order logic, which can, in particular, express all transmission-related clauses in the HIPAA Priva...
ICLP
1995
Springer
14 years 4 days ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
Constraint Handling Rules (CHR) is a high-level rule-based language extension, commonly embedded in Prolog. We introduce a new occurrence representation of CHR programs, and a new ...
TOPLAS
1998
13 years 8 months ago
1998
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...