Results 1  10
of
985,366
FINITE TYPE INVARIANTS
, 2008
"... This is an overview article on finite type invariants, written for the Encyclopedia of Mathematical Physics. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This is an overview article on finite type invariants, written for the Encyclopedia of Mathematical Physics.
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 653 (35 self)
 Add to MetaCart
Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Finite Type Surfaces of Revolution
"... In this paper, it is shown that the plane, the sphere and the circular cylinder are the only finite type surfaces of revolution whose generating curves are also of finite type. 0. Introduction. The research into Riemannian submanifolds has grown up since 1983, when B.Y.Chen introduces the notion of ..."
Abstract
 Add to MetaCart
In this paper, it is shown that the plane, the sphere and the circular cylinder are the only finite type surfaces of revolution whose generating curves are also of finite type. 0. Introduction. The research into Riemannian submanifolds has grown up since 1983, when B.Y.Chen introduces the notion
Mathematical Control Theory: Deterministic Finite Dimensional Systems
 of Texts in Applied Mathematics
, 1990
"... The title of this book gives a very good description of its contents and style, although I might have added “Introduction to ” at the beginning. The style is mathematical: precise, clear statements (i.e., theorems) are asserted, then carefully proved. The book covers many of the key topics in contro ..."
Abstract

Cited by 485 (122 self)
 Add to MetaCart
The title of this book gives a very good description of its contents and style, although I might have added “Introduction to ” at the beginning. The style is mathematical: precise, clear statements (i.e., theorems) are asserted, then carefully proved. The book covers many of the key topics in control theory, except — as the subtitle has warned us — those involving stochastic processes or infinitedimensional systems. The level is appropriate for a senior
A Syntactic Approach to Type Soundness
 INFORMATION AND COMPUTATION
, 1992
"... We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract

Cited by 634 (25 self)
 Add to MetaCart
We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification
Subelliptic Estimates and Finite Type
 SEVERAL COMPLEX VARIABLES, MSRI PUBLICATIONS 37
, 1999
"... This paper surveys work in partial differential equations and several complex variables that revolves around subelliptic estimates in the ∂Neumann problem. The paper begins with a discussion of the question of local regularity; one is given a bounded pseudoconvex domain with smooth boundary, and ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
and Nirenberg, the answer is yes when there is a subelliptic estimate. The paper sketches the proof of this result, and goes on to discuss the history of various finitetype conditions on the boundary and their relationships to subelliptic estimates. This includes finitetype conditions involving iterated
A modular threedimensional finitedifference groundwater flow model
 U.S. Geological Survey Techniques of WaterResources Investigations Book 6, Chapter A1
, 1988
"... The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation of groundwate ..."
Abstract

Cited by 485 (5 self)
 Add to MetaCart
The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation
DIFFERENTIAL ALGEBRAS OF FINITE TYPE
, 2003
"... We study homological and geometric properties of differential algebras of finite type over a base field. The main results concern rigid dualizing complexes over such algebras. ..."
Abstract
 Add to MetaCart
We study homological and geometric properties of differential algebras of finite type over a base field. The main results concern rigid dualizing complexes over such algebras.
Results 1  10
of
985,366