Sciweavers

1228 search results - page 84 / 246
» Continuations, proofs and tests
Sort
View
AMC
1999
128views more  AMC 1999»
13 years 7 months ago
An elementary result in the stability theory of time-invariant nonlinear discrete dynamical systems
The stability of the equilibria of time-invariant nonlinear dynamical systems with discrete time scale is investigated. We present an elementary proof showing that in the case of ...
Weiye Li, Ferenc Szidarovszky
ICFP
2000
ACM
14 years 14 days ago
Syntactic accidents in program analysis: on the impact of the CPS transformation
We show that a non-duplicating transformation into Continuation-Passing Style (CPS) has no effect on control-flow analysis, a positive effect on binding-time analysis for tradi...
Daniel Damian, Olivier Danvy
TAPSOFT
1997
Springer
14 years 7 days ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
APCSAC
2004
IEEE
13 years 12 months ago
A Compiler-Assisted On-Chip Assigned-Signature Control Flow Checking
As device sizes continue shrinking, lower charges are needed to activate gates, and consequently ever smaller external events (such as single ionizing particles of naturally occurr...
Xiaobin Li, Jean-Luc Gaudiot
ICFP
2012
ACM
11 years 10 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler