Sciweavers

2496 search results - page 180 / 500
» Error-detecting properties of languages
Sort
View
ICFP
1999
ACM
15 years 8 months ago
A Simple Proof Technique for Certain Parametricity Results
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
Karl Crary
ARTS
1999
Springer
15 years 8 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
CADE
1998
Springer
15 years 8 months ago
Automated Theorem Proving in a Simple Meta-Logic for LF
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
Carsten Schürmann, Frank Pfenning
RTCSA
1997
IEEE
15 years 8 months ago
Behavior verification of hybrid real-time requirements by qualitative formalism
Although modern control theories have been successfully applied to solve a variety of problems, they are often mathematically and physically too specific to describe and analyze t...
Jang-Soo Lee, Sung Deok Cha
APLAS
2007
ACM
15 years 8 months ago
Polymorphic Delimited Continuations
Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski...
Kenichi Asai, Yukiyoshi Kameyama