Sciweavers

1888 search results - page 37 / 378
» Proof theory and computational analysis
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
RTA
2011
Springer
12 years 10 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
TPHOL
2009
IEEE
14 years 2 months ago
Formalising Observer Theory for Environment-Sensitive Bisimulation
Abstract. We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the kno...
Jeremy E. Dawson, Alwen Tiu
ARTS
1999
Springer
13 years 11 months ago
Proof Assistance for Real-Time Systems Using an Interactive Theorem Prover
This paper discusses the adaptation of the PVS theorem prover for performing analysis of real-time systems written in the ASTRAL formal specification language. A number of issues w...
Paul Z. Kolano
FOCM
2010
160views more  FOCM 2010»
13 years 6 months ago
Boundary Measures for Geometric Inference
We study the boundary measures of compact subsets of the d-dimensional Euclidean space, which are closely related to Federer’s curvature measures. We show that they can be comput...
Frédéric Chazal, David Cohen-Steiner...